# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
808895 | MohamedAliSaidane | Ancient Machine (JOI21_ancient_machine) | C++17 | 34 ms | 7956 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, std::vector<char> S)
{
map<char,char> nxt;
nxt['X'] = 'Y';
nxt['Y'] = 'Z';
nxt['Z'] = 'Z';
char cur = 'X';
for(int i = 0; i < N; i ++)
{
if(S[i] == cur)
{
Send(1);
cur = nxt[cur];
}
else
Send(0);
}
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
void Bruno(int N, int L, std::vector<int> A)
{
vector<int> zs;
int cnt = 0;
for(int i = 0; i < L; i++)
{
if(cnt < 2 && A[i] == 0)
{
Remove(i);
}
else if(A[i] == 1)
{
cnt++;
if(cnt >= 3)
zs.pb(i);
}
}
for(auto z: zs)
{
for(int i = z - 1; i >= 0 && (A[i] == 0); i--)
{
Remove(i);
}
Remove(z);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |