QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#670237	#5420. Inscryption	yell	WA	172ms	3604kb	C++20	1.0kb	2024-10-23 20:58:15	2024-10-23 20:58:16

Judging History

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

[2024-10-23 20:58:16]
评测

测评结果：WA
用时：172ms
内存：3604kb

查看

[2024-10-23 20:58:15]
提交

answer

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

void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 1), suf(n + 2);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = n; i >= 1; i--) {
        suf[i] = suf[i + 1] + (a[i] == 0 ? -1 : a[i]);
    }

    int power = 1, now = 1;
    for (int i = 1; i <= n; i++) {
        if (a[i] == 1) {
            now++;
            power++;
        } else if (a[i] == -1) {
            now--;
        } else {
            if (now + suf[i + 1] <= 1) {
                now++;
                power++;
            } else {
                now--;
            }
        }
        if (now <= 0) {
            cout << -1 << "\n";
            return;
        }
    }
    int g = gcd(now, power);
    power /= g;
    now /= g;
    cout << power << " " << now << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3528kb

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

memory: 3532kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 70ms

memory: 3604kb

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: '-1'