# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775177 | 2023-07-06T08:32:20 Z | anha3k25cvp | Martian DNA (IOI16_dna) | C++14 | 64 ms | 512 KB |
#include <bits/stdc++.h> #include "dna.h" using namespace std; string analyse(int n, int t) { int type = 0; string ans; while (n) { type ^= 1; string S = ans; S += '0' + type; int add_right = make_test(S); if (add_right) { int lo = 1, hi = n; while (lo < hi) { int mid = (lo + hi + 1) / 2; S = ans; for (int i = 1; i <= mid; i ++) S += '0' + type; int val = make_test(S); if (val) lo = mid; else hi = mid - 1; } n -= lo; for (int i = 1; i <= lo; i ++) ans += '0' + type; continue; } int lo = 0, hi = n; while (lo < hi) { int mid = (lo + hi + 1) / 2; S = ""; for (int i = 1; i <= mid; i ++) S += '0' + type; S += ans; int val = make_test(S); if (val) lo = mid; else hi = mid - 1; } n -= lo; for (int i = 1; i <= lo; i ++) ans = char('0' + type) + ans; } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 0 ms | 212 KB | Output is correct |
14 | Correct | 0 ms | 212 KB | Output is correct |
15 | Correct | 0 ms | 212 KB | Output is correct |
16 | Correct | 0 ms | 212 KB | Output is correct |
17 | Correct | 0 ms | 212 KB | Output is correct |
18 | Correct | 0 ms | 212 KB | Output is correct |
19 | Correct | 0 ms | 212 KB | Output is correct |
20 | Correct | 0 ms | 212 KB | Output is correct |
21 | Correct | 0 ms | 212 KB | Output is correct |
22 | Correct | 1 ms | 212 KB | Output is correct |
23 | Correct | 0 ms | 212 KB | Output is correct |
24 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 0 ms | 212 KB | Output is correct |
14 | Correct | 0 ms | 212 KB | Output is correct |
15 | Correct | 0 ms | 212 KB | Output is correct |
16 | Correct | 0 ms | 256 KB | Output is correct |
17 | Incorrect | 1 ms | 212 KB | Too many tests |
18 | Incorrect | 1 ms | 212 KB | Too many tests |
19 | Incorrect | 1 ms | 212 KB | Too many tests |
20 | Incorrect | 1 ms | 212 KB | Too many tests |
21 | Incorrect | 1 ms | 212 KB | Too many tests |
22 | Incorrect | 1 ms | 212 KB | Too many tests |
23 | Incorrect | 1 ms | 212 KB | Too many tests |
24 | Correct | 1 ms | 340 KB | Output is correct |
25 | Correct | 1 ms | 212 KB | Output is correct |
26 | Correct | 1 ms | 212 KB | Output is correct |
27 | Correct | 0 ms | 212 KB | Output is correct |
28 | Incorrect | 1 ms | 212 KB | Too many tests |
29 | Incorrect | 1 ms | 212 KB | Too many tests |
30 | Incorrect | 1 ms | 212 KB | Too many tests |
31 | Incorrect | 1 ms | 212 KB | Too many tests |
32 | Incorrect | 1 ms | 212 KB | Too many tests |
33 | Correct | 0 ms | 212 KB | Output is correct |
34 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 0 ms | 212 KB | Output is correct |
14 | Correct | 0 ms | 212 KB | Output is correct |
15 | Correct | 0 ms | 212 KB | Output is correct |
16 | Correct | 0 ms | 212 KB | Output is correct |
17 | Correct | 1 ms | 212 KB | Output is correct |
18 | Correct | 1 ms | 212 KB | Output is correct |
19 | Correct | 1 ms | 212 KB | Output is correct |
20 | Correct | 1 ms | 212 KB | Output is correct |
21 | Correct | 1 ms | 212 KB | Output is correct |
22 | Incorrect | 33 ms | 380 KB | Too many tests |
23 | Incorrect | 36 ms | 388 KB | Too many tests |
24 | Incorrect | 37 ms | 512 KB | Too many tests |
25 | Incorrect | 37 ms | 384 KB | Too many tests |
26 | Incorrect | 34 ms | 372 KB | Too many tests |
27 | Incorrect | 50 ms | 356 KB | Too many tests |
28 | Incorrect | 49 ms | 376 KB | Too many tests |
29 | Correct | 0 ms | 212 KB | Output is correct |
30 | Correct | 0 ms | 212 KB | Output is correct |
31 | Correct | 0 ms | 212 KB | Output is correct |
32 | Correct | 1 ms | 212 KB | Output is correct |
33 | Incorrect | 63 ms | 368 KB | Too many tests |
34 | Incorrect | 59 ms | 372 KB | Too many tests |
35 | Incorrect | 64 ms | 368 KB | Too many tests |
36 | Incorrect | 63 ms | 340 KB | Too many tests |
37 | Incorrect | 59 ms | 364 KB | Too many tests |
38 | Correct | 1 ms | 340 KB | Output is correct |
39 | Correct | 1 ms | 212 KB | Output is correct |