QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#87192 | #1893. Friendly Rooks | Beevo# | AC ✓ | 3ms | 3540kb | C++23 | 716b | 2023-03-11 22:13:35 | 2023-03-11 22:13:35 |
Judging History
answer
#include <bits/stdc++.h>
#define el '\n'
typedef long long ll;
typedef long double ld;
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
void testCase() {
int n, m, k;
cin >> n >> m >> k;
if (k > min(n, m))
return cout << "Impossible", void();
cout << "Possible" << el;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (k && i == j)
cout << '*', k--;
else
cout << '.';
}
cout << el;
}
}
signed main() {
Beevo
int t = 1;
// cin >> t;
while (t--)
testCase();
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3380kb
input:
1 2 1
output:
Possible *.
result:
ok n = 1, m = 2, k = 1
Test #2:
score: 0
Accepted
time: 2ms
memory: 3340kb
input:
3 3 100
output:
Impossible
result:
ok n = 3, m = 3, k = 100
Test #3:
score: 0
Accepted
time: 2ms
memory: 3340kb
input:
3 5 2
output:
Possible *.... .*... .....
result:
ok n = 3, m = 5, k = 2
Test #4:
score: 0
Accepted
time: 2ms
memory: 3356kb
input:
1 1 1
output:
Possible *
result:
ok n = 1, m = 1, k = 1
Test #5:
score: 0
Accepted
time: 3ms
memory: 3312kb
input:
1 1 2
output:
Impossible
result:
ok n = 1, m = 1, k = 2
Test #6:
score: 0
Accepted
time: 0ms
memory: 3288kb
input:
11 6 1
output:
Possible *..... ...... ...... ...... ...... ...... ...... ...... ...... ...... ......
result:
ok n = 11, m = 6, k = 1
Test #7:
score: 0
Accepted
time: 2ms
memory: 3364kb
input:
11 19 25
output:
Impossible
result:
ok n = 11, m = 19, k = 25
Test #8:
score: 0
Accepted
time: 0ms
memory: 3384kb
input:
30 17 11
output:
Possible *................ .*............... ..*.............. ...*............. ....*............ .....*........... ......*.......... .......*......... ........*........ .........*....... ..........*...... ................. ................. ................. ................. ................. ......
result:
ok n = 30, m = 17, k = 11
Test #9:
score: 0
Accepted
time: 2ms
memory: 3376kb
input:
34 31 50
output:
Impossible
result:
ok n = 34, m = 31, k = 50
Test #10:
score: 0
Accepted
time: 3ms
memory: 3348kb
input:
52 43 18
output:
Possible *.......................................... .*......................................... ..*........................................ ...*....................................... ....*...................................... .....*..................................... ......*.......................
result:
ok n = 52, m = 43, k = 18
Test #11:
score: 0
Accepted
time: 2ms
memory: 3392kb
input:
8 32 17
output:
Impossible
result:
ok n = 8, m = 32, k = 17
Test #12:
score: 0
Accepted
time: 2ms
memory: 3540kb
input:
26 26 4
output:
Possible *......................... .*........................ ..*....................... ...*...................... .......................... .......................... .......................... .......................... .......................... .......................... ........................
result:
ok n = 26, m = 26, k = 4
Test #13:
score: 0
Accepted
time: 2ms
memory: 3380kb
input:
50 24 87
output:
Impossible
result:
ok n = 50, m = 24, k = 87
Test #14:
score: 0
Accepted
time: 2ms
memory: 3340kb
input:
100 1 1
output:
Possible * . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
result:
ok n = 100, m = 1, k = 1
Test #15:
score: 0
Accepted
time: 2ms
memory: 3536kb
input:
1 100 1
output:
Possible *...................................................................................................
result:
ok n = 1, m = 100, k = 1
Test #16:
score: 0
Accepted
time: 0ms
memory: 3368kb
input:
100 1 2
output:
Impossible
result:
ok n = 100, m = 1, k = 2
Test #17:
score: 0
Accepted
time: 0ms
memory: 3464kb
input:
1 100 33
output:
Impossible
result:
ok n = 1, m = 100, k = 33
Test #18:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
100 100 1
output:
Possible *................................................................................................... .................................................................................................... ............................................................................................
result:
ok n = 100, m = 100, k = 1
Test #19:
score: 0
Accepted
time: 3ms
memory: 3536kb
input:
100 100 100
output:
Possible *................................................................................................... .*.................................................................................................. ..*.........................................................................................
result:
ok n = 100, m = 100, k = 100
Test #20:
score: 0
Accepted
time: 0ms
memory: 3472kb
input:
100 100 99
output:
Possible *................................................................................................... .*.................................................................................................. ..*.........................................................................................
result:
ok n = 100, m = 100, k = 99
Test #21:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
100 99 100
output:
Impossible
result:
ok n = 100, m = 99, k = 100