QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#568839 | #9308. World Cup | felixcc | WA | 0ms | 3720kb | C++17 | 1.0kb | 2024-09-16 18:45:43 | 2024-09-16 18:45:43 |
Judging History
answer
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define rep(i,x,y) for(ll i=x;i<=y;++i)
#define per(i,x,y) for(ll i=x;i>=y;--i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll a[50],n;
inline ll in()
{
ll res=0,f=1;
char ch;
while((ch=getchar())<'0'||ch>'9')
if(ch=='-') f=-1;
res=res*10+ch-'0';
while((ch=getchar())>='0'&&ch<='9')
res=res*10+ch-'0';
return res*f;
}
inline void put(ll x)
{
if(x<0) putchar('-'),x*=-1;
if(x>9) put(x/10);
putchar(x%10+48);
}
int main()
{
n=in();
rep(i,1,n)
{
ll rank=0;
rep(j,1,32)
{
a[i]=in();
if(i>1)
if(a[i]>a[1])
++rank;
++rank;
if(rank==1) printf("1\n");
else if(rank>=2&&rank<=5) printf("2\n");
else if(rank>=6&&rank<=19) printf("4\n");
else if(rank>=20&&rank<=25) printf("8\n");
else if(rank>=26&&rank<=29) printf("16\n");
else printf("32\n") ;
}
}
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3720kb
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 2 2 2 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8 8 8 8 8 8 16 16 16 16 32 32 32
result:
wrong answer Output contains longer sequence [length = 32], but answer contains 1 elements