QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#879838	#5420. Inscryption	Horcrux^#	WA	138ms	3712kb	C++23	1.1kb	2025-02-02 16:12:28	2025-02-02 16:12:29

Judging History

This is the latest submission verdict.

[2025-02-02 16:12:29]
Judged

Verdict: WA
Time: 138ms
Memory: 3712kb

Show

[2025-02-02 16:12:28]
Submitted

answer

#include <bits/stdc++.h>
#define int long long

using namespace std;

void solve() {
    int n;
    cin >> n;

    vector <int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    int ans1 = 1, ans2 = 1;
    bool free = false;
    for(int i = 0; i < n; i++) {
        if(a[i] == 1) {
            ans1++, ans2++;
        } else if(a[i] == -1) {
            if(ans2 > 1) {
                ans2--;
                continue ;
            }

            if(free == false) {
                cout << "-1\n";
                return ;
            } else {
                free = true;
                ans1++, ans2++;
            }
        } else {
            if(ans2 > 1) {
                ans2--;
                free = true;
            } else {
                ans1++, ans2++;
            }
        }
    }

    int GCD = __gcd(ans1, ans2);
    ans1 /= GCD, ans2 /= GCD;

    cout << ans1 << ' ' << ans2 << '\n';
}

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

    int t;
    cin >> t;

    while(t--) {
        solve();
    }

    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3712kb

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

memory: 3712kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 66ms

memory: 3712kb

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 48th lines differ - expected: '-1', found: '6 1'