oj.uz

답안 #718578

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
718578 2023-04-04T11:00:33 Z myrcella 정렬하기 (IOI15_sorting) C++17
74 / 100
 1000 ms 426800 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) {
	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;
	}
	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)) 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:89:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |   int mid=l+r>>1;
      |           ~^~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 404340 KB Output is correct
2 Correct 226 ms 404184 KB Output is correct
3 Correct 232 ms 404264 KB Output is correct
4 Correct 225 ms 404288 KB Output is correct
5 Correct 227 ms 404260 KB Output is correct
6 Correct 224 ms 404180 KB Output is correct
7 Correct 224 ms 404252 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 404340 KB Output is correct
2 Correct 226 ms 404184 KB Output is correct
3 Correct 232 ms 404264 KB Output is correct
4 Correct 225 ms 404288 KB Output is correct
5 Correct 227 ms 404260 KB Output is correct
6 Correct 224 ms 404180 KB Output is correct
7 Correct 224 ms 404252 KB Output is correct
8 Correct 231 ms 404256 KB Output is correct
9 Correct 232 ms 404264 KB Output is correct
10 Correct 249 ms 404428 KB Output is correct
11 Correct 234 ms 404268 KB Output is correct
12 Correct 231 ms 404252 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 235 ms 404172 KB Output is correct
2 Correct 229 ms 404268 KB Output is correct
3 Correct 233 ms 404280 KB Output is correct
4 Correct 228 ms 404248 KB Output is correct
5 Correct 247 ms 404300 KB Output is correct
6 Correct 237 ms 404264 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 404340 KB Output is correct
2 Correct 226 ms 404184 KB Output is correct
3 Correct 232 ms 404264 KB Output is correct
4 Correct 225 ms 404288 KB Output is correct
5 Correct 227 ms 404260 KB Output is correct
6 Correct 224 ms 404180 KB Output is correct
7 Correct 224 ms 404252 KB Output is correct
8 Correct 231 ms 404256 KB Output is correct
9 Correct 232 ms 404264 KB Output is correct
10 Correct 249 ms 404428 KB Output is correct
11 Correct 234 ms 404268 KB Output is correct
12 Correct 231 ms 404252 KB Output is correct
13 Correct 235 ms 404172 KB Output is correct
14 Correct 229 ms 404268 KB Output is correct
15 Correct 233 ms 404280 KB Output is correct
16 Correct 228 ms 404248 KB Output is correct
17 Correct 247 ms 404300 KB Output is correct
18 Correct 237 ms 404264 KB Output is correct
19 Correct 271 ms 404256 KB Output is correct
20 Correct 243 ms 404304 KB Output is correct
21 Correct 269 ms 404624 KB Output is correct
22 Correct 235 ms 404680 KB Output is correct
23 Correct 261 ms 404628 KB Output is correct
24 Correct 252 ms 404596 KB Output is correct
25 Correct 243 ms 404560 KB Output is correct
26 Correct 245 ms 404540 KB Output is correct
27 Correct 230 ms 404556 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 404480 KB Output is correct
2 Correct 237 ms 404500 KB Output is correct
3 Correct 268 ms 404564 KB Output is correct
4 Correct 237 ms 404428 KB Output is correct
5 Correct 242 ms 404488 KB Output is correct
6 Correct 229 ms 404360 KB Output is correct
7 Correct 233 ms 404556 KB Output is correct
8 Correct 231 ms 404476 KB Output is correct
9 Correct 246 ms 404384 KB Output is correct
10 Correct 242 ms 404512 KB Output is correct
11 Correct 230 ms 404532 KB Output is correct
12 Correct 242 ms 404432 KB Output is correct
13 Correct 229 ms 404436 KB Output is correct
14 Correct 236 ms 404400 KB Output is correct

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 404480 KB Output is correct
2 Correct 237 ms 404500 KB Output is correct
3 Correct 268 ms 404564 KB Output is correct
4 Correct 237 ms 404428 KB Output is correct
5 Correct 242 ms 404488 KB Output is correct
6 Correct 229 ms 404360 KB Output is correct
7 Correct 233 ms 404556 KB Output is correct
8 Correct 231 ms 404476 KB Output is correct
9 Correct 246 ms 404384 KB Output is correct
10 Correct 242 ms 404512 KB Output is correct
11 Correct 230 ms 404532 KB Output is correct
12 Correct 242 ms 404432 KB Output is correct
13 Correct 229 ms 404436 KB Output is correct
14 Correct 236 ms 404400 KB Output is correct
15 Correct 732 ms 426044 KB Output is correct
16 Execution timed out 1051 ms 426800 KB Time limit exceeded
17 Halted 0 ms 0 KB -