QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#408617 | #7637. Exactly Three Neighbors | feather_life | AC ✓ | 1ms | 3676kb | C++14 | 1.8kb | 2024-05-10 20:07:44 | 2024-05-10 20:07:45 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int p,q;
cin >> p >> q;
if(p * 3 <= q * 2)
{
int w = q * 2,c = p * 2;
cout << 1 << " " << w << '\n';
while(c)
{
cout << "##.";
c -= 2;
w -= 3;
}
while(w)
{
cout << '.';
w--;
}
}
else if(p == 4 && q == 5)
{
cout << "5 5\n";
puts(".####");
puts("##.##");
puts("####.");
puts("#.###");
puts("###.#");
}
else if(p == 7 && q == 10)
{
cout << "5 4\n";
puts(".##.");
puts("####");
puts("#..#");
puts("####");
puts(".##.");
}
else if(p == 7 && q == 9)
{
cout << "18 6\n";
puts("..####");
puts("###.##");
puts("#####.");
puts("#..###");
puts("####.#");
puts(".#####");
puts("##..##");
puts("#####.");
puts("#.####");
puts("###..#");
puts(".#####");
puts("##.###");
puts("####..");
puts("#.####");
puts("###.##");
puts(".####.");
puts("##.###");
puts("####.#");
}
else if(p == 3 && q == 4)
{
cout << "4 4\n";
puts("..##");
puts("####");
puts("##..");
puts("####");
}
else if(p == 5 && q == 7)
{
cout << "7 6\n";
puts("##..##");
puts(".####.");
puts("######");
puts("#....#");
puts("######");
puts(".####.");
puts("##..##");
}
else cout << "-1 -1";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3556kb
input:
2 3
output:
1 6 ##.##.
result:
ok good solution
Test #2:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
1 1
output:
-1 -1
result:
ok no solution
Test #3:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
3 4
output:
4 4 ..## #### ##.. ####
result:
ok good solution
Test #4:
score: 0
Accepted
time: 1ms
memory: 3508kb
input:
3 5
output:
1 10 ##.##.##..
result:
ok good solution
Test #5:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
4 5
output:
5 5 .#### ##.## ####. #.### ###.#
result:
ok good solution
Test #6:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
7 10
output:
5 4 .##. #### #..# #### .##.
result:
ok good solution
Test #7:
score: 0
Accepted
time: 1ms
memory: 3672kb
input:
5 7
output:
7 6 ##..## .####. ###### #....# ###### .####. ##..##
result:
ok good solution
Test #8:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
7 9
output:
18 6 ..#### ###.## #####. #..### ####.# .##### ##..## #####. #.#### ###..# .##### ##.### ####.. #.#### ###.## .####. ##.### ####.#
result:
ok good solution
Test #9:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
0 1
output:
1 2 ..
result:
ok good solution
Test #10:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
1 2
output:
1 4 ##..
result:
ok good solution
Test #11:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
1 3
output:
1 6 ##....
result:
ok good solution
Test #12:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
1 4
output:
1 8 ##......
result:
ok good solution
Test #13:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
1 5
output:
1 10 ##........
result:
ok good solution
Test #14:
score: 0
Accepted
time: 0ms
memory: 3516kb
input:
1 6
output:
1 12 ##..........
result:
ok good solution
Test #15:
score: 0
Accepted
time: 1ms
memory: 3552kb
input:
1 7
output:
1 14 ##............
result:
ok good solution
Test #16:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
1 8
output:
1 16 ##..............
result:
ok good solution
Test #17:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
1 9
output:
1 18 ##................
result:
ok good solution
Test #18:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
1 10
output:
1 20 ##..................
result:
ok good solution
Test #19:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
2 5
output:
1 10 ##.##.....
result:
ok good solution
Test #20:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
2 7
output:
1 14 ##.##.........
result:
ok good solution
Test #21:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
2 9
output:
1 18 ##.##.............
result:
ok good solution
Test #22:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
3 7
output:
1 14 ##.##.##......
result:
ok good solution
Test #23:
score: 0
Accepted
time: 1ms
memory: 3524kb
input:
3 8
output:
1 16 ##.##.##........
result:
ok good solution
Test #24:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
3 10
output:
1 20 ##.##.##............
result:
ok good solution
Test #25:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
4 7
output:
1 14 ##.##.##.##...
result:
ok good solution
Test #26:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
4 9
output:
1 18 ##.##.##.##.......
result:
ok good solution
Test #27:
score: 0
Accepted
time: 1ms
memory: 3616kb
input:
5 6
output:
-1 -1
result:
ok no solution
Test #28:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
5 8
output:
1 16 ##.##.##.##.##..
result:
ok good solution
Test #29:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
5 9
output:
1 18 ##.##.##.##.##....
result:
ok good solution
Test #30:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
6 7
output:
-1 -1
result:
ok no solution
Test #31:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
7 8
output:
-1 -1
result:
ok no solution
Test #32:
score: 0
Accepted
time: 1ms
memory: 3672kb
input:
8 9
output:
-1 -1
result:
ok no solution
Test #33:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
9 10
output:
-1 -1
result:
ok no solution
Extra Test:
score: 0
Extra Test Passed