QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#65054 | #1893. Friendly Rooks | Xiaoyang | AC ✓ | 3ms | 3484kb | C++14 | 777b | 2022-11-26 21:16:20 | 2022-11-26 21:16:21 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define SZ(x) ((long long)(x).size())
#define rep(i,a,b) for (long long i=(a);i<(b);i++)
#define pq priority_queue
#define MP make_pair
#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define ll long long
#define pii pair<ll,ll>
#define debug(x) cerr<<#x<<"="<<x<<"\n"
#define endl "\n"
const ll inf=1e18;
const ll mod=1e9+7;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,m,k;cin>>n>>m>>k;
if(min(n,m)<k)cout<<"Impossible";
else{
cout<<"Possible"<<endl;
ll cnt=k;
rep(i,0,n){
rep(j,0,m){
if(i==j and cnt>0)cout<<'*',cnt--;
else cout<<'.';
}cout<<endl;
}
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3392kb
input:
1 2 1
output:
Possible *.
result:
ok n = 1, m = 2, k = 1
Test #2:
score: 0
Accepted
time: 2ms
memory: 3480kb
input:
3 3 100
output:
Impossible
result:
ok n = 3, m = 3, k = 100
Test #3:
score: 0
Accepted
time: 0ms
memory: 3412kb
input:
3 5 2
output:
Possible *.... .*... .....
result:
ok n = 3, m = 5, k = 2
Test #4:
score: 0
Accepted
time: 2ms
memory: 3416kb
input:
1 1 1
output:
Possible *
result:
ok n = 1, m = 1, k = 1
Test #5:
score: 0
Accepted
time: 2ms
memory: 3344kb
input:
1 1 2
output:
Impossible
result:
ok n = 1, m = 1, k = 2
Test #6:
score: 0
Accepted
time: 2ms
memory: 3412kb
input:
11 6 1
output:
Possible *..... ...... ...... ...... ...... ...... ...... ...... ...... ...... ......
result:
ok n = 11, m = 6, k = 1
Test #7:
score: 0
Accepted
time: 0ms
memory: 3264kb
input:
11 19 25
output:
Impossible
result:
ok n = 11, m = 19, k = 25
Test #8:
score: 0
Accepted
time: 0ms
memory: 3312kb
input:
30 17 11
output:
Possible *................ .*............... ..*.............. ...*............. ....*............ .....*........... ......*.......... .......*......... ........*........ .........*....... ..........*...... ................. ................. ................. ................. ................. ......
result:
ok n = 30, m = 17, k = 11
Test #9:
score: 0
Accepted
time: 2ms
memory: 3332kb
input:
34 31 50
output:
Impossible
result:
ok n = 34, m = 31, k = 50
Test #10:
score: 0
Accepted
time: 2ms
memory: 3404kb
input:
52 43 18
output:
Possible *.......................................... .*......................................... ..*........................................ ...*....................................... ....*...................................... .....*..................................... ......*.......................
result:
ok n = 52, m = 43, k = 18
Test #11:
score: 0
Accepted
time: 2ms
memory: 3396kb
input:
8 32 17
output:
Impossible
result:
ok n = 8, m = 32, k = 17
Test #12:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
26 26 4
output:
Possible *......................... .*........................ ..*....................... ...*...................... .......................... .......................... .......................... .......................... .......................... .......................... ........................
result:
ok n = 26, m = 26, k = 4
Test #13:
score: 0
Accepted
time: 2ms
memory: 3452kb
input:
50 24 87
output:
Impossible
result:
ok n = 50, m = 24, k = 87
Test #14:
score: 0
Accepted
time: 2ms
memory: 3380kb
input:
100 1 1
output:
Possible * . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
result:
ok n = 100, m = 1, k = 1
Test #15:
score: 0
Accepted
time: 2ms
memory: 3308kb
input:
1 100 1
output:
Possible *...................................................................................................
result:
ok n = 1, m = 100, k = 1
Test #16:
score: 0
Accepted
time: 3ms
memory: 3484kb
input:
100 1 2
output:
Impossible
result:
ok n = 100, m = 1, k = 2
Test #17:
score: 0
Accepted
time: 2ms
memory: 3264kb
input:
1 100 33
output:
Impossible
result:
ok n = 1, m = 100, k = 33
Test #18:
score: 0
Accepted
time: 2ms
memory: 3456kb
input:
100 100 1
output:
Possible *................................................................................................... .................................................................................................... ............................................................................................
result:
ok n = 100, m = 100, k = 1
Test #19:
score: 0
Accepted
time: 1ms
memory: 3300kb
input:
100 100 100
output:
Possible *................................................................................................... .*.................................................................................................. ..*.........................................................................................
result:
ok n = 100, m = 100, k = 100
Test #20:
score: 0
Accepted
time: 2ms
memory: 3296kb
input:
100 100 99
output:
Possible *................................................................................................... .*.................................................................................................. ..*.........................................................................................
result:
ok n = 100, m = 100, k = 99
Test #21:
score: 0
Accepted
time: 2ms
memory: 3452kb
input:
100 99 100
output:
Impossible
result:
ok n = 100, m = 99, k = 100