# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800072 | Sohsoh84 | Ancient Machine (JOI21_ancient_machine) | C++17 | 46 ms | 8496 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;
namespace {
int variable_example = 0;
}
void Anna(int N, vector<char> S) {
variable_example++;
int tflagind = -1;
vector<int> ans = {0};
for (int i = 1; i < N; i++) {
ans.push_back(S[i - 1] == 'Z');
}
int ind = 0;
while (S[ind] != 'X' && ind < N) ind++;
if (ind == N) return;
for (int i = 0; i <= ind; i++) ans[i] = 0;
ans[ind] = 1;
for (int e : ans)
Send(e);
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
int variable_example = 0;
int FunctionExample(int P) { return 1 - P; }
} // namespace
void Bruno(int N, int L, std::vector<int> TA) {
if (!L) {
for (int i = 0; i < N; i++)
Remove(i);
return;
}
int ind = 0;
vector<int> A(N);
while (!TA[ind]) ind++;
for (int i = 0; i < ind; i++)
A[i] = 1;
A[N - 1] = 1;
for (int i = ind + 1; i < N; i++)
A[i - 1] = TA[i];
stack<int> st;
bool flag = false;
for (int i = 0; i < N; i++) {
if (A[i]) {
while (st.size() > 1) {
Remove(st.top());
st.pop();
}
Remove(i);
} else st.push(i);
}
while (!st.empty()) {
Remove(st.top());
st.pop();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |