QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #19984 | #3098. Ancient Machine | Xiao_Luo_Xuan | 5 | 4ms | 3876kb | C++20 | 755b | 2022-02-14 14:53:57 | 2023-01-17 10:37:21 |
Judging History
Anna
#include<bits/stdc++.h>
#include "Anna.h"
using namespace std;
const int N=1e5+5;
void Anna(int n,vector <char> S){
bool ans[N];
int st=0;
for(int i=0;i<n;i++){
if(S[i]=='X'){
st=i;
break;
}
}
ans[st]=1;
for(int i=st+1;i<n;i++)
if(S[i]=='Z') ans[i]=1;
for(int i=0;i<n;i++) Send(ans[i]);
}
Bruno
#include<bits/stdc++.h>
#include "Bruno.h"
using namespace std;
const int N=1e5+5;
void Bruno(int n,int l,vector <int> A){
int st=0;
for(int i=0;i<l;i++){
if(A[i]){
st=i;
break;
}
}
for(int i=0;i<st;i++) Remove(i);
int lst=st+1;
for(int i=st+1;i<l;i++){
if(A[i]){
for(int t=i-1;t>=lst;t--) Remove(t);
Remove(i);
lst=i+1;
}
}
for(int i=lst;i<n;i++) Remove(i);
Remove(st);
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 5
Accepted
Test #1:
score: 100
Accepted
time: 4ms
memory: 3632kb
input:
18 Y X Y Z X Z X X Z Z Y Y Z Y Y Z X X
output:
18 010101001100100100
input:
18 010101001100100100
output:
0 18 3
result:
ok n = 18, D = 18, L = 3
Test #2:
score: 100
Accepted
time: 4ms
memory: 3692kb
input:
18 X Z X Y Y Y X Z X Y Z Z Z Z Y Z Z Y
output:
18 110000010011110110
input:
18 110000010011110110
output:
0 18 3
result:
ok n = 18, D = 18, L = 3
Test #3:
score: 100
Accepted
time: 4ms
memory: 3700kb
input:
18 Y Z Z Y Z X X Z Y Y Z Z Z Y X X Z Y
output:
18 000001010011100010
input:
18 000001010011100010
output:
0 18 2
result:
ok n = 18, D = 18, L = 2
Test #4:
score: 100
Accepted
time: 4ms
memory: 3640kb
input:
18 X Z Z X Z X X Z X Y Y X X Z X Y Z X
output:
18 111010010000010010
input:
18 111010010000010010
output:
0 18 2
result:
ok n = 18, D = 18, L = 2
Test #5:
score: 100
Accepted
time: 0ms
memory: 3632kb
input:
18 X Y X Y Y X X Z Y Z Y X Z Y Y X X Z
output:
18 100000010100100001
input:
18 100000010100100001
output:
0 18 5
result:
ok n = 18, D = 18, L = 5
Test #6:
score: 100
Accepted
time: 4ms
memory: 3724kb
input:
18 X X Y Z X Y Y Y X X Z X X X Z X Z Z
output:
18 100100000010001011
input:
18 100100000010001011
output:
0 18 2
result:
ok n = 18, D = 18, L = 2
Test #7:
score: 100
Accepted
time: 4ms
memory: 3696kb
input:
3 X Y Z
output:
3 101
input:
3 101
output:
0 3 1
result:
ok n = 3, D = 3, L = 1
Test #8:
score: 100
Accepted
time: 4ms
memory: 3632kb
input:
3 Z Y X
output:
3 001
input:
3 001
output:
0 3 0
result:
ok n = 3, D = 3, L = 0
Test #9:
score: 100
Accepted
time: 4ms
memory: 3784kb
input:
18 X X X X X X X X X X X X X X X X X X
output:
18 100000000000000000
input:
18 100000000000000000
output:
0 18 0
result:
ok n = 18, D = 18, L = 0
Test #10:
score: 100
Accepted
time: 0ms
memory: 3632kb
input:
18 Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y
output:
18 100000000000000000
input:
18 100000000000000000
output:
0 18 0
result:
ok n = 18, D = 18, L = 0
Test #11:
score: 100
Accepted
time: 4ms
memory: 3696kb
input:
18 Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z
output:
18 111111111111111111
input:
18 111111111111111111
output:
0 18 0
result:
ok n = 18, D = 18, L = 0
Subtask #2:
score: 0
Wrong Answer
Test #12:
score: 0
Wrong Answer
time: 0ms
memory: 3876kb
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...
output:
Wrong Answer [1]
input:
Wrong Answer [1]
output:
Unauthorized output
result:
wrong output format Expected integer, but "Unauthorized" found