#include "Anna.h"
#include "bits/stdc++.h"
using namespace std;
int n, l, r, ans;
void InitA(int N, int L, int R) {
n = N;
l = L;
r = R;
for (int i = 0; i < 18; ++i) SendA((l >> i) & 1);
}
void ReceiveA(bool x) {
if (l <= r && x) ans = l;
++l;
}
int Answer() {
return ans;
}
#include "Bruno.h"
#include "bits/stdc++.h"
using namespace std;
int n, l, cnt, ans = 2e9;
vector<int> p;
void InitB(int N, vector<int> P) {
n = N;
p = P;
}
void ReceiveB(bool y) {
if (y) l |= 1 << cnt;
++cnt;
if (cnt < 18) return;
for (int i = l; i < n; ++i) {
if (ans <= p[i]) {
SendB(0);
continue;
}
ans = p[i];
SendB(1);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
400 KB |
Output is correct |
2 |
Correct |
2 ms |
400 KB |
Output is correct |
3 |
Correct |
1 ms |
400 KB |
Output is correct |
4 |
Correct |
1 ms |
400 KB |
Output is correct |
5 |
Correct |
1 ms |
420 KB |
Output is correct |
6 |
Correct |
9 ms |
400 KB |
Output is correct |
7 |
Correct |
9 ms |
400 KB |
Output is correct |
8 |
Correct |
5 ms |
400 KB |
Output is correct |
9 |
Correct |
2 ms |
400 KB |
Output is correct |
10 |
Correct |
6 ms |
400 KB |
Output is correct |
11 |
Correct |
9 ms |
400 KB |
Output is correct |
12 |
Correct |
4 ms |
400 KB |
Output is correct |
13 |
Correct |
3 ms |
400 KB |
Output is correct |
14 |
Correct |
4 ms |
400 KB |
Output is correct |
15 |
Correct |
3 ms |
484 KB |
Output is correct |
16 |
Correct |
8 ms |
400 KB |
Output is correct |
17 |
Correct |
9 ms |
400 KB |
Output is correct |
18 |
Correct |
5 ms |
400 KB |
Output is correct |
19 |
Correct |
3 ms |
400 KB |
Output is correct |
20 |
Correct |
7 ms |
400 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
400 KB |
Output is correct |
2 |
Correct |
2 ms |
400 KB |
Output is correct |
3 |
Correct |
1 ms |
400 KB |
Output is correct |
4 |
Correct |
1 ms |
400 KB |
Output is correct |
5 |
Correct |
1 ms |
420 KB |
Output is correct |
6 |
Correct |
9 ms |
400 KB |
Output is correct |
7 |
Correct |
9 ms |
400 KB |
Output is correct |
8 |
Correct |
5 ms |
400 KB |
Output is correct |
9 |
Correct |
2 ms |
400 KB |
Output is correct |
10 |
Correct |
6 ms |
400 KB |
Output is correct |
11 |
Correct |
9 ms |
400 KB |
Output is correct |
12 |
Correct |
4 ms |
400 KB |
Output is correct |
13 |
Correct |
3 ms |
400 KB |
Output is correct |
14 |
Correct |
4 ms |
400 KB |
Output is correct |
15 |
Correct |
3 ms |
484 KB |
Output is correct |
16 |
Correct |
8 ms |
400 KB |
Output is correct |
17 |
Correct |
9 ms |
400 KB |
Output is correct |
18 |
Correct |
5 ms |
400 KB |
Output is correct |
19 |
Correct |
3 ms |
400 KB |
Output is correct |
20 |
Correct |
7 ms |
400 KB |
Output is correct |
21 |
Correct |
52 ms |
592 KB |
Output is correct |
22 |
Correct |
48 ms |
584 KB |
Output is correct |
23 |
Correct |
34 ms |
592 KB |
Output is correct |
24 |
Correct |
37 ms |
528 KB |
Output is correct |
25 |
Correct |
39 ms |
600 KB |
Output is correct |
26 |
Correct |
73 ms |
588 KB |
Output is correct |
27 |
Correct |
20 ms |
528 KB |
Output is correct |
28 |
Correct |
75 ms |
528 KB |
Output is correct |
29 |
Correct |
78 ms |
528 KB |
Output is correct |
30 |
Correct |
39 ms |
596 KB |
Output is correct |
31 |
Correct |
26 ms |
596 KB |
Output is correct |
32 |
Correct |
42 ms |
596 KB |
Output is correct |
33 |
Correct |
25 ms |
588 KB |
Output is correct |
34 |
Correct |
53 ms |
592 KB |
Output is correct |
35 |
Correct |
6 ms |
524 KB |
Output is correct |
36 |
Correct |
11 ms |
588 KB |
Output is correct |
37 |
Correct |
67 ms |
528 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
272 KB |
Wrong Answer [4] |
2 |
Halted |
0 ms |
0 KB |
- |