# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
572869 | Arvin | Ancient Machine (JOI21_ancient_machine) | C++17 | 76 ms | 12264 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);
}
}
}
int table[N];
int last[N][4];
for(int x=0;x<N;x++){
table[x] = (x > 0 ? table[x-1] : 0);
for(int y=0;y<4;y++){
last[x][y] = (x > 0 ? last[x-1][y] : -1);
}
last[x][S[x]] = x;
if(S[x] == 3){
int lst = last[x][2];
int lst2 = last[lst][1];
table[x] = max(table[x], table[lst2]+1);
}
}
int mark[N];
fill(mark, mark+N, 0);
int cur = table[N-1];
int pos = N-1;
while(cur > 0){
while(pos > 0 && table[pos-1] == cur){
pos--;
}
int lst = last[pos][2];
int lst2 = last[lst][1];
mark[pos] = 3;
mark[lst] = 2;
mark[lst2] = 1;
}
for(int x=0;x<N;x++){
if(mark[x] == 0){
Remove(x);
}
}
for(int x=0;x<N;x++){
if(mark[x] == 2){
Remove(x);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |