QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#188155 | #7178. Bishops | LroseC | WA | 17ms | 4560kb | C++14 | 1.1kb | 2023-09-25 15:58:26 | 2023-09-25 15:58:26 |
Judging History
answer
#include <vector>
#include <cctype>
#include <cstdio>
#include <cstdint>
#include <algorithm>
using i32 = int32_t;
using i64 = int64_t;
struct FSI
{
template<typename T>
FSI& operator>>(T &res)
{
res = 0; T f = 1; char ch = getchar();
while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
while (isdigit(ch)) { res = res * 10 + (ch - '0') * f; ch = getchar(); }
return *this;
}
} read;
int main(void)
{
//Think tiwce, code once.
i32 n, m;
read >> n >> m;
bool flag = n < m;
std::vector<std::pair<i32, i32>> res;
for (i32 i = 1; i <= std::max(n, m); i += std::min(n, m)) {
for (i32 j = 1; j <= std::min(n, m); ++j) {
i32 a = i, b = j;
if (flag) std::swap(a, b);
res.emplace_back(a, b);
}
if (i + std::min(n, m) > std::max(n, m)) {
i32 gap = std::max(n, m) - i + 1;
i32 tmp = std::min(n, m) - gap + 1;
for (i32 j = 1 + tmp; j <= n - tmp; ++j) {
i32 a = n, b = j;
if (flag) std::swap(a, b);
res.emplace_back(a, b);
}
}
}
printf("%d\n", res.size());
for (auto t : res) {
printf("%d %d\n", t.first, t.second);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3096kb
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: 0ms
memory: 2952kb
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: 12ms
memory: 4456kb
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: 8ms
memory: 4448kb
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: -100
Wrong Answer
time: 17ms
memory: 4560kb
input:
100000 50000
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:
wrong answer Integer parameter [name=q] equals to 199998, violates the range [0, 150000]