# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
899383 |
2024-01-06T01:07:20 Z |
box |
Shopping (JOI21_shopping) |
C++17 |
|
61 ms |
920 KB |
#include "Anna.h"
#include <vector>
namespace {
int N, L, R, A[1000];
int count;
} // namespace
void InitA(int N, int L, int R) {
::N = N;
::L = L;
::R = R;
}
void ReceiveA(bool x) {
if (x) A[count / 10] |= 1 << (count % 10);
count++;
}
int Answer() {
int i = L;
for (int j = i + 1; j <= R; j++) if (A[j] < A[i]) i = j;
return i;
}
#include "Bruno.h"
#include <vector>
namespace {
int N;
} // namespace
void InitB(int N, std::vector<int> P) {
::N = N;
for (int i = 0; i < N; i++) for (int j = 0; j < 10; j++) SendB(P[i] >> j & 1);
}
void ReceiveB(bool y) {
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
664 KB |
Output is correct |
2 |
Correct |
0 ms |
664 KB |
Output is correct |
3 |
Correct |
0 ms |
920 KB |
Output is correct |
4 |
Correct |
0 ms |
664 KB |
Output is correct |
5 |
Correct |
1 ms |
664 KB |
Output is correct |
6 |
Correct |
42 ms |
664 KB |
Output is correct |
7 |
Correct |
53 ms |
664 KB |
Output is correct |
8 |
Correct |
36 ms |
664 KB |
Output is correct |
9 |
Correct |
50 ms |
664 KB |
Output is correct |
10 |
Correct |
49 ms |
664 KB |
Output is correct |
11 |
Correct |
44 ms |
664 KB |
Output is correct |
12 |
Correct |
49 ms |
664 KB |
Output is correct |
13 |
Correct |
37 ms |
664 KB |
Output is correct |
14 |
Correct |
61 ms |
664 KB |
Output is correct |
15 |
Correct |
40 ms |
916 KB |
Output is correct |
16 |
Correct |
46 ms |
904 KB |
Output is correct |
17 |
Correct |
39 ms |
664 KB |
Output is correct |
18 |
Correct |
39 ms |
664 KB |
Output is correct |
19 |
Correct |
43 ms |
672 KB |
Output is correct |
20 |
Correct |
40 ms |
664 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
664 KB |
Output is correct |
2 |
Correct |
0 ms |
664 KB |
Output is correct |
3 |
Correct |
0 ms |
920 KB |
Output is correct |
4 |
Correct |
0 ms |
664 KB |
Output is correct |
5 |
Correct |
1 ms |
664 KB |
Output is correct |
6 |
Correct |
42 ms |
664 KB |
Output is correct |
7 |
Correct |
53 ms |
664 KB |
Output is correct |
8 |
Correct |
36 ms |
664 KB |
Output is correct |
9 |
Correct |
50 ms |
664 KB |
Output is correct |
10 |
Correct |
49 ms |
664 KB |
Output is correct |
11 |
Correct |
44 ms |
664 KB |
Output is correct |
12 |
Correct |
49 ms |
664 KB |
Output is correct |
13 |
Correct |
37 ms |
664 KB |
Output is correct |
14 |
Correct |
61 ms |
664 KB |
Output is correct |
15 |
Correct |
40 ms |
916 KB |
Output is correct |
16 |
Correct |
46 ms |
904 KB |
Output is correct |
17 |
Correct |
39 ms |
664 KB |
Output is correct |
18 |
Correct |
39 ms |
664 KB |
Output is correct |
19 |
Correct |
43 ms |
672 KB |
Output is correct |
20 |
Correct |
40 ms |
664 KB |
Output is correct |
21 |
Runtime error |
0 ms |
332 KB |
Execution killed with signal 13 |
22 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
0 ms |
392 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |