QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#574770#9308. World CupHelenofssWA 0ms3804kbC++20890b2024-09-19 00:23:492024-09-19 00:23:49

Judging History

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

  • [2024-09-19 00:23:49]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3804kb
  • [2024-09-19 00:23:49]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define For(i,l,r) for(int i=l;i<=r;++i)
#define foR(i,r,l) for(int i=r;i>=l;--i)
#define meme(a,b) memset(a,b,sizeof(a,b))
using namespace std;
const int N = 110;
const int mod = 1e18;
struct mt
{
	int th;
	int id;	
};
bool cmp(mt a,mt b){
	return a.th>b.th;
}
void solve(){
	int n=32;
	std::vector<mt> v(n);
	For(i,0,n-1){
		v[i].id=i+1;
		cin>>v[i].th;
	}
	sort(v.begin(),v.end(),cmp);
	int rk=0;
	For(i,0,n-1){
		if(v[i].id==1){
			rk=i+1;
		}
	}
	if(rk==1){
		cout<<"1\n";
	}else if(rk<=3){
		cout<<"2\n";
	}else if(rk+7<=32){
		cout<<"4\n";
	}else if(rk+6<=32){
		cout<<"8\n";
	}else if(rk!=31&&rk!=32){
		cout<<"16\n";
	}else{
		cout<<"32\n";
	}

}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;cin >> t;
	while (t--) {
	solve();
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3804kb

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

result:

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