QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #575385 | #9308. World Cup | qiang9 | WA | 0ms | 3688kb | C++17 | 1.0kb | 2024-09-19 13:35:17 | 2024-09-19 13:35:17 |
Judging History
answer
#include<bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using ari = std::array<int, 3>;
using PII = std::pair<int, int>;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-6;
int a[N],b[N];
void solve() {
for(int i=1;i<=32;i++)
{
std::cin>>a[i];
b[i]=a[i];
}
std::sort(a+1,a+1+32);
ll cnt=0;
int rk=0;
for(int i=1;i<=32;i++)
{
if(b[i]==a[1]) rk=i;
}
if(rk==32){
std::cout<<1<<'\n';
}else {
if(rk==31){
std::cout<<2<<'\n';
}else{
if(rk>16) std::cout<<4<<'\n';
else{
if(rk>8) std::cout<<8<<'\n';
else{
if(rk>2) std::cout<<16<<'\n';
else std::cout<<32<<'\n';
}
}
}
}
}
signed main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
int t = 1;
std::cin>>t;
while (t--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
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: 3688kb
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'