#include "sorting.h"
#include <bits/stdc++.h>
#define MAXN 200015
using namespace std;
int bk[MAXN],pos_bk[MAXN],pre[MAXN],pos_pre[MAXN];
int solve(int N,int n,int S[],int P[],int Q[],int X[],int Y[]){
for (int i=0;i<N;i++){
bk[i]=i; pos_bk[i]=i;
pre[i]=S[i]; pos_pre[S[i]]=i;
}
for (int i=n-1;i>=0;i--){
swap(bk[X[i]],bk[Y[i]]);
pos_bk[bk[X[i]]]=X[i];
pos_bk[bk[Y[i]]]=Y[i];
}
int now=0;
for (int i=0;i<n;i++){
bool flag=1;
for (int j=0;j<N;j++){
if (pre[j]!=j){
flag=0;
break;
}
}
if (flag)
return i;
swap(pre[X[i]],pre[Y[i]]);
pos_pre[pre[X[i]]]=X[i];
pos_pre[pre[Y[i]]]=Y[i];
swap(bk[X[i]],bk[Y[i]]);
pos_bk[bk[X[i]]]=X[i];
pos_bk[bk[Y[i]]]=Y[i];
now=i;
while (now<N&&pos_pre[now]==pos_bk[now])
now++;
if (now>=N) continue;
P[i]=pos_pre[now]; Q[i]=pos_bk[now];
swap(pre[pos_pre[now]],pre[pos_bk[now]]);
pos_pre[pre[pos_pre[now]]]=pos_pre[now];
pos_pre[pre[pos_bk[now]]]=pos_bk[now];
}
bool flag=1;
for (int i=0;i<N;i++){
if (pre[i]!=i) flag=0;
}
if (flag) return n;
else return 1e9;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
int mn=1e9,pos;
for (int i=0;i<M;i++){
int need=solve(N,i,S,P,Q,X,Y);
if (need<1e8)
return need;
}
return mn;
}
Compilation message
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:50:16: warning: unused variable 'pos' [-Wunused-variable]
50 | int mn=1e9,pos;
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
0 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
8 ms |
340 KB |
Output is correct |
22 |
Correct |
8 ms |
356 KB |
Output is correct |
23 |
Correct |
7 ms |
340 KB |
Output is correct |
24 |
Correct |
7 ms |
340 KB |
Output is correct |
25 |
Correct |
2 ms |
340 KB |
Output is correct |
26 |
Correct |
5 ms |
340 KB |
Output is correct |
27 |
Correct |
11 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
109 ms |
400 KB |
Output is correct |
2 |
Correct |
455 ms |
480 KB |
Output is correct |
3 |
Correct |
103 ms |
468 KB |
Output is correct |
4 |
Correct |
1 ms |
468 KB |
Output is correct |
5 |
Correct |
5 ms |
448 KB |
Output is correct |
6 |
Correct |
23 ms |
472 KB |
Output is correct |
7 |
Correct |
144 ms |
476 KB |
Output is correct |
8 |
Correct |
111 ms |
468 KB |
Output is correct |
9 |
Correct |
118 ms |
468 KB |
Output is correct |
10 |
Correct |
103 ms |
468 KB |
Output is correct |
11 |
Correct |
104 ms |
468 KB |
Output is correct |
12 |
Correct |
143 ms |
476 KB |
Output is correct |
13 |
Correct |
323 ms |
468 KB |
Output is correct |
14 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
109 ms |
400 KB |
Output is correct |
2 |
Correct |
455 ms |
480 KB |
Output is correct |
3 |
Correct |
103 ms |
468 KB |
Output is correct |
4 |
Correct |
1 ms |
468 KB |
Output is correct |
5 |
Correct |
5 ms |
448 KB |
Output is correct |
6 |
Correct |
23 ms |
472 KB |
Output is correct |
7 |
Correct |
144 ms |
476 KB |
Output is correct |
8 |
Correct |
111 ms |
468 KB |
Output is correct |
9 |
Correct |
118 ms |
468 KB |
Output is correct |
10 |
Correct |
103 ms |
468 KB |
Output is correct |
11 |
Correct |
104 ms |
468 KB |
Output is correct |
12 |
Correct |
143 ms |
476 KB |
Output is correct |
13 |
Correct |
323 ms |
468 KB |
Output is correct |
14 |
Correct |
1 ms |
468 KB |
Output is correct |
15 |
Execution timed out |
1048 ms |
15600 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |