# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798396 | Sohsoh84 | 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 "Anna.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
int variable_example = 0;
}
void Anna(int N, std::vector<char> S) {
variable_example++;
vector<int> ans;
bool flag = true;
for (int i = 0; i < N; i++) {
if (S[i] == 'X') flag = false;
ans.push_back(flag || S[i] == 'Z');
}
for (int e : ans)
cerr << e << ' ';
cerr << endl;
while (!ans.empty() && ans.back() == 0) ans.pop_back();
if (!ans.empty()) ans.pop_back();
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> A) {
A.push_back(1);
while (A.size() < N) A.push_back(0);
stack<int> st;
for (int i = 0; i < L; 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();
}
}
i