QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#575816#9308. World CupniYinWA 0ms3708kbC++17681b2024-09-19 16:53:312024-09-19 16:53:32

Judging History

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

  • [2024-09-19 16:53:32]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3708kb
  • [2024-09-19 16:53:31]
  • 提交

answer

#include <bits/stdc++.h>		

#define fi first
#define se second
#define endl '\n'

using namespace std;
using LL = long long;

const int N = 32 + 9; 
const int mod = 998244353;


int a[N];
int cnt;

void solve()
{

	for (int i = 1;i <= 32;i ++) 
	{
		cin >> a[i];
		if (a[i] <= a[1]) cnt ++;
	}
	if (cnt == 32) cout << 1 << endl;
	else if (cnt >= 31) cout << 2 << endl;
	else if (cnt >= 15) cout << 4 << endl;
	else if (cnt >= 7) cout << 8 << endl;
	else if (cnt >= 3) cout << 16 << endl;
	else cout << 32 << endl;
}

int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _ = 1;
	cin >> _;
	while(_--) solve();
	
	return 0;
}


Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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
16
16
8
4
4
4
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2

result:

wrong answer 2nd numbers differ - expected: '32', found: '16'