QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#572747#9308. World Cup2023417207WA 1ms3672kbC++141021b2024-09-18 16:12:572024-09-18 16:13:01

Judging History

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

  • [2024-09-18 16:13:01]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3672kb
  • [2024-09-18 16:12:57]
  • 提交

answer

#include<iostream>
#include<string>
#include<math.h>
#include<algorithm>
using namespace std;

void slove(){
	
	int a[32];
	
	for(int i=0;i<32;i++){
		cin>>a[i];
		
	}
	int n=a[0];
	sort(a+1,a+n);
//	for(int i=0;i<32;i++){
//		cout<<a[i]<<" ";
////		if(a[i]==n){
////			a[i]=a[0];
////			a[0]=n;
////			break;
////		}
//	}
	int f16[8][2];
	int f8[8];
	int f4[4];
	int f2[2];
	int f;
	if(n<a[2]){
		cout<<32<<endl;
		return ;
	}
	if(a[3]>n){
		f16[0][0]=a[3];
		f16[0][1]=n;
	}
	else{
		f16[0][0]=n;
		f16[0][1]=a[3];
	}
	
	f16[1][0]=a[7];
	f16[1][1]=a[6];
	
	f8[0]=max(f16[0][0],f16[1][1]);
	f8[1]=max(f16[0][1],f16[1][0]);
	
	if(f8[0]!=n&&f8[1]!=n){
		cout<<16<<endl;
		return ;
	}
	
	if(a[14]>n){
		cout<<8<<endl;
		return ;
	}
	if(a[15]>n){
		cout<<4<<endl;
		return ;
	}
	if(a[30]>n){
		cout<<2<<endl;
		return ;
	}
	if(a[31]<n){
		cout<<1<<endl;
		return ;
	}
	
	
} 

int main(){
	int t;
	cin>>t;
	while(t--){
	slove();	
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
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: 1ms
memory: 3588kb

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
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1

result:

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