#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
void Anna(int N,vector<char> S){
bool fi=false;
for(int i=0;i<N;++i){
if(fi){
if(S[i]=='X'||S[i]=='Y')Send(0);
else Send(1);
}
else{
if(S[i]=='X')fi=true,Send(1);
else Send(0);
}
}
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
#define pf printf
#define pb push_back
namespace{
stack<int> st;
}
void Bruno(int N,int L,vector<int> A) {
bool fi=false;
for(int i=0;i<N;++i){
if(fi){
if(A[i]==0)st.push(i);
else{
while(st.size()>1)Remove(st.top()),st.pop();
Remove(i);
}
}
else{
if(A[i]==0)Remove(i);
else{
fi=true;
st.push(i);
}
}
}
while(!st.empty())Remove(st.top()),st.pop();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
484 KB |
Output is correct |
2 |
Correct |
1 ms |
480 KB |
Output is correct |
3 |
Correct |
0 ms |
484 KB |
Output is correct |
4 |
Correct |
0 ms |
492 KB |
Output is correct |
5 |
Correct |
0 ms |
492 KB |
Output is correct |
6 |
Correct |
0 ms |
484 KB |
Output is correct |
7 |
Correct |
0 ms |
484 KB |
Output is correct |
8 |
Correct |
0 ms |
484 KB |
Output is correct |
9 |
Correct |
0 ms |
492 KB |
Output is correct |
10 |
Correct |
0 ms |
484 KB |
Output is correct |
11 |
Correct |
0 ms |
484 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
70 ms |
7600 KB |
Partially correct |
2 |
Partially correct |
66 ms |
7624 KB |
Partially correct |
3 |
Partially correct |
68 ms |
7704 KB |
Partially correct |
4 |
Partially correct |
65 ms |
7672 KB |
Partially correct |
5 |
Partially correct |
65 ms |
7600 KB |
Partially correct |
6 |
Partially correct |
67 ms |
7812 KB |
Partially correct |
7 |
Partially correct |
63 ms |
7784 KB |
Partially correct |
8 |
Partially correct |
62 ms |
7628 KB |
Partially correct |
9 |
Partially correct |
64 ms |
7628 KB |
Partially correct |
10 |
Partially correct |
64 ms |
7664 KB |
Partially correct |
11 |
Partially correct |
63 ms |
7600 KB |
Partially correct |
12 |
Partially correct |
65 ms |
7660 KB |
Partially correct |
13 |
Partially correct |
60 ms |
7760 KB |
Partially correct |
14 |
Partially correct |
73 ms |
7680 KB |
Partially correct |
15 |
Partially correct |
73 ms |
7604 KB |
Partially correct |
16 |
Partially correct |
74 ms |
7608 KB |
Partially correct |
17 |
Partially correct |
59 ms |
7660 KB |
Partially correct |
18 |
Partially correct |
69 ms |
7624 KB |
Partially correct |
19 |
Partially correct |
70 ms |
7944 KB |
Partially correct |
20 |
Partially correct |
61 ms |
7624 KB |
Partially correct |
21 |
Partially correct |
64 ms |
7680 KB |
Partially correct |
22 |
Partially correct |
61 ms |
7588 KB |
Partially correct |
23 |
Partially correct |
63 ms |
7708 KB |
Partially correct |
24 |
Partially correct |
62 ms |
7640 KB |
Partially correct |
25 |
Partially correct |
69 ms |
7640 KB |
Partially correct |
26 |
Partially correct |
60 ms |
7704 KB |
Partially correct |
27 |
Partially correct |
68 ms |
7600 KB |
Partially correct |
28 |
Partially correct |
59 ms |
7624 KB |
Partially correct |
29 |
Partially correct |
77 ms |
7660 KB |
Partially correct |
30 |
Partially correct |
68 ms |
7660 KB |
Partially correct |
31 |
Partially correct |
72 ms |
7684 KB |
Partially correct |
32 |
Partially correct |
67 ms |
7648 KB |
Partially correct |
33 |
Partially correct |
63 ms |
7628 KB |
Partially correct |