QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#570460#9308. World CupAceTaffy258WA 0ms3672kbC++201.4kb2024-09-17 15:56:342024-09-17 15:56:35

Judging History

This is the latest submission verdict.

  • [2024-09-17 15:56:35]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3672kb
  • [2024-09-17 15:56:34]
  • Submitted

answer

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

int a[40];
int b[20];
int c[10];
int d[5];
int e[5];
bool cmp(int x,int y){
	return x>y;
}
int main(){
	std::ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int T;cin>>T;
	while(T--){
		for(int i=1;i<=32;i++){
			cin>>a[i];
		}
		int chn=a[1];
		for(int i=1;i<=8;i++){
			sort(a+(i-1)*4+1,a+i*4+1,cmp);
			for(int j=1;j<=2;j++){
				b[(i-1)*2+j]=a[(i-1)*4+j];
			}
		}
		for(int i=1;i<=4;i++){
			c[i]=max(b[4*(i-1)+1],b[4*(i-1)+4]);
			c[i+4]=max(b[4*(i-1)+2],b[4*(i-1)+3]);
		}
		for(int i=1;i<=4;i++){
			d[i]=max(c[2*i-1],c[2*i]);
		}
		e[1]=max(d[1],d[2]);
		e[2]=max(d[3],d[4]);
		/*for(int i=1;i<=32;i++){
			cout<<a[i]<<' ';
		}cout<<endl;
		for(int i=1;i<=16;i++){
			cout<<b[i]<<' ';
		}cout<<endl;
		for(int i=1;i<=8;i++){
			cout<<c[i]<<' ';
		}cout<<endl;
		for(int i=1;i<=4;i++){
			cout<<d[i]<<' ';
		}cout<<endl;*/
		if(chn==max(e[1],e[2])){
			cout<<1<<endl;
		}
		else if(chn==e[1]||chn==e[2]){
			cout<<2<<endl;
		}
		else if(chn==d[1]||chn==d[2]||chn==d[3]||chn==d[4]){
			cout<<4<<endl;
		}
		else{
			int flag=0;
			for(int i=1;i<=8;i++){
				if(c[i]==chn){
					flag=1;break;
				}
			}
			if(flag){
				cout<<8<<endl;
			}
			else{
				for(int i=1;i<=16;i++){
					if(b[i]==chn){
						flag=1;break;
					}
				}
				if(flag){
					cout<<16<<endl;
				}
				else{
					cout<<32<<endl;
				}
			}
		}
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3672kb

input:

1
32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1

output:

1

result:

ok 1 number(s): "1"

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3600kb

input:

32
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
3 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
4 1 2 3 5 6 7 8 9 10 11 12 13 14 15 ...

output:

32
32
16
16
16
16
8
8
8
8
8
8
8
8
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
2
1

result:

wrong answer 14th numbers differ - expected: '4', found: '8'