QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#106413	#5420. Inscryption	wsygxlj	WA	234ms	7840kb	C++14	1.3kb	2023-05-17 18:07:34	2023-05-17 18:07:39

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-05-17 18:07:39]
评测

测评结果：WA
用时：234ms
内存：7840kb

查看

[2023-05-17 18:07:34]
提交

answer

#include<bits/stdc++.h>
using namespace std;
int c1[1000006],c2[1000005],a[1000005];
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            c1[i]=c2[i]=0;
        }
        c1[n+1]=c2[n+1]=0;
        for(int i=n;i>0;i--)
        {
            if(a[i]==1)
            {
                c2[i]=c2[i+1];c1[i]=c1[i+1]+1;
            }
            else {
                    c2[i]=c2[i+1]+1;c1[i]=c1[i+1];
            }
           // cout<<c1[i]<<" "<<c2[i]<<endl;
        }
        int f=1;
        long long c=1,b=1;
        for(int i=1;i<=n;i++)
        {
            //cout<<c<<" "<<b<<" "<<c1[i]<<" "<<c2[i]<<endl;
            if(a[i]==1) c++,b++;
            else if(a[i]==-1)
            {
                if(b>=2) b--;
                else
                {
                    f=0;break;
                }
            }
            else
            {
                if(b+c1[i]>=c2[i]+1&&b>=2) b--;
                else c++,b++;
            }
        }
        if(f)
        {
            long long g=__gcd(c,b);
            printf("%lld %lld\n",c/g,b/g);
        }
        else printf("-1\n");
    }


    return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 7840kb

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:

result:

ok 6 lines

Test #2:

score: 0

Accepted

time: 234ms

memory: 7664kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 100ms

memory: 7812kb

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:

result:

wrong answer 71st lines differ - expected: '5 4', found: '-1'