QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #623606 | #5420. Inscryption | gates_orz | WA | 124ms | 6048kb | C++20 | 1.3kb | 2024-10-09 13:23:52 | 2024-10-09 13:24:07 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using LL =long long;
#define int LL
const int N=3e5+10;
const int M=N*2;
int n,m;
int sa[N];
void solve() {
cin>>n;
int atk=1,num=1;
for(int i=1;i<=n;i++)cin>>sa[i];
int cnt_1=0,cnt_f1=0;
int sign=1;
for(int i=1;i<=n;i++) {
if(sa[i]==1)atk++,num++;
else if(sa[i]==-1) {
if(num>1) {
num--;
}
else {
if(cnt_f1) {
cnt_f1--;
num++;
atk++;
}
else {
sign=0;
}
}
}
else if(sa[i]==0) {
if(num>1) {
cnt_f1++;
num--;
}
else {
cnt_1++;
num++;
atk++;
}
}
}
if(!sign) {
cout<<"-1"<<"\n";
return;
}
//cerr<<"atk="<<atk<<" num="<<num<<"\n";
int g=__gcd(atk,num);
cout<<atk/g<<" "<<num/g<<"\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T=1;
cin>>T;
while(T--)solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3652kb
input:
6 7 1 1 1 -1 1 1 -1 4 1 0 -1 0 4 0 -1 -1 0 1 0 2 0 0 1 -1
output:
3 2 3 1 -1 1 1 2 1 -1
result:
ok 6 lines
Test #2:
score: 0
Accepted
time: 124ms
memory: 3672kb
input:
1000000 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 0 1 0 1 1 1 0 1 -1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 1 -1 1 1 1 1 1 -1 1 0 1 1 1 0 1 -1 1 0 1 -1 1 1 1 -1 1 0 1 1 1 1 1 -1 1 0 1 -1 1 -1 1 -1 1 -1 1 0 1 0 1 -1 1 0 1 -1 1 0 1 0 1 0 1 0 1 0 1 -1 1 1 1 0 1 0 1 1 1 0 1 -1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 ...
output:
1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 ...
result:
ok 1000000 lines
Test #3:
score: 0
Accepted
time: 59ms
memory: 3712kb
input:
181249 6 1 0 -1 0 1 0 4 1 -1 -1 -1 8 -1 0 0 0 1 -1 1 1 3 0 1 0 6 1 0 -1 1 -1 0 4 1 -1 -1 -1 9 0 1 0 -1 -1 0 -1 0 1 1 -1 3 0 -1 1 5 0 0 1 -1 1 3 1 -1 0 6 -1 0 0 -1 0 1 8 1 -1 -1 -1 0 1 -1 0 2 0 0 3 -1 1 0 3 0 -1 -1 10 0 1 0 -1 1 1 0 -1 1 0 3 1 0 0 9 1 -1 1 -1 0 -1 0 0 0 3 0 1 0 3 -1 0 0 7 -1 0 -1 -1 ...
output:
4 1 -1 -1 3 2 4 1 -1 3 1 -1 3 2 2 1 3 2 -1 -1 2 1 -1 -1 6 1 3 2 3 1 3 2 -1 -1 -1 -1 2 1 5 3 -1 5 4 2 1 -1 3 2 5 1 1 1 -1 3 2 -1 1 1 -1 2 1 1 1 -1 1 1 -1 1 1 3 2 -1 -1 -1 -1 3 2 5 2 1 1 -1 3 1 -1 -1 1 1 -1 6 1 3 2 -1 3 2 4 3 2 1 -1 5 3 3 1 6 1 -1 2 1 5 4 -1 1 1 -1 3 1 -1 -1 5 3 1 1 2 1 5 2 -1 3 1 4 3...
result:
ok 181249 lines
Test #4:
score: 0
Accepted
time: 45ms
memory: 3596kb
input:
19793 93 1 -1 1 1 -1 -1 1 0 0 0 0 1 1 -1 -1 -1 0 -1 -1 1 -1 0 0 0 0 1 0 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 0 1 0 -1 -1 0 1 1 0 -1 -1 0 1 1 0 -1 1 -1 -1 -1 0 0 0 1 -1 0 1 -1 0 0 0 1 0 -1 1 -1 -1 1 -1 0 1 -1 0 -1 -1 1 0 0 0 0 0 0 -1 -1 36 0 1 1 -1 1 -1 0 1 1 1 0 -1 1 1 -1 0 1 1 1 1 0 1 -1 -1 1 -1 1 0 -1 0 ...
output:
24 1 19 1 12 1 47 4 12 1 22 1 23 3 14 1 11 2 46 1 -1 -1 -1 26 3 -1 -1 13 1 2 1 -1 33 4 41 2 -1 43 2 -1 -1 -1 -1 25 1 7 1 -1 -1 -1 -1 -1 11 2 2 1 -1 27 4 -1 31 1 14 1 20 1 -1 5 3 38 1 24 1 -1 2 1 23 2 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 18 1 50 1 37 1 19 2 -1 21 1 -1 -1 14 1 15 2 30 1 -1 13 3 -1 -...
result:
ok 19793 lines
Test #5:
score: 0
Accepted
time: 43ms
memory: 3668kb
input:
1987 350 -1 1 0 0 0 -1 0 1 -1 1 0 0 -1 1 1 -1 1 1 -1 -1 -1 -1 0 1 1 0 1 0 0 0 -1 0 1 -1 1 0 1 -1 -1 1 0 1 1 1 -1 0 0 0 1 0 1 0 0 1 -1 1 0 1 0 1 -1 1 0 1 -1 -1 0 -1 1 0 -1 1 1 1 -1 -1 -1 0 0 0 0 -1 -1 -1 -1 -1 0 1 1 -1 -1 1 0 1 -1 0 0 -1 -1 1 0 0 -1 0 -1 1 1 0 -1 1 -1 0 -1 1 -1 1 1 -1 0 0 1 -1 1 0 1 ...
output:
-1 -1 182 3 57 2 205 2 262 3 428 3 25 1 333 2 -1 469 1 440 3 176 3 -1 -1 -1 175 2 -1 44 1 -1 -1 -1 -1 -1 -1 135 1 -1 -1 -1 -1 -1 -1 -1 470 3 158 5 215 1 -1 -1 -1 -1 55 1 -1 -1 -1 241 1 175 11 -1 393 1 224 5 45 1 165 1 209 1 -1 488 1 15 1 -1 -1 -1 -1 -1 312 5 -1 -1 -1 -1 78 1 211 2 -1 -1 172 1 458 1 ...
result:
ok 1987 lines
Test #6:
score: 0
Accepted
time: 43ms
memory: 3732kb
input:
188 5255 1 0 -1 -1 1 0 0 0 -1 0 -1 1 0 -1 1 0 -1 0 -1 0 0 0 0 -1 -1 0 0 1 -1 1 0 -1 0 -1 -1 1 0 1 -1 1 -1 1 0 1 1 1 -1 1 1 1 -1 0 -1 -1 0 0 1 1 0 0 -1 -1 0 1 0 0 1 0 -1 -1 1 -1 -1 1 0 -1 1 0 0 -1 1 -1 -1 -1 1 1 -1 0 1 1 -1 -1 1 0 -1 -1 -1 0 1 1 1 -1 0 1 -1 1 -1 0 1 0 -1 1 0 0 1 0 0 -1 1 1 -1 1 1 -1 ...
output:
2629 2 -1 -1 2154 1 1205 2 2907 1 -1 3373 2 4531 4 -1 3399 2 -1 -1 -1 -1 470 3 -1 1737 1 -1 -1 1475 2 4915 3 705 7 -1 2269 2 4587 2 -1 2021 1 -1 2990 7 -1 -1 -1 -1 848 1 1533 1 -1 -1 595 1 -1 -1 -1 1553 4 -1 225 4 -1 -1 -1 1697 3 494 1 -1 2433 1 -1 -1 -1 -1 -1 -1 931 3 -1 3211 1 1119 1 1382 1 1591 1...
result:
ok 188 lines
Test #7:
score: 0
Accepted
time: 39ms
memory: 4320kb
input:
19 48437 -1 1 1 -1 0 0 -1 1 -1 1 -1 -1 -1 -1 -1 0 1 0 1 -1 -1 1 -1 -1 1 1 1 0 1 -1 0 0 -1 -1 0 0 1 0 0 1 1 1 1 0 -1 0 -1 1 1 -1 -1 0 1 1 0 0 0 1 0 -1 0 -1 1 0 0 0 -1 1 1 -1 0 0 0 0 -1 0 -1 0 -1 0 1 0 -1 1 0 1 -1 1 0 1 1 0 0 1 -1 -1 0 1 -1 0 1 1 -1 1 -1 0 -1 -1 1 0 -1 1 0 1 0 0 1 1 0 1 1 -1 0 -1 0 1 ...
output:
-1 -1 -1 3841 5 11848 1 24812 1 -1 46995 2 13406 1 -1 18922 5 -1 -1 -1 10079 4 -1 -1 2267 3 48220 1
result:
ok 19 lines
Test #8:
score: -100
Wrong Answer
time: 12ms
memory: 6048kb
input:
1 1000000 -1 0 0 -1 0 -1 0 1 -1 1 1 0 1 -1 0 1 -1 1 0 1 -1 1 1 0 -1 1 -1 1 -1 0 1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 0 -1 0 0 1 1 -1 0 0 -1 -1 0 -1 -1 1 -1 0 1 -1 0 0 1 1 1 -1 -1 1 0 -1 -1 1 -1 1 -1 1 1 1 0 0 1 1 0 -1 1 1 0 0 1 0 -1 -1 -1 -1 0 -1 1 0 0 0 1 -1 -1 1 0 0 0 0 0 1 -1 0 0 -1 -1 0 1 -1 -1 -1 1 -1...
output:
1 1
result:
wrong answer 1st lines differ - expected: '-1', found: '1 1'