QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#635274 | #5420. Inscryption | wzxtsl# | WA | 491ms | 3704kb | C++23 | 1.1kb | 2024-10-12 19:25:32 | 2024-10-12 19:25:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_stdio_with(false),cin.tie(0),cout.tie(0);
#define int long long
#define For(i,a,aa) for(int i=a;i<=aa;i++)
int n,m;
const int N=2e6+7;
int sum1,sum2,sum3;
int a,zi,mu;
double ans;
void solve(){
ans=sum1=sum2=sum3=0;
cin>>n;
int flg=0;
For(i,1,n)
{
cin>>a;
if(a==1) sum1++;
else if(a==0) sum3++;
else
{
sum2++;
if(sum1+sum3<sum2)
{
flg=1;
}
}
} //cout<<flg<<"!";
if(flg) {
cout<<-1<<endl;return ;
}
For(i,0,sum3)
{
if(1+sum1+2*i-sum2-sum3<=0) continue;
if((sum1+1+i)/(1+sum1+2*i-sum2-sum3)>ans)
{
ans=(sum1+1+i)/(1+sum1+2*i-sum2-sum3);
int g=__gcd((sum1+1+i),(1+sum1+2*i-sum2-sum3));
zi=(sum1+1+i)/g,mu=(1+sum1+2*i-sum2-sum3)/g;
}
}
cout<<zi<<" "<<mu<<endl;
}
signed main(){
int t=1;
cin>>t;
while(t--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
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: 491ms
memory: 3704kb
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: 193ms
memory: 3564kb
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 2 1 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 2 1 -1 1 1 -1 3 1 -1 -1 4 1 1 1 2 1 5 2 -1 3 1 3 1...
result:
wrong answer 28th lines differ - expected: '5 4', found: '2 1'