# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547921 | tht2005 | Ancient Machine (JOI21_ancient_machine) | C++17 | 59 ms | 8172 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 <vector>
void Anna(int N, std::vector<char> S) {
int i = 0;
while(i < N && S[i] != 'X')
++i;
if(i == N)
return;
for(int j = 0; j < i; ++j)
Send(0);
Send(1);
for(int j = i + 1; j < N; ++j)
Send((int)(S[j] == 'Z'));
}
#include "Bruno.h"
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
void Bruno(int N, int L, std::vector<int> A) {
if(L == 0) {
for(int i = 0; i < N; ++i)
Remove(i);
}
else {
int i = 0;
while(!A[i])
++i;
for(int j = 0; j < i; ++j)
Remove(j);
for(int j = i + 1; j < N; ++j) {
if(A[j]) {
for(int k = j - 1; !A[k]; --k)
Remove(k);
Remove(j);
}
}
for(int j = N - 1; !A[j]; --j)
Remove(j);
Remove(i);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |