QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#20083 | #3098. Ancient Machine | qingyu_orz | 0 | 2ms | 5640kb | C++20 | 1.1kb | 2022-02-14 18:06:39 | 2023-01-17 10:41:13 |
Judging History
Anna
#include<bits/stdc++.h>
#include "Anna.h"
using namespace std;
void Anna(int n,vector<char>g){
int flag=0,lst=-1;
string st;
for(auto cu:g){
int ff=1;
if(cu=='Y')ff=0;
else if(flag&&cu=='X')ff=0;
else if(!flag&&cu=='Z')ff=0;
else if(cu=='X')ff=2,flag=1;
else ff=1;
if(ff==0)st+='0',lst=-1;
else{
if(cu!='Z'||lst!=1)st[st.size()-1]='0',st+='1';
else st+='1';
if(cu=='Z')lst=1;
else lst=-1;
if(ff==2)st+='0';
}
}
for(int i=0;i<st.size();++i)Send(st[i]-'0');
}
Bruno
#include<bits/stdc++.h>
#include "Bruno.h"
using namespace std;
int pre[100005],nxt[100005];
int vist[100005];
void Bruno(int n,int gs,vector<int>g){
set<int>se;
for(int i=1;i<=n;++i)pre[i]=i-1,nxt[i]=i+1;
int X=-1,wz=0;
for(auto cu:g){
++wz;
if(cu==1&&X==-1){
X=wz;
--wz;
continue;
}
if(cu==0||X==-1)continue;
int df=wz-1;
while(df>X){
Remove(df-1);
nxt[pre[df]]=nxt[df];
pre[nxt[df]]=pre[df];
vist[df]=1;
df=pre[df];
}
Remove(wz-1),vist[wz]=1;
nxt[pre[wz]]=nxt[wz];
pre[nxt[wz]]=pre[wz];
}
for(int i=1;i<=n;++i)if(!vist[i])Remove(i-1);
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 5640kb
input:
18 Y X Y Z X Z X X Z Z Y Y Z Y Y Z X X
output:
19 0100101001100100100
input:
19 0100101001100100100
output:
4
result:
wrong answer Wrong Answer [4]
Subtask #2:
score: 0
Programme Anna Dangerous Syscalls
Test #12:
score: 0
Programme Anna Dangerous Syscalls
input:
100000 X Z X Z Z X Y Z Y X Y X Z Z Z Y X Z Y X Y Y X Y Y Y Z Y Z Z Y X X Y X X Y Y X X X Z Y Y Y Z Z Z Z Y X Y Y Z Z Z X Y Z X X X X Y X Y X X Z X Z Z Z X Y X X X Z X Z X X X Y Y Y Y Z X X Y Z Y Y X Z X Z Z Z Z Z Y Z Y X Y Y Y Y X Z Z Y Z Z Y Z Z Z X Z Z X X Z Z Z Z X X Z Y Y Z Y Y Z Z Y Y Z Y Z Y Z...