QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #639967 | #5420. Inscryption | ciyekua | WA | 135ms | 3712kb | C++23 | 1.4kb | 2024-10-14 00:44:53 | 2024-10-14 00:44:54 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0),cin.tie(0);
int t,n,x,lisum,sum,zero;
cin>>t;
while(t--) {
int fl=0;
lisum=1,sum=1,zero=0;
cin>>n;
for(int i=0;i<n;i++) {
cin>>x;
if(x==1) {
lisum++;
sum++;
}
if(x==-1) {
sum--;
}
if(x==0) {
zero++;
}
if(sum==1||sum==0) {
if(zero>0) {
sum++;
lisum++;
zero--;
}
else {
fl=1;
}
}
}
//cout<<sum<<" "<<zero<<" "<<sum<<"#\n";
if(fl==0)
while(1) {
if(zero==0) break;
if(sum==1) {
sum++;
lisum++;
}
else sum--;
zero--;
}
if(fl==1) cout<<"-1\n";
else {
int gcd0=__gcd(lisum,sum);
while(1) {
if(gcd0==1) break;
lisum/=gcd0;
sum/=gcd0;
gcd0=__gcd(lisum,sum);
}
cout<<lisum<<" "<<sum<<"\n";
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 135ms
memory: 3712kb
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: -100
Wrong Answer
time: 60ms
memory: 3592kb
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 -1 2 1 -1 -1 -1 2 1 -1 -1 6 1 3 2 -1 3 2 -1 -1 -1 -1 2 1 5 3 -1 5 4 2 1 -1 3 2 -1 1 1 -1 3 2 -1 1 1 -1 -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 -1 4 3 -1 -1 -1 3 1 6 1 -1 -1 5 4 -1 1 1 -1 -1 -1 -1 5 3 1 1 2 1 -1 -1 3 1 -1 3 2 -1 -1 3...
result:
wrong answer 9th lines differ - expected: '3 2', found: '-1'