QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#87170	#5420. Inscryption	white2718	WA	196ms	3600kb	C++14	1.2kb	2023-03-11 20:54:41	2023-03-11 20:54:43

Judging History

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

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

[2023-03-11 20:54:43]
评测

测评结果：WA
用时：196ms
内存：3600kb

查看

[2023-03-11 20:54:41]
提交

answer

#include <bits/stdc++.h>
using namespace std;
inline int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }

inline int lcm(int n, int m) { return n * m / gcd(n, m); }
int t,n;
int a,b[1000010];
int main(){
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        int x=1,y=1,flag=0,ccnt=0;
        for(int i=0;i<n;i++){
            scanf("%d",&a);
            if(a==1){
                x++;
                y++;
            }
            if(a==-1){
                if(y>1){
                    y--;
                }
                else{
                    if(ccnt){
                        x++;
                        ccnt--;
                    }
                    else{
                        flag=1;
                    }
                }
            }
            if(a==0){
                ccnt++;
            }
        }
        if(flag){
            puts("-1");
            continue;
        }
        while(ccnt--){
            if(y>1){
                y--;
            }
            else{
                x++;
                y++;
            }
        }
        int tmp=gcd(x,y);
        x/=tmp,y/=tmp;
        printf("%d %d\n",x,y);
    }

}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3584kb

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: 196ms

memory: 3600kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 107ms

memory: 3536kb

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 28th lines differ - expected: '5 4', found: '2 1'