QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#577165 | #9308. World Cup | yuhenghe | WA | 0ms | 3780kb | C++14 | 625b | 2024-09-20 08:41:32 | 2024-09-20 08:41:33 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define pil pair<int,int>
#define fi first
#define se second
void solve()
{
vector<pil> a(33);
for(int i=1;i<=32;i++)
{
cin>>a[i].fi;
a[i].se =i;
}
sort(a.begin()+1,a.end());
int b;
for(int i=1;i<=32;i++) if(a[i].se==1)
{
b = i;
break;
}
if(b<3) cout<<32<<"\n";
else if(b<7) cout<<16<<"\n";
else if(b<15) cout<<8<<"\n";
else if(b<29) cout<<4<<"\n";
else if(b<32) cout<<2<<"\n";
else if(b==32) cout<<1<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0) ,cout.tie(0);
int t;
cin>>t;
while(t--)solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3752kb
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: 3780kb
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 8 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 1
result:
wrong answer 14th numbers differ - expected: '4', found: '8'