# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071031 | ttamx | Ancient Machine (JOI21_ancient_machine) | C++17 | 46 ms | 9464 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;
void Anna(int n,vector<char> s){
int p=-1;
vector<pair<int,int>> a;
for(int i=0;i<n;i++){
if(s[i]=='X'){
p=i;
}
if(s[i]=='Z'){
if(p!=-1){
a.emplace_back(p,i);
p=-1;
}
}
}
vector<int> seq(n);
for(auto [x,y]:a)seq[x]=seq[y]=1;
for(int i=0;i<n;i++)Send(seq[i]);
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
void Bruno(int n,int m,vector<int> seq){
int p=-1;
vector<pair<int,int>> a(n);
for(int i=0;i<n;i++){
if(!seq[i]){
Remove(i);
}
}
for(int i=0;i<n;i++){
if(seq[i]){
Remove(i);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |