Submission #17168958

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define MOD (1000000000+7)
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define nl '\n'
#define all(x) x.begin(), x.end()
#define print(vec,l,r) for(int i = l; i <= r; i++) cout << vec[i] <<" "; cout << endl;
#define forf(i,a,b) for(int i = (a); i < (b); i++)
#define forr(i,a,b) for(int i = (a); i > (b); i--)
#define input(vec,N) for(int i = 0; i < (N); i++) cin >> vec[i];
#define debug(x) cerr << #x << " = " << (x) << endl;

// template starts
typedef long long int ll;
#define int ll

// template ends here

void solve(){
	// code starts from here
	int N;
	cin >> N;
	vector<pair<int,int>> vec(N);
	for(int i = 0; i < N; i++) cin >> vec[i].first >> vec[i].second;
	
	for(int i = 0; i < N; i++){
		if(vec[i].first == -1 && vec[i].second == 1){
			cout << "No" << endl;
			return;
		}
		if(vec[i].first == 2*N && vec[i].second == -1){
			cout << "No" << endl;
			return;
		}
		if(vec[i].first == -1 || vec[i].second == -1) continue;
		if(vec[i].first >= vec[i].second){
			cout << "No" << endl;
			return;
		}
	}
	for(int i = 0; i < N; i++){
		for(int j = i+1; j < N; j++){
			if(vec[i].first != -1){
				if(vec[i].first == vec[j].first || vec[i].first == vec[j].second){
					cout<< "No" << endl;
					return;
				}
			}
			if(vec[i].second != -1){
				if(vec[i].second == vec[j].first || vec[i].second == vec[j].second){
					cout<< "No" << endl;
					return;
				}
			}
		}
	}	
	for(int i = 0; i < N; i++){
		if(vec[i].first == -1 || vec[i].second == -1) continue;
		for(int j = 0; j < N; j++){
			int t1 = vec[i].second-vec[i].first-1;
			int t2 = vec[j].second-vec[j].first-1;
			
			if(vec[j].first == -1 || vec[j].second == -1) continue;
			
			if(t1 == t2) continue;
			if(vec[j].second < vec[i].first || vec[j].first > vec[i].second) continue;
			
			cout << "No" << endl;
			return;
		}
	}
	for(int i = 0; i < N; i++){
		if(vec[i].first != -1 && vec[i].second != -1) continue;
		if(vec[i].first == -1 && vec[i].second == -1) continue;
		
		for(int j = 0; j < N; j++){		
			if(vec[j].first == -1 || vec[j].second == -1) continue;
			
			if(vec[i].first == -1){
				if(!(vec[j].first < vec[i].second && vec[i].second < vec[j].second)) continue;
				
				int t = vec[j].second-vec[j].first;
				vec[i].first = vec[i].second-t;
				break;
			}
			else if(vec[i].second == -1){
				if(!(vec[j].first < vec[i].first && vec[i].first < vec[j].second)) continue;
				
				int t = vec[j].second-vec[j].first;
				vec[i].second = vec[i].first+t;
				break;
			}
			
		}
	}
	
	for(int i = 0; i < N; i++){
		if(vec[i].first == -1 || vec[i].second == -1) continue;
		for(int j = 0; j < N; j++){
			int t1 = vec[i].second-vec[i].first-1;
			int t2 = vec[j].second-vec[j].first-1;
			
			if(vec[j].first == -1 || vec[j].second == -1) continue;
			
			if(vec[i].first < 0 || vec[i].second > 2*N || vec[j].second < 0 || vec[j].second > 2*N){
				cout << "No" << endl;
				return;
			}
			if(t1 == t2) continue;
			if(vec[j].second < vec[i].first || vec[j].first > vec[i].second) continue;
			
			cout << "No" << endl;
			return;
		}
	}
	for(int i = 0; i < N; i++){
		for(int j = i+1; j < N; j++){
			if(vec[i].first != -1){
				if(vec[i].first == vec[j].first || vec[i].first == vec[j].second){
					cout<< "No" << endl;
					return;
				}
			}
			if(vec[i].second != -1){
				if(vec[i].second == vec[j].first || vec[i].second == vec[j].second){
					cout<< "No" << endl;
					return;
				}
			}
		}
	}	
	 cout << "Yes" << endl;
	return;
}


clock_t startTime;
double getCurrentTime() {
	return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}

signed main(){
 	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	//startTime = clock();
	
	int T;
	//cin >> T;
	T = 1;
	while(T--){
		solve();
	}
	
	//cout << getCurrentTime() << endl;
	return 0;
}

Submission Info

Judge Result