#include <bits/stdc++.h>
#include "swaps.h"
using namespace std;
//#define int long long
#define double long double
#define FOR(i, l, r, d) for(int i=(l); i<=(r); i+=(d))
#define szof(x) ((int)(x).size())
#define vi vector<int>
#define pii pair<int, int>
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define mkp make_pair
const int INF = 2147483647;
//const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
void solve(int N, int V){
FOR(i, 1, V, 1){
int s;
if(i % 2 == 1) s = 1;
else s = 2;
FOR(j, s, N-1, 2){
schedule(j, j+1);
}
visit();
}
vi res;
FOR(i, 1, N, 1){
res.pb(i);
}
answer(res);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
73 ms |
200 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
64 ms |
200 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
51 ms |
200 KB |
Correct |
2 |
Correct |
172 ms |
200 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
51 ms |
200 KB |
Correct |
2 |
Correct |
172 ms |
200 KB |
Correct |
3 |
Incorrect |
54 ms |
200 KB |
Not correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
65 ms |
200 KB |
Correct |
2 |
Correct |
130 ms |
200 KB |
Correct |
3 |
Correct |
262 ms |
284 KB |
Correct |
4 |
Correct |
547 ms |
584 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
65 ms |
200 KB |
Correct |
2 |
Correct |
130 ms |
200 KB |
Correct |
3 |
Correct |
262 ms |
284 KB |
Correct |
4 |
Correct |
547 ms |
584 KB |
Correct |
5 |
Incorrect |
64 ms |
200 KB |
Not correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
63 ms |
200 KB |
Correct |
2 |
Correct |
122 ms |
200 KB |
Correct |
3 |
Correct |
251 ms |
272 KB |
Correct |
4 |
Correct |
506 ms |
376 KB |
Correct |
5 |
Correct |
54 ms |
292 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
63 ms |
200 KB |
Correct |
2 |
Correct |
122 ms |
200 KB |
Correct |
3 |
Correct |
251 ms |
272 KB |
Correct |
4 |
Correct |
506 ms |
376 KB |
Correct |
5 |
Correct |
54 ms |
292 KB |
Correct |
6 |
Incorrect |
61 ms |
200 KB |
Not correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
61 ms |
200 KB |
Correct |
2 |
Correct |
129 ms |
200 KB |
Correct |
3 |
Correct |
242 ms |
320 KB |
Correct |
4 |
Correct |
582 ms |
412 KB |
Correct |
5 |
Correct |
46 ms |
272 KB |
Correct |
6 |
Incorrect |
10 ms |
268 KB |
Not correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
61 ms |
200 KB |
Correct |
2 |
Correct |
129 ms |
200 KB |
Correct |
3 |
Correct |
242 ms |
320 KB |
Correct |
4 |
Correct |
582 ms |
412 KB |
Correct |
5 |
Correct |
46 ms |
272 KB |
Correct |
6 |
Incorrect |
10 ms |
268 KB |
Not correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
58 ms |
200 KB |
Correct |
2 |
Correct |
138 ms |
200 KB |
Correct |
3 |
Correct |
258 ms |
272 KB |
Correct |
4 |
Correct |
500 ms |
388 KB |
Correct |
5 |
Correct |
47 ms |
292 KB |
Correct |
6 |
Incorrect |
10 ms |
272 KB |
Not correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
58 ms |
200 KB |
Correct |
2 |
Correct |
138 ms |
200 KB |
Correct |
3 |
Correct |
258 ms |
272 KB |
Correct |
4 |
Correct |
500 ms |
388 KB |
Correct |
5 |
Correct |
47 ms |
292 KB |
Correct |
6 |
Incorrect |
10 ms |
272 KB |
Not correct |
7 |
Halted |
0 ms |
0 KB |
- |