# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
417207 | jamezzz | Ancient Machine (JOI21_ancient_machine) | C++17 | 77 ms | 7944 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |