QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#698009#5420. InscryptionshinonomezhouWA 136ms9824kbC++231.0kb2024-11-01 16:49:372024-11-01 16:49:38

Judging History

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

  • [2024-11-01 16:49:38]
  • 评测
  • 测评结果:WA
  • 用时:136ms
  • 内存:9824kb
  • [2024-11-01 16:49:37]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+1e2;
int a[N];
int cnt[3][N];
int pcnt[3];
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int T;
	cin>>T;
	while(T--){
		int n;
		cin>>n;
		for(int i=0;i<n;i++){
			cin>>a[i];
		}
		cnt[0][n]=0,cnt[1][n]=0,cnt[2][n]=0;
//		memset(cnt,0,sizeof cnt);
		for(int i=n-1;i>=0;i--){
			for(int j=0;j<3;j++)cnt[j][i]=cnt[j][i+1];
			if(a[i]==-1)cnt[2][i]++;
			else cnt[a[i]][i]++;
		}
		pcnt[0]=0,pcnt[1]=0,pcnt[2]=0;
//		int sum=1,num=1;
		bool flag=false;
		for(int i=0;i<n;i++){
//			cout<<"Y\n";
			if(a[i]==1){
				pcnt[1]++;
			}
			else if(a[i]==-1){
				pcnt[2]++;
			}
			if(pcnt[2]>pcnt[1]){
				flag=true;
				break;
			}
			if(a[i]==0){
				if(pcnt[1]+cnt[1][i+1]<=pcnt[2]+cnt[0][i+1]+cnt[2][i+1]){
					pcnt[1]++;
				}
				else pcnt[2]++;
			}
		}
		if(flag){
			cout<<-1<<"\n";
			continue;
		}
		else {
			int g=__gcd(1+pcnt[1],pcnt[1]-pcnt[2]+1);
			cout<<(1+pcnt[1])/g<<' '<<(pcnt[1]-pcnt[2]+1)/g<<'\n';
		}
		
		
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 136ms
memory: 9820kb

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: 63ms
memory: 9824kb

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:

4 1
-1
-1
3 2
4 1
-1
3 1
-1
3 2
2 1
3 2
-1
-1
2 1
-1
-1
6 1
3 2
3 1
3 2
-1
-1
-1
-1
2 1
5 3
-1
2 1
2 1
-1
3 2
5 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
5 2
1 1
-1
3 1
-1
-1
1 1
-1
6 1
3 2
-1
3 2
4 3
2 1
-1
5 3
3 1
6 1
-1
2 1
-1
-1
1 1
-1
3 1
-1
-1
-1
1 1
2 1
5 2
-1
3 1
-1
3 ...

result:

wrong answer 28th lines differ - expected: '5 4', found: '2 1'