QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#111891#5438. Half MixedSmallBlackWA 160ms3476kbC++141.1kb2023-06-09 07:37:522023-06-09 07:37:56

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-06-09 07:37:56]
  • 评测
  • 测评结果:WA
  • 用时:160ms
  • 内存:3476kb
  • [2023-06-09 07:37:52]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
inline long long read()
{
	long long s=0,k=1;
	char c=getchar();
	while(!isdigit(c))
	{
		k=(c=='-')?-1:1;
		c=getchar();
	}
	while(isdigit(c))
	{
		s=s*10+c-'0';
		c=getchar();
	}
	return s*k;
}
#define d read()
#define ll long long
#define Maxn 10010
#define Size 10010
#define mp make_pair
#define pb push_back
#define fi first
#define se second
vector<ll>ans;
string s;
int main()
{
	ll t=d;
	while(t--)
	{
		ll n=d,m=d;
		if(n*(n+1)/2%2==1&&m*(m+1)/2%2==1)
		{
			puts("No");
			continue;
		}
		bool T=0;
		if(n*(n+1)/2%2==1) swap(n,m),T=1;
		ll cnt=n*(n+1)/4,sum=n;
		ans.clear();
		for(ll tag=n;tag&&sum&&cnt;tag--)
		{
			while(tag*(tag+1)/2<=cnt&&tag<=sum)
			{
				cnt-=tag*(tag+1)/2;
				sum-=tag;
				ans.pb(tag);
			}
			if(cnt==sum)
			{
				for(int i=0;i<cnt;i++) ans.pb(1);
				break;
			}
		}
		s="";
		char ch='0';
		for(int i=0;i<ans.size();i++,ch='0'+'1'-ch)
			for(int j=0;j<ans[i];j++)
				s+=ch;
		puts("Yes");
		if(T) swap(n,m);
		for(int i=0;i<n;i++,putchar('\n'))
			for(int j=0;j<m;j++)
				printf("%c ",s[(T?j:i)]);
	}
}

详细

Test #1:

score: 100
Accepted
time: 2ms
memory: 3360kb

input:

2
2 3
1 1

output:

Yes
0 1 0 
0 1 0 
No

result:

ok OK, Accepted. (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 160ms
memory: 3476kb

input:

5382
1 1
1 2
2 1
1 3
2 2
3 1
1 4
2 3
3 2
4 1
1 5
2 4
3 3
4 2
5 1
1 6
2 5
3 4
4 3
5 2
6 1
1 7
2 6
3 5
4 4
5 3
6 2
7 1
1 8
2 7
3 6
4 5
5 4
6 3
7 2
8 1
1 9
2 8
3 7
4 6
5 5
6 4
7 3
8 2
9 1
1 10
2 9
3 8
4 7
5 6
6 5
7 4
8 3
9 2
10 1
1 11
2 10
3 9
4 8
5 7
6 6
7 5
8 4
9 3
10 2
11 1
1 12
2 11
3 10
4 9
5 8
6 ...

output:

No
No
No
Yes
0 1 0 
No
Yes
0 
1 
0 
Yes
0 0 1 0 
Yes
0 1 0 
0 1 0 
Yes
0 0 
1 1 
0 0 
Yes
0 
0 
1 
0 
No
Yes
0 0 1 0 
0 0 1 0 
Yes
0 0 0 
1 1 1 
0 0 0 
Yes
0 0 
0 0 
1 1 
0 0 
No
No
No
Yes
0 0 0 0 
1 1 1 1 
0 0 0 0 
Yes
0 0 0 
0 0 0 
1 1 1 
0 0 0 
No
No
Yes
0 0 0 0 1 1 0 
No
Yes
0 0 0 0 0 
1 1 1 1 1...

result:

wrong answer 36 Mixed Submatrices Found, but 39 Expected (test case 67)