#include "Anna.h"
#include <algorithm>
#include <vector>
using namespace std;
void Anna(int N, vector<char> S) {
int ptr = 0;
while (ptr != N && S[ptr] != 'X') Send(1), ++ptr;
for (int i = ptr; i < N; ++i) Send(S[i] == 'Z');
}
#include "Bruno.h"
#include <algorithm>
#include <vector>
using namespace std;
void Bruno(int N, int L, vector<int> A) {
vector<int> st;
for (int i = 0; i < L; ++i) {
if (A[i]) {
while (st.size() > 1) Remove(st.back()), st.pop_back();
Remove(i);
} else st.push_back(i);
}
while (!st.empty()) Remove(st.back()), st.pop_back();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
492 KB |
Output is correct |
2 |
Correct |
0 ms |
560 KB |
Output is correct |
3 |
Correct |
0 ms |
496 KB |
Output is correct |
4 |
Correct |
0 ms |
496 KB |
Output is correct |
5 |
Correct |
0 ms |
492 KB |
Output is correct |
6 |
Correct |
0 ms |
488 KB |
Output is correct |
7 |
Correct |
0 ms |
556 KB |
Output is correct |
8 |
Correct |
0 ms |
488 KB |
Output is correct |
9 |
Correct |
1 ms |
488 KB |
Output is correct |
10 |
Correct |
0 ms |
488 KB |
Output is correct |
11 |
Correct |
0 ms |
488 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
63 ms |
8004 KB |
Partially correct |
2 |
Partially correct |
64 ms |
8108 KB |
Partially correct |
3 |
Partially correct |
63 ms |
8068 KB |
Partially correct |
4 |
Partially correct |
63 ms |
8012 KB |
Partially correct |
5 |
Partially correct |
64 ms |
8016 KB |
Partially correct |
6 |
Partially correct |
65 ms |
8116 KB |
Partially correct |
7 |
Partially correct |
64 ms |
8108 KB |
Partially correct |
8 |
Partially correct |
75 ms |
8144 KB |
Partially correct |
9 |
Partially correct |
63 ms |
8092 KB |
Partially correct |
10 |
Partially correct |
65 ms |
8112 KB |
Partially correct |
11 |
Partially correct |
63 ms |
8004 KB |
Partially correct |
12 |
Partially correct |
63 ms |
8028 KB |
Partially correct |
13 |
Partially correct |
71 ms |
8228 KB |
Partially correct |
14 |
Partially correct |
72 ms |
8108 KB |
Partially correct |
15 |
Partially correct |
72 ms |
8044 KB |
Partially correct |
16 |
Partially correct |
70 ms |
8000 KB |
Partially correct |
17 |
Partially correct |
72 ms |
8160 KB |
Partially correct |
18 |
Partially correct |
70 ms |
8076 KB |
Partially correct |
19 |
Partially correct |
70 ms |
8020 KB |
Partially correct |
20 |
Partially correct |
63 ms |
8076 KB |
Partially correct |
21 |
Partially correct |
63 ms |
8076 KB |
Partially correct |
22 |
Partially correct |
71 ms |
8232 KB |
Partially correct |
23 |
Partially correct |
69 ms |
8000 KB |
Partially correct |
24 |
Partially correct |
68 ms |
8028 KB |
Partially correct |
25 |
Partially correct |
71 ms |
8084 KB |
Partially correct |
26 |
Partially correct |
71 ms |
8116 KB |
Partially correct |
27 |
Partially correct |
71 ms |
8048 KB |
Partially correct |
28 |
Partially correct |
70 ms |
8212 KB |
Partially correct |
29 |
Partially correct |
71 ms |
8024 KB |
Partially correct |
30 |
Partially correct |
76 ms |
8064 KB |
Partially correct |
31 |
Partially correct |
71 ms |
8248 KB |
Partially correct |
32 |
Partially correct |
64 ms |
8120 KB |
Partially correct |
33 |
Partially correct |
66 ms |
8076 KB |
Partially correct |