# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1026287 | AdamGS | Ancient Machine (JOI21_ancient_machine) | C++17 | 45 ms | 8636 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 rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
void Anna(int n, vector<char>T) {
vector<int>P(n);
int akt=0;
rep(i, n) if(T[i]=='X'+akt) {
P[i]=1;
++akt;
if(akt==3) akt=1;
}
rep(i, n) Send(P[i]);
}
#include "Bruno.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
void Bruno(int n, int m, vector<int>T) {
rep(i, n) if(!T[i]) Remove(i);
int akt=0;
rep(i, n) if(T[i]) {
if(akt>0) Remove(i);
++akt;
if(akt==3) akt=1;
}
akt=0;
rep(i, n) if(T[i]) {
if(akt==0) Remove(i);
++akt;
if(akt==3) akt=1;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |