QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #575622 | #9308. World Cup | keepice | WA | 1ms | 3712kb | C++14 | 771b | 2024-09-19 15:56:03 | 2024-09-19 15:56:04 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int t;
int ans=32;
int team[35]={0};
int newteam[20]={0};
int match(int nums){
if(nums==1)return 1;
for(int i=1;i<=nums/2;i++){
if(i==1){
if(newteam[1]<newteam[2]){
return nums;
}
}
newteam[i]=newteam[2*i-1]>newteam[2*i]?newteam[2*i-1]:newteam[2*i];
}
return match(nums/2);
}
void startgame(){
if(team[1]<team[4]){
cout<<32<<endl;
return;
}
for(int i=1;i<=8;i++){
newteam[i]=team[4*i-3]>team[4*i]?team[4*i-3]:team[4*i];
}
for(int i=1;i<=8;i++){
newteam[i+8]=team[4*i-2]>team[4*i-1]?team[4*i-2]:team[4*i-1];
}
cout<<match(16)<<endl;
}
int main(){
cin>>t;
while(t--){
for(int i=1;i<=32;i++){
cin>>team[i];
}
startgame();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3664kb
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: 1ms
memory: 3712kb
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 16 16 16 16 8 8 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 1
result:
wrong answer 3rd numbers differ - expected: '16', found: '32'