QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#199719#4486. Bragging Diceyiyiyi#AC ✓0ms3588kbC++14895b2023-10-04 13:50:022023-10-04 13:50:02

Judging History

你现在查看的是最新测评结果

  • [2023-10-04 13:50:02]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3588kb
  • [2023-10-04 13:50:02]
  • 提交

answer

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define int long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=2e5+5;
const int mod=998244353;
inline int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}
int T;
int a[maxn];
signed main()
{
	T=read();
	while(T--)
	{
		int n=read();
		rep(i,1,n) a[i]=read();
		puts("Win!");
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3588kb

input:

30
5
4 6 4 1 2
3 6 6 2 3
5
6 4 5 1 2
5 2 4 6 4
10
6 4 6 3 5 3 1 6 4 5
6 4 3 1 3 4 5 1 6 2
10
3 4 6 3 4 6 3 5 6 4
6 3 5 1 3 2 5 5 6 3
100000
1 6 4 4 2 6 5 1 4 3 4 5 1 4 6 3 1 3 4 5 1 1 5 3 3 6 5 4 6 6 3 1 2 5 6 3 2 3 1 3 3 2 1 1 4 6 4 6 6 3 4 3 2 3 1 3 1 1 1 5 4 5 3 1 2 3 3 6 2 5 6 5 5 3 4 2 2 5 4 5 ...

output:

Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!
Win!

result:

ok 30 lines