oj.uz

Submission #923778

# Submission time Handle Problem Language Result Execution time Memory
923778 2024-02-07T18:26:05 Z winter0101 Sorting (IOI15_sorting) C++14
100 / 100
 178 ms 23420 KB 
#include<bits/stdc++.h>
#include "sorting.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
for1(i,0,M-1)P[i]=Q[i]=0;
auto ck=[&](const vector<int>&p){
for1(i,0,N-1)if (p[i]!=i)return false;
return true;
};
vector<int>tmp(N);
for1(i,0,N-1)tmp[i]=S[i];
if (ck(tmp))return 0;
vector<pii>step;
auto check=[&](int mid){
vector<int>p(N);
step.clear();
for1(i,0,N-1)p[i]=S[i];
for1(i,0,mid){
swap(p[X[i]],p[Y[i]]);
}
vector<bool>vis(N);
int ans=0;
for1(i,0,N-1){
if (vis[i])continue;
auto u=i;
int cc=0;
while (true){
if (vis[u])break;
vis[u]=1;
cc++;
u=p[u];
}
ans+=cc-1;
}
for1(i,0,N-1){
while (i!=p[i]){
step.pb({p[i],p[p[i]]});
swap(p[i],p[p[i]]);
}
}
if (ans<=mid+1)return true;
return false;
};
int l=0,r=M-1,ans=M-1;
while (l<=r){
int mid=(l+r)/2;
if (check(mid)){
ans=mid;
r=mid-1;
}
else l=mid+1;
}
check(ans);
while (sz(step)<ans+1){
step.pb({0,0});
}
vector<int>pos(N),s(N);
for1(i,0,N-1)pos[S[i]]=i,s[i]=S[i];
for1(i,0,ans){
swap(pos[s[X[i]]],pos[s[Y[i]]]);
swap(s[X[i]],s[Y[i]]);
P[i]=pos[step[i].fi],Q[i]=pos[step[i].se];
swap(pos[step[i].fi],pos[step[i].se]);
swap(s[P[i]],s[Q[i]]);
}
return ans+1;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 760 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 760 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 146 ms 20536 KB Output is correct
16 Correct 169 ms 20996 KB Output is correct
17 Correct 171 ms 22024 KB Output is correct
18 Correct 37 ms 18516 KB Output is correct
19 Correct 134 ms 22584 KB Output is correct
20 Correct 156 ms 23256 KB Output is correct
21 Correct 146 ms 23236 KB Output is correct
22 Correct 144 ms 17352 KB Output is correct
23 Correct 169 ms 22836 KB Output is correct
24 Correct 169 ms 22556 KB Output is correct
25 Correct 178 ms 22320 KB Output is correct
26 Correct 135 ms 22712 KB Output is correct
27 Correct 124 ms 22112 KB Output is correct
28 Correct 164 ms 22624 KB Output is correct
29 Correct 165 ms 22724 KB Output is correct
30 Correct 94 ms 21956 KB Output is correct
31 Correct 164 ms 22928 KB Output is correct
32 Correct 159 ms 21972 KB Output is correct
33 Correct 171 ms 22488 KB Output is correct
34 Correct 171 ms 22472 KB Output is correct
35 Correct 133 ms 22264 KB Output is correct
36 Correct 53 ms 21436 KB Output is correct
37 Correct 175 ms 23420 KB Output is correct
38 Correct 167 ms 22320 KB Output is correct
39 Correct 178 ms 22744 KB Output is correct