QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #446131 | #7637. Exactly Three Neighbors | _l_l_ | AC ✓ | 1ms | 3960kb | C++14 | 1.1kb | 2024-06-16 22:20:38 | 2024-06-16 22:20:39 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
int p, q; scanf("%d %d", &p, &q);
if (p * 5 > q * 4) puts("-1 -1");
if (p * 3 <= q * 2) {
printf("%d %d\n", 1, 2 * q);
for (int i = 0; i < 2 * q; i++) putchar("#."[i % 3 == 0 || i >= 3 * p]);
}
if (p == 3 && q == 4) {
puts("4 4");
puts("###.");
puts("###.");
puts("#.##");
puts("#.##");
}
if (p == 4 && q == 5) {
puts("5 5");
puts(".####");
puts("###.#");
puts("#.###");
puts("####.");
puts("##.##");
}
if (p == 5 && q == 7) {
puts("14 4");
puts("#..#");
puts("#..#");
puts("####");
puts(".##.");
puts("####");
puts("#..#");
puts("####");
puts(".##.");
puts(".##.");
puts("####");
puts("#..#");
puts("####");
puts(".##.");
puts("####");
}
if (p == 7 && q == 9) {
puts("6 18");
puts("##.####.####.##.##");
puts(".####.####.####.##");
puts(".##.####.####.####");
puts("###.##.####.####.#");
puts("#.####.##.####.###");
puts("####.####.##.####.");
}
if (p == 7 && q == 10) {
puts("4 5");
puts("####.");
puts("####.");
puts("#..##");
puts("#..##");
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3876kb
input:
2 3
output:
1 6 .##.##
result:
ok good solution
Test #2:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
1 1
output:
-1 -1
result:
ok no solution
Test #3:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
3 4
output:
4 4 ###. ###. #.## #.##
result:
ok good solution
Test #4:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
3 5
output:
1 10 .##.##.##.
result:
ok good solution
Test #5:
score: 0
Accepted
time: 1ms
memory: 3824kb
input:
4 5
output:
5 5 .#### ###.# #.### ####. ##.##
result:
ok good solution
Test #6:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
7 10
output:
4 5 ####. ####. #..## #..##
result:
ok good solution
Test #7:
score: 0
Accepted
time: 0ms
memory: 3744kb
input:
5 7
output:
14 4 #..# #..# #### .##. #### #..# #### .##. .##. #### #..# #### .##. ####
result:
ok good solution
Test #8:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
7 9
output:
6 18 ##.####.####.##.## .####.####.####.## .##.####.####.#### ###.##.####.####.# #.####.##.####.### ####.####.##.####.
result:
ok good solution
Test #9:
score: 0
Accepted
time: 0ms
memory: 3872kb
input:
0 1
output:
1 2 ..
result:
ok good solution
Test #10:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
1 2
output:
1 4 .##.
result:
ok good solution
Test #11:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
1 3
output:
1 6 .##...
result:
ok good solution
Test #12:
score: 0
Accepted
time: 1ms
memory: 3868kb
input:
1 4
output:
1 8 .##.....
result:
ok good solution
Test #13:
score: 0
Accepted
time: 1ms
memory: 3868kb
input:
1 5
output:
1 10 .##.......
result:
ok good solution
Test #14:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
1 6
output:
1 12 .##.........
result:
ok good solution
Test #15:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
1 7
output:
1 14 .##...........
result:
ok good solution
Test #16:
score: 0
Accepted
time: 1ms
memory: 3780kb
input:
1 8
output:
1 16 .##.............
result:
ok good solution
Test #17:
score: 0
Accepted
time: 0ms
memory: 3956kb
input:
1 9
output:
1 18 .##...............
result:
ok good solution
Test #18:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
1 10
output:
1 20 .##.................
result:
ok good solution
Test #19:
score: 0
Accepted
time: 0ms
memory: 3960kb
input:
2 5
output:
1 10 .##.##....
result:
ok good solution
Test #20:
score: 0
Accepted
time: 1ms
memory: 3932kb
input:
2 7
output:
1 14 .##.##........
result:
ok good solution
Test #21:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
2 9
output:
1 18 .##.##............
result:
ok good solution
Test #22:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
3 7
output:
1 14 .##.##.##.....
result:
ok good solution
Test #23:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
3 8
output:
1 16 .##.##.##.......
result:
ok good solution
Test #24:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
3 10
output:
1 20 .##.##.##...........
result:
ok good solution
Test #25:
score: 0
Accepted
time: 0ms
memory: 3884kb
input:
4 7
output:
1 14 .##.##.##.##..
result:
ok good solution
Test #26:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
4 9
output:
1 18 .##.##.##.##......
result:
ok good solution
Test #27:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
5 6
output:
-1 -1
result:
ok no solution
Test #28:
score: 0
Accepted
time: 0ms
memory: 3872kb
input:
5 8
output:
1 16 .##.##.##.##.##.
result:
ok good solution
Test #29:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
5 9
output:
1 18 .##.##.##.##.##...
result:
ok good solution
Test #30:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
6 7
output:
-1 -1
result:
ok no solution
Test #31:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
7 8
output:
-1 -1
result:
ok no solution
Test #32:
score: 0
Accepted
time: 0ms
memory: 3744kb
input:
8 9
output:
-1 -1
result:
ok no solution
Test #33:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
9 10
output:
-1 -1
result:
ok no solution
Extra Test:
score: 0
Extra Test Passed