#include "swaps.h"
#include "bits/stdc++.h"
using namespace std;
void solve(int N, int V) {
// TODO implement this function
for(int i=1; i<=9; i++) {
for(int j=(1 << ((int) log2(N))); j>=1; j>>=1) {
for(int k=1; k<=N; k+=(j<<1)) {
for(int l=k; l<k+j; l++) {
if((k<<1) + (j<<1) - 1 - l <= N) schedule(l, k + k+(j<<1)-1 - l);
}
}
vector<int> uni = visit();
}
/*
for(int j=2; j+1<=N; j+=2) {
schedule(j, j+1);
}
vector<int> uni = visit();
*/
}
vector<int> identity;
for(int i=1; i<=N; i++) identity.push_back(i);
answer(identity);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
208 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Correct |
2 |
Correct |
2 ms |
208 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Correct |
2 |
Correct |
2 ms |
208 KB |
Correct |
3 |
Incorrect |
1 ms |
208 KB |
Not correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Correct |
2 |
Correct |
2 ms |
208 KB |
Correct |
3 |
Correct |
5 ms |
300 KB |
Correct |
4 |
Correct |
10 ms |
296 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Correct |
2 |
Correct |
2 ms |
208 KB |
Correct |
3 |
Correct |
5 ms |
300 KB |
Correct |
4 |
Correct |
10 ms |
296 KB |
Correct |
5 |
Incorrect |
1 ms |
208 KB |
Not correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Correct |
2 |
Correct |
2 ms |
208 KB |
Correct |
3 |
Correct |
3 ms |
208 KB |
Correct |
4 |
Correct |
8 ms |
300 KB |
Correct |
5 |
Correct |
7 ms |
296 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Correct |
2 |
Correct |
2 ms |
208 KB |
Correct |
3 |
Correct |
3 ms |
208 KB |
Correct |
4 |
Correct |
8 ms |
300 KB |
Correct |
5 |
Correct |
7 ms |
296 KB |
Correct |
6 |
Incorrect |
1 ms |
208 KB |
Not correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
272 KB |
Correct |
2 |
Correct |
2 ms |
208 KB |
Correct |
3 |
Correct |
5 ms |
300 KB |
Correct |
4 |
Correct |
7 ms |
300 KB |
Correct |
5 |
Correct |
10 ms |
280 KB |
Correct |
6 |
Correct |
10 ms |
280 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
272 KB |
Correct |
2 |
Correct |
2 ms |
208 KB |
Correct |
3 |
Correct |
5 ms |
300 KB |
Correct |
4 |
Correct |
7 ms |
300 KB |
Correct |
5 |
Correct |
10 ms |
280 KB |
Correct |
6 |
Correct |
10 ms |
280 KB |
Correct |
7 |
Incorrect |
1 ms |
208 KB |
Not correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Correct |
2 |
Correct |
3 ms |
208 KB |
Correct |
3 |
Correct |
5 ms |
208 KB |
Correct |
4 |
Correct |
10 ms |
296 KB |
Correct |
5 |
Correct |
7 ms |
284 KB |
Correct |
6 |
Correct |
7 ms |
280 KB |
Correct |
7 |
Runtime error |
6 ms |
288 KB |
Execution killed with signal 13 |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Correct |
2 |
Correct |
3 ms |
208 KB |
Correct |
3 |
Correct |
5 ms |
208 KB |
Correct |
4 |
Correct |
10 ms |
296 KB |
Correct |
5 |
Correct |
7 ms |
284 KB |
Correct |
6 |
Correct |
7 ms |
280 KB |
Correct |
7 |
Runtime error |
6 ms |
288 KB |
Execution killed with signal 13 |
8 |
Halted |
0 ms |
0 KB |
- |