QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#576673#9308. World CupAa#TL 0ms0kbC++141.2kb2024-09-19 21:31:042024-09-19 21:31:04

Judging History

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

  • [2024-09-19 21:31:04]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:0kb
  • [2024-09-19 21:31:04]
  • 提交

answer

#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
int a[32];
PII get(int l,int r){
	int mx1=0,mx2=0;
	for(int i=l;i<=r;i++){
		if(a[i]>mx1){
			mx2=mx1;
			mx1=a[i];
		}
		else if(a[i]>mx2) mx2=a[i];
	}
	return {mx1,mx2};
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int t;
	cin >> t;
	while(t--){
		int mx=0;
		for(int i=1;i<=32;i++){
			cin >> a[i];
			mx=max(mx,a[i]);
		}
		PII A=get(1,4),B=get(5,8),C=get(9,12),D=get(13,16),E=get(17,20),F=get(21,24),G=get(25,28),H=get(29,32);
		if(a[1]<A.second) cout << "32" << endl;
		else{
			if(a[1]==A.first){
				if(a[1]<B.second) cout << "16" << endl;
				else if(a[1]<max(C.first,D.second)) cout << "8" << endl;
				else if(a[1]<max(max(E.first,F.second),max(G.first,H.second))) cout << "4" << endl;
				else if(a[1]<mx) cout << "2" << endl;
				else cout << "1" << endl;
			}
			else{
				if(a[1]<B.first) cout << "16" << endl;
				else if(a[1]<max(C.second,D.first)) cout << "8" << endl;
				else if(a[1]<max(max(E.second,F.first),max(G.second,H.first))) cout << "4" << endl;
				else if(a[1]<mx) cout << "2" << endl;
				else cout << "1" << endl;
			}
		}
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Time Limit Exceeded

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:


result: