QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#405484	#5420. Inscryption	FOY^#	WA	308ms	3596kb	C++17	865b	2024-05-06 00:43:46	2024-05-06 00:43:47

Judging History

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

[2024-05-06 00:43:47]
评测

测评结果：WA
用时：308ms
内存：3596kb

查看

[2024-05-06 00:43:46]
提交

answer

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const ll ZERO = 0;

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

	ll a, cnt_0 = 0;
	ll tot_a = 1, tot_n = 1;
	bool flag = true;
	for (ll i = 0; i < n; i++) {
		cin >> a;

		if (a == 0) {
			if (tot_n > 1) {
				tot_n--;
				cnt_0++;
			} else {
				tot_a++;
				tot_n++;
			}
		} else if (a == -1) {
			if (tot_n > 1) {
				tot_n--;
			} else if (tot_n == 1 && cnt_0 > 0) {
				tot_n++;
				tot_a++;
			} else {
				flag = false;
			}
		} else {
			tot_a++;
			tot_n++;
		}
	}

	if (!flag) {
		cout << -1 << endl;
		return;
	}

	ll g = gcd(tot_a, tot_n);

	cout << tot_a / g << " " << tot_n / g << endl;
	
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	ll t;
	cin >> t;

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

}

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3520kb

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

memory: 3552kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 87ms

memory: 3596kb

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'