# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964536 | 2024-04-17T05:21:48 Z | UmairAhmadMirza | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 1 ms | 600 KB |
#pragma once #include <bits/stdc++.h> using namespace std; void add_element(string x); bool check_element(string x); void compile_set(); vector<int> restore_permutation(int n, int w, int r){ string s=""; for (int i = 0; i < n; ++i) s+='0'; for (int i = 0; i < n; ++i){ s[i]='1'; add_element(s); } compile_set(); vector<int> per(n); for (int i = 0; i < n; ++i){ s[i]='0'; per[i]=-1; } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if(per[j]==-1) s[j]='0'; else s[j]='1'; } for (int j = 0; j < n; ++j) { if(s[j]=='1') continue; s[j]='1'; if(check_element(s)){ per[j]=i; break; } s[j]='0'; } } return per; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | n = 8 |
2 | Correct | 0 ms | 344 KB | n = 8 |
3 | Correct | 1 ms | 344 KB | n = 8 |
4 | Correct | 0 ms | 348 KB | n = 8 |
5 | Correct | 0 ms | 348 KB | n = 8 |
6 | Correct | 0 ms | 348 KB | n = 8 |
7 | Correct | 1 ms | 344 KB | n = 8 |
8 | Correct | 1 ms | 348 KB | n = 8 |
9 | Correct | 0 ms | 348 KB | n = 8 |
10 | Correct | 0 ms | 348 KB | n = 8 |
11 | Correct | 1 ms | 348 KB | n = 8 |
12 | Correct | 1 ms | 348 KB | n = 8 |
13 | Correct | 1 ms | 348 KB | n = 8 |
14 | Correct | 1 ms | 348 KB | n = 8 |
15 | Correct | 1 ms | 348 KB | n = 8 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | n = 32 |
2 | Correct | 1 ms | 348 KB | n = 32 |
3 | Correct | 0 ms | 348 KB | n = 32 |
4 | Correct | 1 ms | 348 KB | n = 32 |
5 | Correct | 0 ms | 436 KB | n = 32 |
6 | Correct | 0 ms | 344 KB | n = 32 |
7 | Correct | 1 ms | 600 KB | n = 32 |
8 | Correct | 0 ms | 348 KB | n = 32 |
9 | Correct | 0 ms | 344 KB | n = 32 |
10 | Correct | 1 ms | 348 KB | n = 32 |
11 | Correct | 1 ms | 348 KB | n = 32 |
12 | Correct | 1 ms | 348 KB | n = 32 |
13 | Correct | 1 ms | 348 KB | n = 32 |
14 | Correct | 1 ms | 432 KB | n = 32 |
15 | Correct | 1 ms | 348 KB | n = 32 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | n = 32 |
2 | Correct | 1 ms | 348 KB | n = 32 |
3 | Incorrect | 1 ms | 348 KB | grader returned WA |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | grader returned WA |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | grader returned WA |
2 | Halted | 0 ms | 0 KB | - |