QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#263574#6189. Full Clue ProblemCrysflyWA 0ms3628kbC++171.1kb2023-11-24 23:05:562023-11-24 23:05:57

Judging History

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

  • [2023-11-24 23:05:57]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3628kb
  • [2023-11-24 23:05:56]
  • 提交

answer

// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int n,a[25][25],b[25][25],c[25][25];

signed main()
{
	n=read();
	c[0][0]=2,c[0][1]=3;
	c[1][0]=3,c[1][1]=2;
	a[0][0]=a[0][1]=a[1][0]=1;
	b[1][1]=b[0][1]=b[1][0]=1;
	For(i,0,n-1)For(j,0,n-1)cout<<c[i][j]<<" \n"[j==n-1];
	For(i,0,n-1)For(j,0,n-1)cout<<a[i][j]<<" \n"[j==n-1];
	For(i,0,n-1)For(j,0,n-1)cout<<b[i][j]<<" \n"[j==n-1];
    return 0;
}
/*

*/

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3628kb

input:

5

output:

2 3 0 0 0
3 2 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
1 1 0 0 0
1 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 1 0 0 0
1 1 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0

result:

wrong answer (0, 2) doesn't satisfy with clues