#include "Anna.h"
#include <vector>
using namespace std;
void Anna(int n, vector<char> s) {
int k = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'X') Send(1);
else Send(0);
if (s[i] == 'Z') k = i;
}
for (int t = 0; t <= 16; t++) Send(k & 1 << t ? 1 : 0);
}
#include "Bruno.h"
#include <vector>
using namespace std;
bool b[100006];
void Bruno(int n, int l, vector<int> a) {
int lt = n, rt = 0;
for (int t = 0; t <= 16; t++) if (a[n + t]) rt |= 1 << t;
for (int i = n - 1; i >= 0; i--) if (a[i] || !i) {
for (int j = i + 1; j < lt; j++) if (a[j]) Remove(j);
for (int j = i + 1; j < lt; j++) if (!a[j] && j != rt) Remove(j);
if (i != rt) Remove(i);
lt = i;
}
Remove(rt);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
508 KB |
Output is correct |
2 |
Correct |
1 ms |
508 KB |
Output is correct |
3 |
Correct |
1 ms |
516 KB |
Output is correct |
4 |
Correct |
0 ms |
508 KB |
Output is correct |
5 |
Correct |
0 ms |
508 KB |
Output is correct |
6 |
Correct |
1 ms |
592 KB |
Output is correct |
7 |
Correct |
0 ms |
520 KB |
Output is correct |
8 |
Correct |
0 ms |
604 KB |
Output is correct |
9 |
Correct |
0 ms |
512 KB |
Output is correct |
10 |
Correct |
0 ms |
512 KB |
Output is correct |
11 |
Correct |
0 ms |
524 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
52 ms |
7656 KB |
Partially correct |
2 |
Partially correct |
49 ms |
8128 KB |
Partially correct |
3 |
Partially correct |
49 ms |
8100 KB |
Partially correct |
4 |
Partially correct |
50 ms |
8088 KB |
Partially correct |
5 |
Partially correct |
55 ms |
8080 KB |
Partially correct |
6 |
Partially correct |
51 ms |
8120 KB |
Partially correct |
7 |
Partially correct |
49 ms |
8080 KB |
Partially correct |
8 |
Partially correct |
54 ms |
8140 KB |
Partially correct |
9 |
Partially correct |
50 ms |
8012 KB |
Partially correct |
10 |
Partially correct |
51 ms |
7996 KB |
Partially correct |
11 |
Partially correct |
51 ms |
8096 KB |
Partially correct |
12 |
Partially correct |
55 ms |
8004 KB |
Partially correct |
13 |
Partially correct |
61 ms |
8124 KB |
Partially correct |
14 |
Partially correct |
61 ms |
8080 KB |
Partially correct |
15 |
Partially correct |
51 ms |
8024 KB |
Partially correct |
16 |
Partially correct |
56 ms |
8092 KB |
Partially correct |
17 |
Partially correct |
66 ms |
8136 KB |
Partially correct |
18 |
Partially correct |
55 ms |
8092 KB |
Partially correct |
19 |
Partially correct |
56 ms |
8116 KB |
Partially correct |
20 |
Partially correct |
57 ms |
8076 KB |
Partially correct |
21 |
Partially correct |
50 ms |
8044 KB |
Partially correct |
22 |
Partially correct |
56 ms |
8132 KB |
Partially correct |
23 |
Partially correct |
50 ms |
8080 KB |
Partially correct |
24 |
Partially correct |
49 ms |
8144 KB |
Partially correct |
25 |
Partially correct |
64 ms |
8024 KB |
Partially correct |
26 |
Partially correct |
62 ms |
8020 KB |
Partially correct |
27 |
Partially correct |
55 ms |
7996 KB |
Partially correct |
28 |
Partially correct |
62 ms |
8060 KB |
Partially correct |
29 |
Partially correct |
69 ms |
8096 KB |
Partially correct |
30 |
Partially correct |
57 ms |
8068 KB |
Partially correct |
31 |
Partially correct |
57 ms |
8192 KB |
Partially correct |
32 |
Partially correct |
52 ms |
8116 KB |
Partially correct |
33 |
Partially correct |
50 ms |
8064 KB |
Partially correct |