QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#99717#5420. Inscryptionkrito2023#WA 255ms3464kbC++20999b2023-04-23 15:39:262023-04-23 15:39:39

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:39:39]
  • 评测
  • 测评结果:WA
  • 用时:255ms
  • 内存:3464kb
  • [2023-04-23 15:39:26]
  • 提交

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;
	for(int i = 1; i <= n; i++){
		if(b[i]==1){
			ans++,cnt++;
			
		}
		else{
			
			cnt--;
		}
		pre[i] = pre[i-1]+b[i];
		if(cnt<=0){
			cout<<"-1\n";
			return ;
		}
	}
	// cout<<"cha:"<<cha<<"\n";
	int cha=0;
	for(int i=n;i;--i){
		if(a[i]==0&&cha+pre[i-1]>1){
			b[i] = -1;
			cha-=2;
		}
		cha += b[i];
		// cout<<b[i]<<" ";
	}
	// cout<<endl;
	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();
	}
	
}

详细

Test #1:

score: 100
Accepted
time: 2ms
memory: 3424kb

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:

3 2
3 1
-1
1 1
2 1
-1

result:

ok 6 lines

Test #2:

score: 0
Accepted
time: 255ms
memory: 3364kb

input:

1000000
1
1
1
-1
1
1
1
1
1
1
1
1
1
-1
1
-1
1
0
1
0
1
1
1
0
1
-1
1
0
1
1
1
0
1
1
1
0
1
1
1
0
1
0
1
0
1
1
1
-1
1
1
1
1
1
-1
1
0
1
1
1
0
1
-1
1
0
1
-1
1
1
1
-1
1
0
1
1
1
1
1
-1
1
0
1
-1
1
-1
1
-1
1
-1
1
0
1
0
1
-1
1
0
1
-1
1
0
1
0
1
0
1
0
1
0
1
-1
1
1
1
0
1
0
1
1
1
0
1
-1
1
1
1
1
1
0
1
1
1
1
1
1
1
0
1
...

output:

1 1
-1
1 1
1 1
1 1
1 1
-1
-1
1 1
1 1
1 1
1 1
-1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
-1
1 1
1 1
-1
1 1
1 1
1 1
-1
1 1
-1
1 1
-1
1 1
1 1
1 1
-1
1 1
-1
-1
-1
-1
1 1
1 1
-1
1 1
-1
1 1
1 1
1 1
1 1
1 1
-1
1 1
1 1
1 1
1 1
1 1
-1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
-1
-1
1 1
1 1
-1
1 1
1 1
1 1
1 1
-1
1 1
1 1
1 ...

result:

ok 1000000 lines

Test #3:

score: -100
Wrong Answer
time: 113ms
memory: 3464kb

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:

5 3
-1
-1
3 2
4 1
-1
3 1
-1
3 2
2 1
3 2
-1
-1
2 1
-1
-1
7 3
3 2
3 1
3 2
-1
-1
-1
-1
2 1
5 3
-1
2 1
2 1
-1
3 2
2 1
1 1
-1
3 2
-1
1 1
-1
2 1
1 1
-1
1 1
-1
1 1
3 2
-1
-1
-1
-1
3 2
3 2
1 1
-1
3 1
-1
-1
1 1
-1
7 3
3 2
-1
3 2
4 3
2 1
-1
5 3
3 1
6 1
-1
2 1
2 1
-1
1 1
-1
3 1
-1
-1
4 1
1 1
2 1
5 2
-1
3 1
3 1...

result:

wrong answer 1st lines differ - expected: '4 1', found: '5 3'