QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#608443#5438. Half MixedLittleYooWA 46ms3876kbC++201.1kb2024-10-03 21:56:532024-10-03 21:56:54

Judging History

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

  • [2024-10-03 21:56:54]
  • 评测
  • 测评结果:WA
  • 用时:46ms
  • 内存:3876kb
  • [2024-10-03 21:56:53]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
// #define int long long
using ll = long long;

void solve()
{
	int n, m;
	cin >> n >> m;
	if(1ll * n * m * (n + 1) * (m + 1) % 8 != 0) {
		cout << "No\n";
		return ;
	}

	cout << "Yes\n";

	bool horizon = 1;
	if(1ll * m * (m + 1) % 4 != 0) {
		swap(n, m);
		horizon = 0;
	}
	ll tar = 1ll * (m + 1) * m / 4 - m;
	int rem = m, cur = 0;
	string s;
	bool now = 1;
	while(rem) {
		// assert(tar - cur - rem >= 0);
		int l = 1, r = m + 1;
		while(l < r - 1) {
			int mid = l + r >> 1;
			if(1ll * mid * (mid - 1) / 2 + cur <= tar)
				l = mid;
			else
				r = mid;
		}

		for(int i = 0; i < l; ++i)
			s += '0' + now;
		now ^= 1;

		rem -= l;
		cur += 1ll * l * l;
	}

	
	if(horizon) {
		for(int i = 0; i < n; ++i) {
			for(auto &c : s)
				cout << c << ' ';
			cout << '\n';
		}
	} else {
		for(auto &c : s) {
			for(int i = 0; i < n; ++i)
				cout << c << " \n"[i == n - 1];
		}
	}
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	cin >> T;
	while(T--)
		solve();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
2 3
1 1

output:

Yes
1 0 1 
1 0 1 
No

result:

ok OK, Accepted. (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 46ms
memory: 3620kb

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
1 0 1 
No
Yes
1
0
1
Yes
1 1 0 1 
Yes
1 0 1 
1 0 1 
Yes
1 1
0 0
1 1
Yes
1
1
0
1
No
Yes
1 1 0 1 
1 1 0 1 
Yes
1 0 1 
1 0 1 
1 0 1 
Yes
1 1
1 1
0 0
1 1
No
No
No
Yes
1 1 0 1 
1 1 0 1 
1 1 0 1 
Yes
1 0 1 
1 0 1 
1 0 1 
1 0 1 
No
No
Yes
1 1 1 1 0 1 0 
No
Yes
1 1 1 1 1
0 0 0 0 0
1 1 1 1 1
Yes
...

result:

wrong answer 15 Mixed Submatrices Found, but 14 Expected (test case 22)