QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#171997 | #7178. Bishops | ucup-team1113# | RE | 17ms | 3668kb | C++20 | 1.2kb | 2023-09-09 17:56:02 | 2023-09-09 17:56:03 |
Judging History
answer
#include<bits/stdc++.h>
#define int ll
using namespace std;
#define endl '\n'
typedef long long ll;
signed main()
{
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
//freopen("out.txt", "w", stdout);
int n, m; cin >> n >> m;
assert(min(n, m) <= 100 || max(n, m) > 99990 || max(n, m) == 100000);
bool flag = false;
if (m > n)
flag = true;
if (flag) //m>n
{
swap(m, n);
int x = 0;
if ((n - 1) % m == 0)x = 0;
else
{
x = ((n - 1) / m + 1) * m + 1;
x = m - (x - n) * 2;
x = max(0ll, x);
}
cout << ((n - 1) / m + 1)*m + x << endl;
for (int i = 1; i <= n; i += m)
for (int k = 1; k <= m; k++)
cout << k << " " << i << endl;
if (x)
for (int i = (m - x) / 2 + 1; i <= (m - x) / 2 + x; i++)
cout << i << " " << n << endl;
}
else//n>=m
{
int x = 0;
if ((n - 1) % m == 0)x = 0;
else
{
x = ((n - 1) / m + 1) * m + 1;
x = m - (x - n) * 2;
x = max(0ll, x);
}
cout << ((n - 1) / m + 1)*m + x << endl;
for (int i = 1; i <= n; i += m)
for (int k = 1; k <= m; k++)
cout << i << " " << k << endl; //((n-1)/m+1)*m
if (x)
for (int i = (m - x) / 2 + 1; i <= (m - x) / 2 + x; i++)
cout << n << " " << i << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
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: 2ms
memory: 3656kb
input:
5 5
output:
8 1 1 1 2 1 3 1 4 1 5 5 2 5 3 5 4
result:
ok n: 5, m: 5, bishops: 8
Test #3:
score: 0
Accepted
time: 15ms
memory: 3664kb
input:
100000 100000
output:
199998 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:
ok n: 100000, m: 100000, bishops: 199998
Test #4:
score: 0
Accepted
time: 17ms
memory: 3668kb
input:
100000 99999
output:
199998 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:
ok n: 100000, m: 99999, bishops: 199998
Test #5:
score: 0
Accepted
time: 15ms
memory: 3592kb
input:
100000 50000
output:
149998 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:
ok n: 100000, m: 50000, bishops: 149998
Test #6:
score: 0
Accepted
time: 5ms
memory: 3588kb
input:
1 100000
output:
100000 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:
ok n: 1, m: 100000, bishops: 100000
Test #7:
score: -100
Dangerous Syscalls
input:
34535 99889