#include "sorting.h"
#include <random>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
mt19937 mt(2009190008);
int rand_rng(int l, int r) {
uniform_int_distribution<int> p(l, r - 1);
return p(mt);
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
fill(P, P + M, 0);
fill(Q, Q + M, 0);
if(is_sorted(S, S + N)) {
return 0;
}
int L = 0;
while(true) {
swap(S[X[L]], S[Y[L]]);
++L;
vector<bool> vis(N, false);
int cycles = 0;
for(int i = 0; i < N; ++i) {
if(vis[i]) continue;
int pos = i;
++cycles;
while(!vis[pos]) {
vis[pos] = true;
pos = S[pos];
}
}
int steps = N - cycles;
if(L >= steps) break;
}
for(int i = 0; i < L; ++i) {
int cycles = 0;
vector<int> col(N, -1);
for(int j = 0; j < N; ++j) {
if(col[j] != -1) continue;
int pos = j;
while(col[pos] == -1) {
col[pos] = j;
pos = S[pos];
}
++cycles;
}
if(cycles == N) {
P[i] = 0;
Q[i] = 0;
}
else {
vector<vector<int> > G(N);
for(int j = 0; j < N; ++j) {
G[col[j]].push_back(j);
}
for(int j = 0; j < N; ++j) {
if(G[j].size() >= 2) {
P[i] = G[j][0];
Q[i] = G[j][1];
break;
}
}
swap(S[P[i]], S[Q[i]]);
}
}
for(int i = 0; i < L; ++i) {
if(P[i] == Q[i]) continue;
for(int j = L - 1; j >= i + 1; --j) {
if(X[j] == Y[j]) continue;
if(X[j] == P[i] && Y[j] != Q[i]) {
P[i] = Y[j];
}
else if(X[j] == Q[i] && Y[j] != P[i]) {
Q[i] = Y[j];
}
else if(Y[j] == P[i] && X[j] != Q[i]) {
P[i] = X[j];
}
else if(Y[j] == Q[i] && X[j] != P[i]) {
Q[i] = X[j];
}
}
}
return L;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
512 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
1 ms |
288 KB |
Output is correct |
7 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
512 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
1 ms |
288 KB |
Output is correct |
7 |
Correct |
1 ms |
384 KB |
Output is correct |
8 |
Correct |
1 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
1 ms |
384 KB |
Output is correct |
12 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
416 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
512 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
1 ms |
288 KB |
Output is correct |
7 |
Correct |
1 ms |
384 KB |
Output is correct |
8 |
Correct |
1 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
1 ms |
384 KB |
Output is correct |
12 |
Correct |
1 ms |
384 KB |
Output is correct |
13 |
Correct |
1 ms |
416 KB |
Output is correct |
14 |
Correct |
0 ms |
256 KB |
Output is correct |
15 |
Correct |
1 ms |
384 KB |
Output is correct |
16 |
Correct |
1 ms |
384 KB |
Output is correct |
17 |
Correct |
1 ms |
384 KB |
Output is correct |
18 |
Correct |
1 ms |
384 KB |
Output is correct |
19 |
Correct |
1 ms |
256 KB |
Output is correct |
20 |
Correct |
1 ms |
256 KB |
Output is correct |
21 |
Correct |
15 ms |
640 KB |
Output is correct |
22 |
Correct |
16 ms |
640 KB |
Output is correct |
23 |
Correct |
16 ms |
640 KB |
Output is correct |
24 |
Correct |
14 ms |
640 KB |
Output is correct |
25 |
Correct |
6 ms |
768 KB |
Output is correct |
26 |
Correct |
10 ms |
640 KB |
Output is correct |
27 |
Correct |
15 ms |
640 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
193 ms |
512 KB |
Output is correct |
2 |
Correct |
225 ms |
632 KB |
Output is correct |
3 |
Correct |
203 ms |
632 KB |
Output is correct |
4 |
Correct |
1 ms |
512 KB |
Output is correct |
5 |
Correct |
18 ms |
640 KB |
Output is correct |
6 |
Correct |
49 ms |
632 KB |
Output is correct |
7 |
Correct |
146 ms |
636 KB |
Output is correct |
8 |
Correct |
220 ms |
636 KB |
Output is correct |
9 |
Correct |
220 ms |
632 KB |
Output is correct |
10 |
Correct |
224 ms |
632 KB |
Output is correct |
11 |
Correct |
226 ms |
632 KB |
Output is correct |
12 |
Correct |
147 ms |
632 KB |
Output is correct |
13 |
Correct |
233 ms |
656 KB |
Output is correct |
14 |
Correct |
1 ms |
768 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
193 ms |
512 KB |
Output is correct |
2 |
Correct |
225 ms |
632 KB |
Output is correct |
3 |
Correct |
203 ms |
632 KB |
Output is correct |
4 |
Correct |
1 ms |
512 KB |
Output is correct |
5 |
Correct |
18 ms |
640 KB |
Output is correct |
6 |
Correct |
49 ms |
632 KB |
Output is correct |
7 |
Correct |
146 ms |
636 KB |
Output is correct |
8 |
Correct |
220 ms |
636 KB |
Output is correct |
9 |
Correct |
220 ms |
632 KB |
Output is correct |
10 |
Correct |
224 ms |
632 KB |
Output is correct |
11 |
Correct |
226 ms |
632 KB |
Output is correct |
12 |
Correct |
147 ms |
632 KB |
Output is correct |
13 |
Correct |
233 ms |
656 KB |
Output is correct |
14 |
Correct |
1 ms |
768 KB |
Output is correct |
15 |
Execution timed out |
1063 ms |
10136 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |