oj.uz

Submission #718587

# Submission time Handle Problem Language Result Execution time Memory
718587 2023-04-04T11:13:34 Z myrcella Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 426396 KB 
//by szh
#include<bits/stdc++.h>
#include <unordered_map>
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];	
pii qid[maxn];
 
bool check(int cnt,bool flag) {
	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;
		if (x==y) continue;
		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;
	}
	int hi = 0;
	rep(i,0,cnt) {
		int x = p[i].fi,y=p[i].se;
		if (x!=y) {
    		swap(b[x],b[y]);
    		pos[b[x]].se = x,pos[b[y]].se = y;
    		
    		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();
		}
		pii cur = {0,0};
		while (hi<n and pos[hi].fi==pos[hi].se) hi++;
		if (hi<n) cur = pos[hi];
		x = cur.fi,y=cur.se;
		if (x!=y) {
		    swap(b[x],b[y]);
		    pos[b[x]].se = x,pos[b[y]].se = y;
		}
      	ans[i] = cur;
      	if (flag and hi==n) return true;
	}
	while (hi<n and pos[hi].fi==pos[hi].se) hi++;
	return hi==n;
}
 
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,true)) r = mid;
		else l = mid+1;
	}
	check(l,false);
	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:89:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |   int mid=l+r>>1;
      |           ~^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 404276 KB Output is correct
2 Correct 229 ms 404260 KB Output is correct
3 Correct 246 ms 404168 KB Output is correct
4 Correct 244 ms 404368 KB Output is correct
5 Correct 250 ms 404264 KB Output is correct
6 Correct 233 ms 404260 KB Output is correct
7 Correct 236 ms 404196 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 404276 KB Output is correct
2 Correct 229 ms 404260 KB Output is correct
3 Correct 246 ms 404168 KB Output is correct
4 Correct 244 ms 404368 KB Output is correct
5 Correct 250 ms 404264 KB Output is correct
6 Correct 233 ms 404260 KB Output is correct
7 Correct 236 ms 404196 KB Output is correct
8 Correct 238 ms 404216 KB Output is correct
9 Correct 237 ms 404260 KB Output is correct
10 Correct 247 ms 404300 KB Output is correct
11 Correct 238 ms 404308 KB Output is correct
12 Correct 240 ms 404204 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 404320 KB Output is correct
2 Correct 242 ms 404264 KB Output is correct
3 Correct 229 ms 404268 KB Output is correct
4 Correct 266 ms 404308 KB Output is correct
5 Correct 240 ms 404300 KB Output is correct
6 Correct 236 ms 404264 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 404276 KB Output is correct
2 Correct 229 ms 404260 KB Output is correct
3 Correct 246 ms 404168 KB Output is correct
4 Correct 244 ms 404368 KB Output is correct
5 Correct 250 ms 404264 KB Output is correct
6 Correct 233 ms 404260 KB Output is correct
7 Correct 236 ms 404196 KB Output is correct
8 Correct 238 ms 404216 KB Output is correct
9 Correct 237 ms 404260 KB Output is correct
10 Correct 247 ms 404300 KB Output is correct
11 Correct 238 ms 404308 KB Output is correct
12 Correct 240 ms 404204 KB Output is correct
13 Correct 240 ms 404320 KB Output is correct
14 Correct 242 ms 404264 KB Output is correct
15 Correct 229 ms 404268 KB Output is correct
16 Correct 266 ms 404308 KB Output is correct
17 Correct 240 ms 404300 KB Output is correct
18 Correct 236 ms 404264 KB Output is correct
19 Correct 243 ms 404204 KB Output is correct
20 Correct 235 ms 404352 KB Output is correct
21 Correct 252 ms 404572 KB Output is correct
22 Correct 234 ms 404684 KB Output is correct
23 Correct 274 ms 404484 KB Output is correct
24 Correct 237 ms 404600 KB Output is correct
25 Correct 266 ms 404556 KB Output is correct
26 Correct 233 ms 404572 KB Output is correct
27 Correct 260 ms 404568 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 404440 KB Output is correct
2 Correct 254 ms 404368 KB Output is correct
3 Correct 272 ms 404556 KB Output is correct
4 Correct 234 ms 404440 KB Output is correct
5 Correct 246 ms 404452 KB Output is correct
6 Correct 234 ms 404368 KB Output is correct
7 Correct 240 ms 404460 KB Output is correct
8 Correct 244 ms 404348 KB Output is correct
9 Correct 245 ms 404476 KB Output is correct
10 Correct 247 ms 404528 KB Output is correct
11 Correct 241 ms 404452 KB Output is correct
12 Correct 235 ms 404488 KB Output is correct
13 Correct 240 ms 404444 KB Output is correct
14 Correct 232 ms 404436 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 240 ms 404440 KB Output is correct
2 Correct 254 ms 404368 KB Output is correct
3 Correct 272 ms 404556 KB Output is correct
4 Correct 234 ms 404440 KB Output is correct
5 Correct 246 ms 404452 KB Output is correct
6 Correct 234 ms 404368 KB Output is correct
7 Correct 240 ms 404460 KB Output is correct
8 Correct 244 ms 404348 KB Output is correct
9 Correct 245 ms 404476 KB Output is correct
10 Correct 247 ms 404528 KB Output is correct
11 Correct 241 ms 404452 KB Output is correct
12 Correct 235 ms 404488 KB Output is correct
13 Correct 240 ms 404444 KB Output is correct
14 Correct 232 ms 404436 KB Output is correct
15 Correct 769 ms 425300 KB Output is correct
16 Execution timed out 1086 ms 426396 KB Time limit exceeded
17 Halted 0 ms 0 KB -