QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #538918 | #7178. Bishops | Max_FWL | WA | 52ms | 5300kb | C++14 | 1.1kb | 2024-08-31 13:34:49 | 2024-08-31 13:34:50 |
Judging History
answer
#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
int n, m, fl = 0;
vector<pii> ans;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
ans.clear();
if (n > m){
swap(n, m);
fl = 1;
}
if (n == 1){
for (int i = 1; i <= m; i++)
ans.push_back(mp(1, i));
}if (n == m){
for (int i = 1; i <= n; i++)
ans.push_back(mp(i, 1));
for (int i = 2; i < n; i++)
ans.push_back(mp(i, m));
}else{
for (int i = 1; i <= n; i++){
ans.push_back(mp(i, 1));
ans.push_back(mp(i, m));
}
if (n & 1){
for (int i = (n >> 1) + 2; i <= m - (n >> 1) - 1; i++)
ans.push_back(mp(i, (n + 1) >> 1));
}else{
for (int i = (n >> 1) + 2; i <= m - (n >> 1) - 1; i += 2){
ans.push_back(mp(n >> 1, i));
ans.push_back(mp((n >> 1) + 1, i));
}
}
}
cout << ans.size() << endl;
for (auto pos : ans)
cout << (fl ? pos.se : pos.fi) << " " << (fl ? pos.fi : pos.se) << endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
2 5
output:
6 1 1 1 5 2 1 2 5 1 3 2 3
result:
ok n: 2, m: 5, bishops: 6
Test #2:
score: 0
Accepted
time: 0ms
memory: 3572kb
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: 40ms
memory: 5292kb
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: 0
Accepted
time: 52ms
memory: 5144kb
input:
100000 99999
output:
199998 1 1 100000 1 1 2 100000 2 1 3 100000 3 1 4 100000 4 1 5 100000 5 1 6 100000 6 1 7 100000 7 1 8 100000 8 1 9 100000 9 1 10 100000 10 1 11 100000 11 1 12 100000 12 1 13 100000 13 1 14 100000 14 1 15 100000 15 1 16 100000 16 1 17 100000 17 1 18 100000 18 1 19 100000 19 1 20 100000 20 1 21 100000...
result:
ok n: 100000, m: 99999, bishops: 199998
Test #5:
score: 0
Accepted
time: 32ms
memory: 5300kb
input:
100000 50000
output:
149998 1 1 100000 1 1 2 100000 2 1 3 100000 3 1 4 100000 4 1 5 100000 5 1 6 100000 6 1 7 100000 7 1 8 100000 8 1 9 100000 9 1 10 100000 10 1 11 100000 11 1 12 100000 12 1 13 100000 13 1 14 100000 14 1 15 100000 15 1 16 100000 16 1 17 100000 17 1 18 100000 18 1 19 100000 19 1 20 100000 20 1 21 100000...
result:
ok n: 100000, m: 50000, bishops: 149998
Test #6:
score: -100
Wrong Answer
time: 35ms
memory: 5232kb
input:
1 100000
output:
200000 1 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 ...
result:
wrong answer Integer parameter [name=q] equals to 200000, violates the range [0, 100001]