QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#817972 | #6475. Cunning Friends | TG178X | WA | 0ms | 3688kb | C++14 | 615b | 2024-12-17 15:18:46 | 2024-12-17 15:18:50 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int maxn=1e5+5;
string Alice="Win\n",Bob="Lose\n";
int test,n,a[maxn];
int main(){
// freopen("stone.in","r",stdin);
// freopen("sone.out","w",stdout);
cin.tie(nullptr)->sync_with_stdio(false);
for(cin>>test;test--;){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
if(n==1) cout<<Alice;
else{
sort(a+1,a+n+1,[](int x,int y)->bool{ return x>y; });
if(n%3==2) cout<<(a[2]==1?Alice:Bob);
else if(n%3==0) cout<<(a[3]==1&&a[2]==2||a[2]==1&&a[1]>1?Alice:Bob);
else cout<<(a[2]==1||a[2]==2&&a[3]==1?Alice:Bob);
}
}
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3688kb
input:
3 2 2 1
output:
Win Win Win
result:
wrong output format Extra information in the output file