QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#547813#8820. Exchanging Kubic 2mengzddWA 0ms3736kbC++11875b2024-09-05 10:41:012024-09-05 10:41:03

Judging History

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

  • [2024-09-05 10:41:03]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3736kb
  • [2024-09-05 10:41:01]
  • 提交

answer

#include <bits/stdc++.h>
#define FOR(i,j,k) for(int i=j;i<=k;++i)
#define NFOR(i,j,k) for(int i=j;i>=k;--i)
#define mkp make_pair
#define fst first
#define sec second
#define inl inline
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair< int,int > pii;
const int N=805,mod=998244353;
inline int read()
{
	int s=0,w=1; char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') w=-1; ch=getchar();}
	while(ch>='0'&&ch<='9') {s=(s<<1)+(s<<3)+ch-'0',ch=getchar();}
	return s*w;
}
void file()
{
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
}
void teltim(int x)
{
	clock_t c1=0;
	if(x) c1=clock();
	else cerr<<endl<<clock()-c1<<"ms"<<endl;
}

int n;
vector <int> sto[N];

int main()
{
	//file();
	n=read();
	FOR(i,1,n)
	{
		int k=read();
		if(k==0)
		{
			printf("0");
			return 0;
		}
		FOR(j,1,k) sto[i].push_back(read());
	}
	
	return 0;
}

詳細信息

Test #1:

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

input:

5
3 1 2 3
1 2
0
4 0 2 3 4
2 2 3

output:

0

result:

ok "0"

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3644kb

input:

5
4 1 2 3 7
4 5 7 8 9
4 2 3 6 9
5 0 1 4 7 9
8 0 1 2 3 6 7 8 9

output:


result:

wrong answer Unexpected EOF in the participants output