QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#231292 | #7637. Exactly Three Neighbors | ucup-team1716# | AC ✓ | 0ms | 3828kb | C++20 | 2.0kb | 2023-10-29 06:25:31 | 2023-10-29 06:25:31 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int p, q;
cin >> p >> q;
if(3*p <= 2*q)
{
cout << "1 " << 2*q << "\n";
for(int i=0; i<p; i++) cout << "##.";
for(int i=3*p; i<2*q; i++) cout << ".";
cout << "\n";
}
else if(5*p > 4*q)
{
cout << "-1 -1\n";
}
else if(p == 3 && q == 4)
{
cout << "8 8\n";
cout << "##.##.##\n";
cout << ".######.\n";
cout << "###..###\n";
cout << "#.####.#\n";
cout << "#.####.#\n";
cout << "###..###\n";
cout << ".######.\n";
cout << "##.##.##\n";
}
else if(p==4 && q==5)
{
cout << "5 5\n";
cout << "#.###\n";
cout << "####.\n";
cout << "##.##\n";
cout << ".####\n";
cout << "###.#\n";
}
else if(p==7 && q==10)
{
cout << "4 5\n";
cout << "##.##\n";
cout << ".###.\n";
cout << ".###.\n";
cout << "##.##\n";
}
else if(p==7 && q==9)
{
cout << "18 6\n";
vector<string> s = {"#.####", "###..#", ".#####"};
for(int i=0; i<6; i++)
{
cout << s[0] << "\n" << s[1] << "\n" << s[2] << "\n";
s[0] = s[0][5] + s[0].substr(0, 5);
s[1] = s[1][5] + s[1].substr(0, 5);
s[2] = s[2][5] + s[2].substr(0, 5);
}
}
else if(p==5 && q==7)
{
cout << "42 14\n";
vector<string> s = {"#.############", "###..........#", ".#############"};
for(int i=0; i<14; i++)
{
cout << s[0] << "\n" << s[1] << "\n" << s[2] << "\n";
s[0] = s[0][13] + s[0].substr(0, 13);
s[1] = s[1][13] + s[1].substr(0, 13);
s[2] = s[2][13] + s[2].substr(0, 13);
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
2 3
output:
1 6 ##.##.
result:
ok good solution
Test #2:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
1 1
output:
-1 -1
result:
ok no solution
Test #3:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
3 4
output:
8 8 ##.##.## .######. ###..### #.####.# #.####.# ###..### .######. ##.##.##
result:
ok good solution
Test #4:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
3 5
output:
1 10 ##.##.##..
result:
ok good solution
Test #5:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
4 5
output:
5 5 #.### ####. ##.## .#### ###.#
result:
ok good solution
Test #6:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
7 10
output:
4 5 ##.## .###. .###. ##.##
result:
ok good solution
Test #7:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
5 7
output:
42 14 #.############ ###..........# .############# ##.########### ####.......... #.############ ###.########## .####......... ##.########### ####.######### ..####........ ###.########## #####.######## ...####....... ####.######### ######.####### ....####...... #####.######## #######.###### .....####...
result:
ok good solution
Test #8:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
7 9
output:
18 6 #.#### ###..# .##### ##.### ####.. #.#### ###.## .####. ##.### ####.# ..#### ###.## #####. #..### ####.# .##### ##..## #####.
result:
ok good solution
Test #9:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
0 1
output:
1 2 ..
result:
ok good solution
Test #10:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
1 2
output:
1 4 ##..
result:
ok good solution
Test #11:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
1 3
output:
1 6 ##....
result:
ok good solution
Test #12:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
1 4
output:
1 8 ##......
result:
ok good solution
Test #13:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
1 5
output:
1 10 ##........
result:
ok good solution
Test #14:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
1 6
output:
1 12 ##..........
result:
ok good solution
Test #15:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1 7
output:
1 14 ##............
result:
ok good solution
Test #16:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
1 8
output:
1 16 ##..............
result:
ok good solution
Test #17:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
1 9
output:
1 18 ##................
result:
ok good solution
Test #18:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
1 10
output:
1 20 ##..................
result:
ok good solution
Test #19:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
2 5
output:
1 10 ##.##.....
result:
ok good solution
Test #20:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
2 7
output:
1 14 ##.##.........
result:
ok good solution
Test #21:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
2 9
output:
1 18 ##.##.............
result:
ok good solution
Test #22:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
3 7
output:
1 14 ##.##.##......
result:
ok good solution
Test #23:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
3 8
output:
1 16 ##.##.##........
result:
ok good solution
Test #24:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
3 10
output:
1 20 ##.##.##............
result:
ok good solution
Test #25:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
4 7
output:
1 14 ##.##.##.##...
result:
ok good solution
Test #26:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
4 9
output:
1 18 ##.##.##.##.......
result:
ok good solution
Test #27:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
5 6
output:
-1 -1
result:
ok no solution
Test #28:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
5 8
output:
1 16 ##.##.##.##.##..
result:
ok good solution
Test #29:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
5 9
output:
1 18 ##.##.##.##.##....
result:
ok good solution
Test #30:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
6 7
output:
-1 -1
result:
ok no solution
Test #31:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
7 8
output:
-1 -1
result:
ok no solution
Test #32:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
8 9
output:
-1 -1
result:
ok no solution
Test #33:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
9 10
output:
-1 -1
result:
ok no solution
Extra Test:
score: 0
Extra Test Passed