# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574426 | Arvin | Ancient Machine (JOI21_ancient_machine) | C++17 | 47 ms | 6728 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;
#define ll long long
namespace {
int variable_example = 0;
}
void Anna(int N, std::vector<char> S) {
for(int x=0;x<N;x++){
if(S[x] == 'X'){
Send(1);
Send(0);
} else if(S[x] == 'Y'){
Send(0);
Send(1);
} else if(S[x] == 'Z'){
Send(1);
Send(1);
}
}
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
namespace {
int variable_example = 0;
int FunctionExample(int P) { return 1 - P; }
} // namespace
void Bruno(int N, int L, std::vector<int> A) {
// for (int i = 0; i < L; i++) {
// variable_example += FunctionExample(A[i]);
// }
int S[N];
for(int x=0;x<N;x++){
S[x] = 0;
for(int y=0;y<2;y++){
if(A[2*x+y] == 1){
S[x] += (1 << y);
}
}
}
vector<int> ans;
stack<pair<int, int>> st;
for(int x=0;x<N;x++){
if(st.empty() || st.top().first+1 == S[x]){
if(S[x] == 3){
ans.push_back(st.top().second);
ans.push_back(x);
st.pop();
} else {
st.push({S[x], x});
}
}
}
for(auto val : ans){
Remove(val);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |