QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #60031 | #1893. Friendly Rooks | abdelrahman001# | AC ✓ | 2ms | 3708kb | C++20 | 677b | 2022-11-02 18:50:58 | 2022-11-02 18:51:01 |
Judging History
answer
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e5 + 5;
int n, m, k;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m >> k;
if(k > min(n, m))
return cout << "Impossible", 0;
cout << "Possible\n";
vector<vector<char>> v(n, vector<char>(m, '.'));
for(int i = 0;i < k;i++)
v[i][i] = '*';
for(int i = 0;i < n;i++) {
for(int j = 0;j < m;j++)
cout << v[i][j];
cout << '\n';
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3628kb
input:
1 2 1
output:
Possible *.
result:
ok n = 1, m = 2, k = 1
Test #2:
score: 0
Accepted
time: 2ms
memory: 3632kb
input:
3 3 100
output:
Impossible
result:
ok n = 3, m = 3, k = 100
Test #3:
score: 0
Accepted
time: 2ms
memory: 3524kb
input:
3 5 2
output:
Possible *.... .*... .....
result:
ok n = 3, m = 5, k = 2
Test #4:
score: 0
Accepted
time: 2ms
memory: 3492kb
input:
1 1 1
output:
Possible *
result:
ok n = 1, m = 1, k = 1
Test #5:
score: 0
Accepted
time: 2ms
memory: 3624kb
input:
1 1 2
output:
Impossible
result:
ok n = 1, m = 1, k = 2
Test #6:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
11 6 1
output:
Possible *..... ...... ...... ...... ...... ...... ...... ...... ...... ...... ......
result:
ok n = 11, m = 6, k = 1
Test #7:
score: 0
Accepted
time: 2ms
memory: 3528kb
input:
11 19 25
output:
Impossible
result:
ok n = 11, m = 19, k = 25
Test #8:
score: 0
Accepted
time: 2ms
memory: 3708kb
input:
30 17 11
output:
Possible *................ .*............... ..*.............. ...*............. ....*............ .....*........... ......*.......... .......*......... ........*........ .........*....... ..........*...... ................. ................. ................. ................. ................. ......
result:
ok n = 30, m = 17, k = 11
Test #9:
score: 0
Accepted
time: 2ms
memory: 3608kb
input:
34 31 50
output:
Impossible
result:
ok n = 34, m = 31, k = 50
Test #10:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
52 43 18
output:
Possible *.......................................... .*......................................... ..*........................................ ...*....................................... ....*...................................... .....*..................................... ......*.......................
result:
ok n = 52, m = 43, k = 18
Test #11:
score: 0
Accepted
time: 2ms
memory: 3496kb
input:
8 32 17
output:
Impossible
result:
ok n = 8, m = 32, k = 17
Test #12:
score: 0
Accepted
time: 2ms
memory: 3624kb
input:
26 26 4
output:
Possible *......................... .*........................ ..*....................... ...*...................... .......................... .......................... .......................... .......................... .......................... .......................... ........................
result:
ok n = 26, m = 26, k = 4
Test #13:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
50 24 87
output:
Impossible
result:
ok n = 50, m = 24, k = 87
Test #14:
score: 0
Accepted
time: 2ms
memory: 3616kb
input:
100 1 1
output:
Possible * . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
result:
ok n = 100, m = 1, k = 1
Test #15:
score: 0
Accepted
time: 2ms
memory: 3708kb
input:
1 100 1
output:
Possible *...................................................................................................
result:
ok n = 1, m = 100, k = 1
Test #16:
score: 0
Accepted
time: 2ms
memory: 3612kb
input:
100 1 2
output:
Impossible
result:
ok n = 100, m = 1, k = 2
Test #17:
score: 0
Accepted
time: 2ms
memory: 3516kb
input:
1 100 33
output:
Impossible
result:
ok n = 1, m = 100, k = 33
Test #18:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
100 100 1
output:
Possible *................................................................................................... .................................................................................................... ............................................................................................
result:
ok n = 100, m = 100, k = 1
Test #19:
score: 0
Accepted
time: 2ms
memory: 3556kb
input:
100 100 100
output:
Possible *................................................................................................... .*.................................................................................................. ..*.........................................................................................
result:
ok n = 100, m = 100, k = 100
Test #20:
score: 0
Accepted
time: 2ms
memory: 3632kb
input:
100 100 99
output:
Possible *................................................................................................... .*.................................................................................................. ..*.........................................................................................
result:
ok n = 100, m = 100, k = 99
Test #21:
score: 0
Accepted
time: 2ms
memory: 3512kb
input:
100 99 100
output:
Impossible
result:
ok n = 100, m = 99, k = 100