| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1008302 | IBory | Ancient Machine (JOI21_ancient_machine) | C++17 | 0 ms | 0 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 "ancient_machine.h"
#include <bits/stdc++.h>
using namespace std;
void Anna(int N, vector<char> S) {
int x = 0, y = 0, z = 0;
vector<int> go(N);
for (int i = 0; i < N; ++i) {
if (!x) {
if (S[i] == 'X') x = i;
}
else if (!y) {
if (S[i] == 'X') x = i;
if (S[i] == 'Y') y = i;
}
else if (!z) {
if (S[i] == 'Z') {
go[x] = go[y] = go[i] = 1;
x = 0, y = 0, z = 0;
}
}
}
for (int n : go) Send(n);
}
#include "ancient_machine.h"
#include <bits/stdc++.h>
using namespace std;
void Bruno(int N, int L, vector<int> A) {
vector<int> P;
for (int i = 0; i < A.size(); ++i) {
if (A[i]) P.push_back(i);
else Remove(i);
}
for (int i = 1; i < P.size(); i += 3) Remove(P[i]);
for (int i = 0; i < P.size(); ++i) if (i % 3 != 1) Remove(P[i]);
}