QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #566025 | #9308. World Cup | CRN2010 | WA | 0ms | 3676kb | C++20 | 955b | 2024-09-15 22:54:12 | 2024-09-15 22:54:12 |
Judging History
answer
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector")
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
using namespace std ;
const int inf = 0x3f3f3f3f ;
const int LLinf = 0x3f3f3f3f3f3f3f3f ;
int a[40] ;
void solve()
{
for(int i = 0 ; i < 32 ; ++ i) {
cin >> a[i] ;
}
int k = a[1] ;
sort(a + 1 , a + 32) ;
int it = upper_bound(a + 1 , a + 31 , k) - a ;
if ( it <= 2 ) {
cout << 32 << '\n' ;
} else if ( it <= 5 ) {
cout << 16 << '\n' ;
} else if ( it <= 12 ) {
cout << 8 << '\n' ;
} else if ( it <= 26 ) {
cout << 4 << '\n' ;
} else if ( it <= 30 ) {
cout << 2 << '\n' ;
} else if ( it <= 31 ) {
cout << 1 << '\n' ;
}
}
signed main()
{
cin.tie(nullptr)->ios::sync_with_stdio(false) ;
int t = 1 ;
cin >> t ;
for(int i = 1 ; i <= t ; i++)
{
// cout << "case #" << i << " : " << '\n' ;
solve() ;
}
return 0 ;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3676kb
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: 3572kb
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 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32 32
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'