QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#266396	#5420. Inscryption	khoray^#	WA	156ms	3452kb	C++17	1.0kb	2023-11-26 13:42:26	2023-11-26 13:42:26

Judging History

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

[2023-11-26 13:42:26]
评测

测评结果：WA
用时：156ms
内存：3452kb

查看

[2023-11-26 13:42:26]
提交

answer

#include<bits/stdc++.h>
using namespace std;
using LL = long long;
void solve() {
    int n; cin >> n;
    vector<int> ops(n + 1);
    for(int i = 1; i <= n; i++) cin >> ops[i];
    int p = 1, q = 1;
    vector<int> sum(n + 1);
    for(int i = n; i >= 1; i--) {
        if(i < n) sum[i] = sum[i + 1];
        sum[i] += ops[i] == -1;
    }
    for(int i = 1; i <= n; i++) {
        if(ops[i] == 1) {
            p++;
            q++;
        } else if(ops[i] == 0) {
            if(q >= 2 && q - 2 >= sum[i]) {
                q--;
            } else {
                p++;
                q++;
            }
        } else {
            if(q >= 2) {
                q--;
            } else {
                cout << "-1\n";
                return;
            }
        }
    }
    int g = gcd(p, q);
    p /= g;
    q /= g;
    cout << p << " " << q << "\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
    int t; cin >> t;
    // int t = 1;
    while(t--) solve();
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3368kb

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

memory: 3436kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 62ms

memory: 3452kb

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