# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
581274 | 2022-06-22T12:42:48 Z | alontanay | The Collection Game (BOI21_swaps) | C++14 | 57 ms | 280 KB |
// // --- Sample implementation for the task swaps --- // // To compile this program with the sample grader, place: // swaps.h swaps_sample.cpp sample_grader.cpp // in a single folder and run: // g++ swaps_sample.cpp sample_grader.cpp // in this folder. // #include "swaps.h" #include <bits/stdc++.h> #define f first #define s second using namespace std; using pi = pair<int,int>; vector<pi> ss; vector<int> lc; void _schedule(int i, int j) { ss.push_back({i,j}); schedule(lc[i],lc[j]); } void _visit() { vector<int> res = visit(); for(int i = 0; i < res.size(); i ++) { if(!res[i]) { swap(lc[ss[i].f],lc[ss[i].s]); } } ss.clear(); } void solve(int N, int V) { lc.resize(N+1); for(int i = 1; i <= N; i ++) { lc[i] = i; } for(int i = 1; i <= N; i ++) { for(int j = i + 1; j <= N; j ++) { _schedule(i,j); _visit(); } } vector<int> res(N); for(int i = 0; i < N; i ++) { res[i] = i+1; } answer(res); } /* g++ swaps_.cpp grader.cpp -o g.exe && g.exe 5 1000 2 1 5 3 4 1 1 */ /* 4 1 5 3 4 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 260 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Correct |
2 | Correct | 39 ms | 208 KB | Correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Correct |
2 | Correct | 39 ms | 208 KB | Correct |
3 | Incorrect | 1 ms | 208 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Correct |
2 | Correct | 44 ms | 208 KB | Correct |
3 | Runtime error | 53 ms | 280 KB | Execution killed with signal 13 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Correct |
2 | Correct | 44 ms | 208 KB | Correct |
3 | Runtime error | 53 ms | 280 KB | Execution killed with signal 13 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Correct |
2 | Correct | 56 ms | 208 KB | Correct |
3 | Runtime error | 40 ms | 280 KB | Execution killed with signal 13 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Correct |
2 | Correct | 56 ms | 208 KB | Correct |
3 | Runtime error | 40 ms | 280 KB | Execution killed with signal 13 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 208 KB | Correct |
2 | Correct | 41 ms | 208 KB | Correct |
3 | Runtime error | 49 ms | 276 KB | Execution killed with signal 13 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 208 KB | Correct |
2 | Correct | 41 ms | 208 KB | Correct |
3 | Runtime error | 49 ms | 276 KB | Execution killed with signal 13 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Correct |
2 | Correct | 57 ms | 208 KB | Correct |
3 | Runtime error | 47 ms | 208 KB | Execution killed with signal 13 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Correct |
2 | Correct | 57 ms | 208 KB | Correct |
3 | Runtime error | 47 ms | 208 KB | Execution killed with signal 13 |
4 | Halted | 0 ms | 0 KB | - |