# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
743489 | 2023-05-17T12:21:54 Z | boris_mihov | Unscrambling a Messy Bug (IOI16_messy) | C++17 | 2 ms | 468 KB |
#include "messy.h" #include <algorithm> #include <iostream> #include <numeric> #include <cassert> #include <vector> #include <bitset> #include <random> typedef long long llong; const int MAXN = 256; const int MAXLOG = 8; const int INF = 1e9; std::vector <int> perm; std::vector <int> restore_permutation(int n, int w, int r) { perm.resize(n, 0); std::string element(n, '0'); for (int bit = 0 ; (1 << bit) < n ; ++bit) { for (int i = 0 ; i < n ; ++i) { if (i & (1 << bit)) { if (element[i] == '0') element[i] = '1'; else element[i] = '0'; add_element(element); if (element[i] == '0') element[i] = '1'; else element[i] = '0'; } } for (int i = 0 ; i < n && bit > 0 ; ++i) { if (i & (1 << bit - 1)) { element[i] = '0'; } } for (int i = 0 ; i < n ; ++i) { if (i & (1 << bit)) { element[i] = '1'; } } } compile_set(); std::vector <int> last; std::fill(element.begin(), element.end(), '0'); for (int bit = 0 ; (1 << bit) < n ; ++bit) { std::vector <int> curr; for (int i = 0 ; i < n ; ++i) { if (element[i] == '0') element[i] = '1'; else element[i] = '0'; if (check_element(element)) { perm[i] |= (1 << bit); curr.push_back(i); } if (element[i] == '0') element[i] = '1'; else element[i] = '0'; } for (const int &i : last) { element[i] = '0'; } for (const int &i : curr) { element[i] = '1'; } last = curr; } return perm; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 304 KB | n = 8 |
2 | Correct | 1 ms | 300 KB | n = 8 |
3 | Correct | 1 ms | 300 KB | n = 8 |
4 | Correct | 1 ms | 212 KB | n = 8 |
5 | Correct | 1 ms | 212 KB | n = 8 |
6 | Correct | 1 ms | 212 KB | n = 8 |
7 | Correct | 1 ms | 212 KB | n = 8 |
8 | Correct | 1 ms | 300 KB | n = 8 |
9 | Correct | 1 ms | 212 KB | n = 8 |
10 | Correct | 0 ms | 212 KB | n = 8 |
11 | Correct | 1 ms | 212 KB | n = 8 |
12 | Correct | 1 ms | 212 KB | n = 8 |
13 | Correct | 1 ms | 212 KB | n = 8 |
14 | Correct | 1 ms | 212 KB | n = 8 |
15 | Correct | 1 ms | 212 KB | n = 8 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | n = 32 |
2 | Correct | 0 ms | 212 KB | n = 32 |
3 | Correct | 1 ms | 212 KB | n = 32 |
4 | Correct | 1 ms | 212 KB | n = 32 |
5 | Correct | 1 ms | 212 KB | n = 32 |
6 | Correct | 1 ms | 212 KB | n = 32 |
7 | Correct | 1 ms | 212 KB | n = 32 |
8 | Correct | 1 ms | 212 KB | n = 32 |
9 | Correct | 1 ms | 296 KB | n = 32 |
10 | Correct | 1 ms | 212 KB | n = 32 |
11 | Correct | 1 ms | 212 KB | n = 32 |
12 | Correct | 1 ms | 212 KB | n = 32 |
13 | Correct | 1 ms | 300 KB | n = 32 |
14 | Correct | 1 ms | 212 KB | n = 32 |
15 | Correct | 1 ms | 212 KB | n = 32 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 296 KB | n = 32 |
2 | Correct | 1 ms | 212 KB | n = 32 |
3 | Correct | 1 ms | 212 KB | n = 32 |
4 | Correct | 1 ms | 300 KB | n = 32 |
5 | Correct | 1 ms | 212 KB | n = 32 |
6 | Correct | 1 ms | 296 KB | n = 32 |
7 | Correct | 1 ms | 212 KB | n = 32 |
8 | Correct | 1 ms | 212 KB | n = 32 |
9 | Correct | 1 ms | 212 KB | n = 32 |
10 | Correct | 1 ms | 212 KB | n = 32 |
11 | Correct | 1 ms | 212 KB | n = 32 |
12 | Correct | 1 ms | 300 KB | n = 32 |
13 | Correct | 1 ms | 212 KB | n = 32 |
14 | Correct | 1 ms | 212 KB | n = 32 |
15 | Correct | 1 ms | 212 KB | n = 32 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 432 KB | n = 128 |
2 | Correct | 2 ms | 468 KB | n = 128 |
3 | Correct | 2 ms | 468 KB | n = 128 |
4 | Correct | 2 ms | 428 KB | n = 128 |
5 | Correct | 2 ms | 468 KB | n = 128 |
6 | Correct | 2 ms | 468 KB | n = 128 |
7 | Correct | 2 ms | 468 KB | n = 128 |
8 | Correct | 2 ms | 468 KB | n = 128 |
9 | Correct | 2 ms | 428 KB | n = 128 |
10 | Correct | 2 ms | 424 KB | n = 128 |
11 | Correct | 2 ms | 468 KB | n = 128 |
12 | Correct | 2 ms | 468 KB | n = 128 |
13 | Correct | 2 ms | 468 KB | n = 128 |
14 | Correct | 2 ms | 468 KB | n = 128 |
15 | Correct | 2 ms | 424 KB | n = 128 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 468 KB | n = 128 |
2 | Correct | 2 ms | 468 KB | n = 128 |
3 | Correct | 1 ms | 428 KB | n = 128 |
4 | Correct | 2 ms | 468 KB | n = 128 |
5 | Correct | 1 ms | 428 KB | n = 128 |
6 | Correct | 1 ms | 468 KB | n = 128 |
7 | Correct | 1 ms | 468 KB | n = 128 |
8 | Correct | 2 ms | 468 KB | n = 128 |
9 | Correct | 1 ms | 468 KB | n = 128 |
10 | Correct | 1 ms | 428 KB | n = 128 |
11 | Correct | 2 ms | 468 KB | n = 128 |
12 | Correct | 2 ms | 468 KB | n = 128 |
13 | Correct | 2 ms | 468 KB | n = 128 |
14 | Correct | 2 ms | 468 KB | n = 128 |
15 | Correct | 1 ms | 468 KB | n = 128 |