QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#445997 | #7637. Exactly Three Neighbors | wdnmdwrnmmp | WA | 1ms | 3704kb | C++20 | 1.3kb | 2024-06-16 18:43:32 | 2024-06-16 18:43:32 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef vector<int> vi;
typedef pair<int,int> pi;
const double eps=1e-9;
signed main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int p,q; cin>>p>>q;
if((double)p/q>0.8+eps){
cout<<-1<<' '<<-1<<'\n';
}
else if((double)p/q<2.0/3+eps){
int x=p, y=q*2-p*3;
cout<<1<<' '<<q*2<<'\n';
rep(i,1,x){
cout<<"##.";
}
rep(i,1,y){
cout<<".";
}
cout<<endl;
}
else if(p==5 && q==7){
cout<<7<<' '<<6<<'\n';
cout<<R"(..##..
#....#
......
.####.
......
#....#
..##.. )"<<endl;
}
else if(p==7 && q==10){
cout<<4<<' '<<5<<'\n';
cout<<R"(.###.
##.##
##.##
.###. )"<<endl;
}
else if(p==3 && q==4){
cout<<4<<' '<<4<<'\n';
cout<<R"(####
##..
####
..## )"<<endl;
}
else if(p==7 && q==9){
cout<<6<<' '<<18<<'\n';
cout<<R"(#.##.####.####.###
####.##.####.####.
##.####.##.####.##
.####.####.##.####
###.####.####.##.#
#.####.####.####.# )"<<endl;
}
else if(p==4 && q==5){
cout<<5<<' '<<5<<'\n';
cout<<R"(#.###
####.
##.##
.####
###.# )"<<endl;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
input:
2 3
output:
1 6 ##.##.
result:
ok good solution
Test #2:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
1 1
output:
-1 -1
result:
ok no solution
Test #3:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
3 4
output:
4 4 #### ##.. #### ..##
result:
ok good solution
Test #4:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
3 5
output:
1 10 ##.##.##..
result:
ok good solution
Test #5:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
4 5
output:
5 5 #.### ####. ##.## .#### ###.#
result:
ok good solution
Test #6:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
7 10
output:
4 5 .###. ##.## ##.## .###.
result:
ok good solution
Test #7:
score: -100
Wrong Answer
time: 0ms
memory: 3576kb
input:
5 7
output:
7 6 ..##.. #....# ...... .####. ...... #....# ..##..
result:
wrong answer the total share of black squares must be 5/7, but your plan is 2/7