| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 419750 | amoo_safar | Ancient Machine (JOI21_ancient_machine) | C++17 | 83 ms | 9172 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>
#define pb push_back
using namespace std;
void Anna(int _n, vector<char> S){
vector<int> V(_n, 0), seq;
int fl = 0, fly = 1;
for(int i = _n - 1; i >= 0; i--){
if(S[i] == 'Y') fly = 1;
if(S[i] == 'Z')
V[i] = 1, fly = 0;
}
int i = 0;
for(auto c : S){
if(fl == 0 && c == 'X'){
fl = 1;
seq.pb(1);
seq.pb(0);
} else {
seq.pb(fl ? V[i] : 0);
}
i ++;
}
for(auto x : seq)
Send(x);
// for(auto x : seq)
// cerr << x;
// cerr << '\n';
}
#include "Bruno.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
void Bruno(int _n, int L, vector<int> B) {
int fl = 0;
vector<int> A;
for(int i = 0; i < L; i++){
if(B[i] == 0) A.pb(0);
else {
A.pb(1);
if(!fl) i++;
fl = 1;
}
}
A.resize(_n, 0);
L = _n;
int cnt = 0;
vector<int> mk(_n, 0);
for (int i = 0; i < L; i++) {
// cerr << "!" << A[i] << '\n';
if(A[i] == 1){
cnt ++;
for(int j = i - 1; j >= 0; j--){
if(A[j] == 1) break;
Remove(j);
mk[j] = 1;
}
if(cnt != 1){
Remove(i);
mk[i] = 1;
};
}
}
for(int i = 0; i < _n; i++) if(!mk[i]) Remove(i);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
