QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#172965#7178. Bishopsucup-team298#WA 23ms5224kbC++23767b2023-09-09 21:26:082023-09-09 21:26:09

Judging History

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

  • [2023-09-09 21:26:09]
  • 评测
  • 测评结果:WA
  • 用时:23ms
  • 内存:5224kb
  • [2023-09-09 21:26:08]
  • 提交

answer

#include <bits/stdc++.h>
signed main ()
{
	std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);
	int n, m, f = 0; std::cin >> n >> m;
	if (n > m) std::swap(n, m), f = 1;
	std::vector<std::pair<int, int>> ans;
	if (n == 1) for (int i = 1; i <= m; i++) ans.emplace_back(1, i);
	else
	{
		int o = 0;
		for (int i = 1; i <= m; i += n - 1, o ^= 1)
			for (int j = 1 + o; j <= n - o; j++) ans.emplace_back(j, i);
		if ((m - 1) % (n - 1))
		{
			int l = n - o - (m - 1) % (n - 1), r = 1 + o + (m - 1) % n - 1;
			for (int j = l + 1; j <= r - 1; j++) ans.emplace_back(j, m);
		}
	}
	std::cout << ans.size() << '\n';
	for (auto [u, v]: ans) if (f) std::swap(u, v);
	for (auto [u, v]: ans) std::cout << u << " " << v << "\n";
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3536kb

input:

2 5

output:

6
1 1
2 1
1 3
2 3
1 5
2 5

result:

ok n: 2, m: 5, bishops: 6

Test #2:

score: 0
Accepted
time: 1ms
memory: 3464kb

input:

5 5

output:

8
1 1
2 1
3 1
4 1
5 1
2 5
3 5
4 5

result:

ok n: 5, m: 5, bishops: 8

Test #3:

score: 0
Accepted
time: 16ms
memory: 5224kb

input:

100000 100000

output:

199998
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 1
46 1
47 1
48 1
49 1
50 1
51 1
52 1
53 1
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61...

result:

ok n: 100000, m: 100000, bishops: 199998

Test #4:

score: -100
Wrong Answer
time: 23ms
memory: 5184kb

input:

100000 99999

output:

199996
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 1
46 1
47 1
48 1
49 1
50 1
51 1
52 1
53 1
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61...

result:

wrong answer Participant's answer is not optimal (199996 < 199998)