Submission #8387063


Source Code Expand

Copy
#include <bits/stdc++.h>
    
using namespace std;
 
#define f first
#define s second
#define pb push_back
#define sz(v) ((int)v.size())   
#define rad(a) a * PI / 180  
 
typedef long long ll;
typedef vector<int> vi;	
typedef pair<int,int> ii;
typedef pair<int,char> ic;
typedef pair<ll, bool> llb;
 
const int SIGMA = 20;
const int MAX = 100010;
const int MAXT = 362145;
const ll INF = 1000000001;
const ll P = 998244353LL; //1000000007;
const double EPS = 1e-6;
const double PI = 3.14159265358979;

int N;
int A[MAX], B[MAX];
ii elem[MAX];
int tree[MAXT];
vector<bool> swapped(MAX, false);
int prepare(int b, int e, int node){
	if(b == e){
		return tree[node] = e;
	}

	int m = (b+e)>>1, node2 = node << 1;
	int l = prepare(b,m,node2+1);
	int r = prepare(m+1,e,node2+2);
	if(elem[l].f <= elem[r].f){
		return tree[node] = l;
	}
	return tree[node] = r;
}

int update(int b, int e, int node, int p){
	if(p < b || p > e) return tree[node];
	if(b == e) return tree[node] = e;
	int m = (b+e)>>1, node2 = node << 1;
	int l = update(b,m,node2+1,p);
	int r = update(m+1,e,node2+2,p);
	if(elem[l].f <= elem[r].f){
		return tree[node] = l;
	}
	return tree[node] = r;
}

int query(int bq, int eq, int node, int bt, int et){
	if(bt > eq || et < bq) return -1;
 
	if(bq <= bt && et <= eq) return tree[node];
 
	int mid = (bt + et) >> 1;
	int leftMin = query(bq, eq, (node<<1) + 1, bt, mid);
	int rightMin = query(bq, eq, (node<<1) + 2, mid+1, et);
 
	if(leftMin == -1) return rightMin;
	if(rightMin == -1) return leftMin;
	
	return elem[leftMin].f <= elem[rightMin].f ? leftMin : rightMin;
}

int bs_lower(int b, int Ai){
	int e = N-1, f = -1;
	while(b <= e){
		int m = (b+e)>>1;
		if(elem[m].s >= Ai){
			e = m-1;
			f = m;
		}
		else{
			b = m+1;
		}
	}
	return f;
}

bool cmp(const ii &a, const ii &b){
	if(a.s != b.s) return a.s < b.s;
	return a.f > a.f;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> N;
	for(int i = 0; i < N; i++){
		cin >> elem[i].f;
		A[i] = elem[i].f;
	}

	for(int i = 0; i < N; i++){
		cin >> elem[i].s;
		B[i] = elem[i].s;
	}

	sort(A,A+N);
	sort(B,B+N);
	for(int i = 0; i < N; i++){
		if(A[i] > B[i]){
			cout << "No" << endl;
			return 0;
		}			
	}

	sort(elem, elem+N, cmp);

	prepare(0, N-1, 0);

	int swaps = 0;
	for(int i = 0; i < N; i++){
		if(elem[i].f <= elem[i].s){
			if(!swapped[i]){
				cout << "Yes" << endl;
				return 0;
			}
			continue;
		}

		swaps++;

		int j = bs_lower(i+1,elem[i].f);
		if(j != -1){
			int l = query(j,N-1,0,0,N-1);
			if(elem[l].f <= elem[i].s){
//				cout << "swap " << i << " " << l << endl;
				int s = elem[l].f;
				elem[l].f = elem[i].f;
				update(0,N-1,0,l);
				elem[i].f = s;
				update(0,N-1,0,i);
				swapped[l] = swapped[i] = true;
				continue ;
			}
		}
		
		int l = query(i+1,N-1,0,0,N-1);
		if(elem[l].f > elem[i].s){
			cout << "No" << endl;
			return 0;
		}
//		cout << "swap " << i << " " << l << endl;
		int s = elem[l].f;
		elem[l].f = elem[i].f;
		update(0,N-1,0,l);
		elem[i].f = s;
		update(0,N-1,0,i);
		swapped[l] = swapped[i] = true;
	}

	cout << ((swaps <= N-2) ? "Yes" : "No") << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Swaps
User mdallrosa
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3268 Byte
Status
Exec Time 114 ms
Memory 2816 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample01.txt, sample02.txt, sample03.txt
All 0 / 600 sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, sample01.txt, sample02.txt, sample03.txt
Case Name Status Exec Time Memory
in01.txt 112 ms 2816 KB
in02.txt 105 ms 2688 KB
in03.txt 104 ms 2688 KB
in04.txt 111 ms 2816 KB
in05.txt 112 ms 2816 KB
in06.txt 78 ms 2816 KB
in07.txt 79 ms 2816 KB
in08.txt 76 ms 2816 KB
in09.txt 74 ms 2816 KB
in10.txt 76 ms 2816 KB
in11.txt 78 ms 2688 KB
in12.txt 104 ms 2688 KB
in13.txt 105 ms 2688 KB
in14.txt 78 ms 2816 KB
in15.txt 64 ms 2688 KB
in16.txt 110 ms 2816 KB
in17.txt 106 ms 2816 KB
in18.txt 111 ms 2816 KB
in19.txt 106 ms 2816 KB
in20.txt 114 ms 2816 KB
in21.txt 92 ms 2816 KB
in22.txt 93 ms 2816 KB
in23.txt 89 ms 2816 KB
in24.txt 84 ms 2816 KB
in25.txt 89 ms 2816 KB
in26.txt 27 ms 1024 KB
in27.txt 29 ms 1024 KB
in28.txt 30 ms 1408 KB
in29.txt 2 ms 384 KB
in30.txt 5 ms 384 KB
in31.txt 60 ms 1664 KB
in32.txt 27 ms 1024 KB
in33.txt 37 ms 1536 KB
sample01.txt 1 ms 256 KB
sample02.txt 1 ms 256 KB
sample03.txt 1 ms 256 KB