QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#182849	#5420. Inscryption	KAZE_mae^#	WA	297ms	3640kb	C++17	881b	2023-09-18 16:58:38	2023-09-18 16:58:38

Judging History

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

[2023-09-18 16:58:38]
评测

测评结果：WA
用时：297ms
内存：3640kb

查看

[2023-09-18 16:58:38]
提交

answer

#include <bits/stdc++.h> 
using namespace std;


void solve() {
    int n, sum = 1, cnt = 1, ql = 0, ans = 0;
    cin>> n;
    for(int i = 0; i < n; ++ i) {
        int op;
        cin>> op;
        if(op == 1) {
            cnt ++, sum ++;
        }else if(op == -1) {
            if(cnt >= 2) cnt --;
            else ans = -1;
        }else {
            if(cnt >= 2)
                ql ++;
            else cnt ++, sum ++;
        }
    }
    if(ans == -1) {
        cout<< -1 <<endl;
        return;
    }else {
        if(cnt > ql) cnt -= ql;
        else sum += (ql - cnt - 1), cnt = 1;
        cout<< sum / __gcd(sum, cnt) << " " << cnt / __gcd(sum, cnt) <<endl;
    }
}

signed main() {
    std::ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int t = 1;
    cin>> t;
    while(t --) {
        solve();
    }
}

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3640kb

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

memory: 3620kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 107ms

memory: 3628kb

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 18th lines differ - expected: '3 2', found: '1 1'