oj.uz

Submission #718500

# Submission time Handle Problem Language Result Execution time Memory
718500 2023-04-04T09:02:56 Z myrcella Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 458236 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "sorting.h"

const int maxn = 6e5+10;

int n,m;
int a[maxn],b[maxn];
pii ans[maxn];
pii p[maxn];
deque <int> q[maxn];
int id[maxn];
pii pos[maxn];	
map <pii,int> cntt;
set <pii> nxt1,nxt2;
pii qid[maxn];

void update(int x,int y,int val) {
	if (pos[x].fi!=pos[x].se) {
		pii tmp = {min(pos[x].fi,pos[x].se),max(pos[x].fi,pos[x].se)};
		cntt[tmp]+=val;
		int hi = cntt[tmp];
		if (hi!=1) nxt1.erase(tmp);
		if (hi!=2) nxt2.erase(tmp);
		if (hi==1) nxt1.insert(tmp);
		else if (hi==2) nxt2.insert(tmp);
	}
	if (pos[y].fi!=pos[y].se) {
		pii tmp = {min(pos[y].fi,pos[y].se),max(pos[y].fi,pos[y].se)};
		cntt[tmp]+=val;
		int hi = cntt[tmp];
		if (hi!=1) nxt1.erase(tmp);
		if (hi!=2) nxt2.erase(tmp);
		if (hi==1) nxt1.insert(tmp);
		else if (hi==2) nxt2.insert(tmp);
	}
}

bool check(int cnt) {
	cntt.clear();nxt1.clear(),nxt2.clear();
	rep(i,0,n) {
		while (!q[i].empty()) q[i].pop_back();
		q[i].pb(i);
		id[i] = i;
		b[i] = a[i];
	}
	rep(i,0,cnt) {
		int x=p[i].fi,y=p[i].se;
		q[id[x]].pb(y);
		q[id[y]].pb(x);
		swap(id[x],id[y]);
		qid[i] = {id[x],id[y]};
	}
	rep(i,0,n) {
		pos[q[i].back()].fi = q[i].front();
		pos[a[i]].se = i;
	}
	rep(i,0,n) if (pos[i].fi!=pos[i].se) {
		pii tmp = {min(pos[i].fi,pos[i].se),max(pos[i].fi,pos[i].se)};
		cntt[tmp]++;
		if (cntt[tmp]==2) {
			nxt1.erase(tmp);
			nxt2.insert(tmp);
		}
		else nxt1.insert(tmp);
	}
	rep(i,0,cnt) {
		int x = p[i].fi,y=p[i].se;
		swap(b[x],b[y]);
		update(b[x],b[y],-1);
		pos[b[x]].se = x,pos[b[y]].se = y;
		update(b[x],b[y],1);
		
		update(q[qid[i].fi].back(),q[qid[i].se].back(),-1);
		q[qid[i].fi].pop_front(),q[qid[i].se].pop_front();
		pos[q[qid[i].fi].back()].fi = q[qid[i].fi].front();
		pos[q[qid[i].se].back()].fi = q[qid[i].se].front();
		update(q[qid[i].fi].back(),q[qid[i].se].back(),1);
		
		pii cur;
		if (!nxt2.empty()) cur = *nxt2.begin();
		else if (!nxt1.empty()) cur = *nxt1.begin();
		else cur = {0,0};
		x = cur.fi,y=cur.se;
		swap(b[x],b[y]);
		update(b[x],b[y],-1);
		pos[b[x]].se = x,pos[b[y]].se = y;
		update(b[x],b[y],1);
		ans[i] = cur;
	}
	return (nxt1.empty() and nxt2.empty());
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	n = N,m= M;
    int l=0,r=M;
    rep(i,0,n) a[i] =S[i];
    rep(i,0,M) p[i] = {X[i],Y[i]};
    while (l<r) {
		int mid=l+r>>1;
		if (check(mid)) r = mid;
		else l = mid+1;
	}
	assert(check(l));
	rep(i,0,l) P[i] = ans[i].fi, Q[i] = ans[i].se;
	return l;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:121:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  121 |   int mid=l+r>>1;
      |           ~^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 404172 KB Output is correct
2 Correct 238 ms 404360 KB Output is correct
3 Correct 252 ms 404168 KB Output is correct
4 Correct 232 ms 404384 KB Output is correct
5 Correct 276 ms 404280 KB Output is correct
6 Correct 288 ms 404152 KB Output is correct
7 Correct 316 ms 404360 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 404172 KB Output is correct
2 Correct 238 ms 404360 KB Output is correct
3 Correct 252 ms 404168 KB Output is correct
4 Correct 232 ms 404384 KB Output is correct
5 Correct 276 ms 404280 KB Output is correct
6 Correct 288 ms 404152 KB Output is correct
7 Correct 316 ms 404360 KB Output is correct
8 Correct 329 ms 404264 KB Output is correct
9 Correct 253 ms 404264 KB Output is correct
10 Correct 304 ms 404368 KB Output is correct
11 Correct 302 ms 404320 KB Output is correct
12 Correct 244 ms 404360 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 404308 KB Output is correct
2 Correct 229 ms 404216 KB Output is correct
3 Correct 232 ms 404372 KB Output is correct
4 Correct 234 ms 404340 KB Output is correct
5 Correct 230 ms 404364 KB Output is correct
6 Correct 228 ms 404392 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 404172 KB Output is correct
2 Correct 238 ms 404360 KB Output is correct
3 Correct 252 ms 404168 KB Output is correct
4 Correct 232 ms 404384 KB Output is correct
5 Correct 276 ms 404280 KB Output is correct
6 Correct 288 ms 404152 KB Output is correct
7 Correct 316 ms 404360 KB Output is correct
8 Correct 329 ms 404264 KB Output is correct
9 Correct 253 ms 404264 KB Output is correct
10 Correct 304 ms 404368 KB Output is correct
11 Correct 302 ms 404320 KB Output is correct
12 Correct 244 ms 404360 KB Output is correct
13 Correct 229 ms 404308 KB Output is correct
14 Correct 229 ms 404216 KB Output is correct
15 Correct 232 ms 404372 KB Output is correct
16 Correct 234 ms 404340 KB Output is correct
17 Correct 230 ms 404364 KB Output is correct
18 Correct 228 ms 404392 KB Output is correct
19 Correct 226 ms 404172 KB Output is correct
20 Correct 240 ms 404160 KB Output is correct
21 Correct 270 ms 405296 KB Output is correct
22 Correct 264 ms 405444 KB Output is correct
23 Correct 276 ms 405332 KB Output is correct
24 Correct 260 ms 404836 KB Output is correct
25 Correct 247 ms 404772 KB Output is correct
26 Correct 256 ms 405168 KB Output is correct
27 Correct 274 ms 404940 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 404872 KB Output is correct
2 Correct 302 ms 404900 KB Output is correct
3 Correct 328 ms 405320 KB Output is correct
4 Correct 254 ms 405216 KB Output is correct
5 Correct 253 ms 405084 KB Output is correct
6 Correct 259 ms 405228 KB Output is correct
7 Correct 295 ms 405132 KB Output is correct
8 Correct 357 ms 405312 KB Output is correct
9 Correct 331 ms 405248 KB Output is correct
10 Correct 341 ms 405248 KB Output is correct
11 Correct 323 ms 405004 KB Output is correct
12 Correct 284 ms 405212 KB Output is correct
13 Correct 331 ms 405052 KB Output is correct
14 Correct 232 ms 404516 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 404872 KB Output is correct
2 Correct 302 ms 404900 KB Output is correct
3 Correct 328 ms 405320 KB Output is correct
4 Correct 254 ms 405216 KB Output is correct
5 Correct 253 ms 405084 KB Output is correct
6 Correct 259 ms 405228 KB Output is correct
7 Correct 295 ms 405132 KB Output is correct
8 Correct 357 ms 405312 KB Output is correct
9 Correct 331 ms 405248 KB Output is correct
10 Correct 341 ms 405248 KB Output is correct
11 Correct 323 ms 405004 KB Output is correct
12 Correct 284 ms 405212 KB Output is correct
13 Correct 331 ms 405052 KB Output is correct
14 Correct 232 ms 404516 KB Output is correct
15 Execution timed out 1072 ms 458236 KB Time limit exceeded
16 Halted 0 ms 0 KB -