# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873407 | 2023-11-15T03:00:54 Z | Faisal_Saqib | The Collection Game (BOI21_swaps) | C++17 | 20 ms | 692 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 <iostream> #include <vector> using namespace std; vector<int> DNC(int l,int r) { if(l==r) return {l}; int mid=(l+r)/2; vector<int> final,fh=DNC(l,mid),sh=DNC(mid+1,r); int i=0,j=0; while(i<fh.size() and j<sh.size()) { schedule(fh[i],sh[j]); int p=visit()[0]; if(p) final.push_back(fh[i++]); else final.push_back(sh[j++]); } while(i<fh.size()) final.push_back(fh[i++]); while(j<sh.size()) final.push_back(sh[j++]); return final; } void solve(int n, int v) { answer(DNC(1,n)); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Correct |
2 | Correct | 2 ms | 436 KB | Correct |
3 | Correct | 8 ms | 432 KB | Correct |
4 | Correct | 16 ms | 436 KB | Correct |
5 | Correct | 9 ms | 436 KB | Correct |
6 | Correct | 10 ms | 440 KB | Correct |
7 | Correct | 20 ms | 600 KB | Correct |
8 | Correct | 17 ms | 436 KB | Correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Correct |
2 | Correct | 2 ms | 432 KB | Correct |
3 | Correct | 8 ms | 432 KB | Correct |
4 | Correct | 18 ms | 432 KB | Correct |
5 | Correct | 8 ms | 440 KB | Correct |
6 | Correct | 8 ms | 444 KB | Correct |
7 | Correct | 17 ms | 436 KB | Correct |
8 | Correct | 19 ms | 444 KB | Correct |
9 | Runtime error | 4 ms | 692 KB | Execution killed with signal 11 |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 340 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |