# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852995 | danikoynov | Ancient Machine (JOI21_ancient_machine) | C++17 | 67 ms | 9964 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>
#include <bits/stdc++.h>
namespace
{
}
void Anna(int N, std::vector<char> S)
{
for (int i = 0; i < N; i ++)
{
if (S[i] == 'X')
{
Send(0);
Send(0);
}
else
if (S[i] == 'Y')
{
Send(1);
Send(0);
}
else
if (S[i] == 'Z')
{
Send(1);
Send(1);
}
}
}
#include "Bruno.h"
#include <vector>
#include <iostream>
namespace
{
const int maxn = 1e5 + 10;
int variable_example = 0;
int FunctionExample(int P)
{
return 1 - P;
}
char c[maxn];
} // namespace
void sub_solve()
{
}
void Bruno(int N, int L, std::vector<int> A)
{
for (int i = 0; i < N; i ++)
{
if (A[i * 2] == 0)
c[i] = 'X';
else if (A[i * 2 + 1] == 0)
c[i] = 'Y';
else
c[i] = 'Z';
}
int pt = 0;
while(pt < N && c[pt] != 'X')
{
Remove(pt);
pt ++;
}
int last = pt;
while(last < N)
{
int id = last + 1;
while(id < N && c[id] != 'Z')
id ++;
for (int i = id - 1; i > last; i --)
Remove(i);
if (id != N)
Remove(id);
last = id;
}
if (pt != N)
Remove(pt);
/**for (int i = 0; i < N; i ++)
std::cout << c[i] << " ";
std::cout << std::endl;*/
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |