QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#99711	#5420. Inscryption	krito2023^#	WA	225ms	3448kb	C++20	921b	2023-04-23 15:30:06	2023-04-23 15:30:07

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-04-23 15:30:07]
评测

测评结果：WA
用时：225ms
内存：3448kb

查看

[2023-04-23 15:30:06]
提交

answer

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

void solve() {
	int n;
	cin >> n;
	vector<int> a(n + 1),b(n+1);
	int cnt1 = 0, cnt0 = 0;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
		b[i]=a[i];
		if(a[i]==0){
			b[i]=1;
		}
	}
	vector<int> pre(n+1);
	pre[0]=1;
	int ans=1,cnt=1,cha=1;
	for(int i = 1; i <= n; i++){
		if(b[i]==1){
			ans++,cnt++;
			cha++;
		}
		else{
			cha--;
			cnt--;
		}
		pre[i] = pre[i-1]+b[i];
		if(cnt<=0){
			cout<<"-1\n";
			return ;
		}
	}
	for(int i=n;i;--i){
		if(a[i]==0&&cha>2&&pre[i-1]>1){
			b[i] = -1;
			cha-=2;
		}
	}
	ans=1,cnt=1;
	for(int i=1;i<=n;++i){
		if(b[i]==1){
			ans++;cnt++;
		}
		else{
			cnt--;
		}
	}
	int tmp = __gcd(ans, cnt);
	ans /= tmp, cnt /= tmp;
	cout << ans << " " << cnt << "\n";
}

int main() {
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t;
	cin >> t;
	while(t --) {
		solve();
	}
	
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 2ms

memory: 3416kb

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

memory: 3444kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 98ms

memory: 3448kb

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