QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#60054	#1893. Friendly Rooks	Mostafa_Moharram^#	AC ✓	2ms	3728kb	C++17	590b	2022-11-02 19:30:14	2022-11-02 19:30:16

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-11-02 19:30:16]
评测

测评结果：AC
用时：2ms
内存：3728kb

查看

[2022-11-02 19:30:14]
提交

answer

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

const int N = 102;
char grid[N][N];

int main() {
    ios::sync_with_stdio(false); cout.tie(nullptr); cin.tie(nullptr);
    memset(grid, '.', sizeof grid);
    int n, m, k;
    cin >> n >> m >> k;
    if (k > min(n, m)) {
        cout << "Impossible\n"; return 0;
    }
    cout << "Possible\n";
    for (int i = 0; i < k; ++i)
        grid[i][i] = '*';
    for (int i = 0; i < n; ++i) {
        grid[i][m] = '\0';
        cout << grid[i] << '\n';
    }
    return 0;
}

源文件, 语言: C++17

这程序好像有点Bug，我给组数据试试？

详细

Test #1:

score: 100

Accepted

time: 2ms

memory: 3524kb

input:

1 2 1

output:

Possible
*.

result:

ok n = 1, m = 2, k = 1

Test #2:

score: 0

Accepted

time: 2ms

memory: 3728kb

input:

3 3 100

output:

Impossible

result:

ok n = 3, m = 3, k = 100

Test #3:

score: 0

Accepted

time: 2ms

memory: 3612kb

input:

3 5 2

output:

Possible
*....
.*...
.....

result:

ok n = 3, m = 5, k = 2

Test #4:

score: 0

Accepted

time: 1ms

memory: 3664kb

input:

1 1 1

output:

Possible
*

result:

ok n = 1, m = 1, k = 1

Test #5:

score: 0

Accepted

time: 2ms

memory: 3464kb

input:

1 1 2

output:

Impossible

result:

ok n = 1, m = 1, k = 2

Test #6:

score: 0

Accepted

time: 2ms

memory: 3532kb

input:

11 6 1

output:

Possible
*.....
......
......
......
......
......
......
......
......
......
......

result:

ok n = 11, m = 6, k = 1

Test #7:

score: 0

Accepted

time: 2ms

memory: 3652kb

input:

11 19 25

output:

Impossible

result:

ok n = 11, m = 19, k = 25

Test #8:

score: 0

Accepted

time: 2ms

memory: 3612kb

input:

30 17 11

output:

Possible
*................
.*...............
..*..............
...*.............
....*............
.....*...........
......*..........
.......*.........
........*........
.........*.......
..........*......
.................
.................
.................
.................
.................
......

result:

ok n = 30, m = 17, k = 11

Test #9:

score: 0

Accepted

time: 2ms

memory: 3584kb

input:

34 31 50

output:

Impossible

result:

ok n = 34, m = 31, k = 50

Test #10:

score: 0

Accepted

time: 1ms

memory: 3528kb

input:

52 43 18

output:

Possible
*..........................................
.*.........................................
..*........................................
...*.......................................
....*......................................
.....*.....................................
......*.......................

result:

ok n = 52, m = 43, k = 18

Test #11:

score: 0

Accepted

time: 2ms

memory: 3524kb

input:

8 32 17

output:

Impossible

result:

ok n = 8, m = 32, k = 17

Test #12:

score: 0

Accepted

time: 0ms

memory: 3528kb

input:

26 26 4

output:

Possible
*.........................
.*........................
..*.......................
...*......................
..........................
..........................
..........................
..........................
..........................
..........................
........................

result:

ok n = 26, m = 26, k = 4

Test #13:

score: 0

Accepted

time: 2ms

memory: 3628kb

input:

50 24 87

output:

Impossible

result:

ok n = 50, m = 24, k = 87

Test #14:

score: 0

Accepted

time: 2ms

memory: 3632kb

input:

100 1 1

output:

Possible
*
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

result:

ok n = 100, m = 1, k = 1

Test #15:

score: 0

Accepted

time: 2ms

memory: 3648kb

input:

1 100 1

output:

Possible
*...................................................................................................

result:

ok n = 1, m = 100, k = 1

Test #16:

score: 0

Accepted

time: 0ms

memory: 3660kb

input:

100 1 2

output:

Impossible

result:

ok n = 100, m = 1, k = 2

Test #17:

score: 0

Accepted

time: 2ms

memory: 3652kb

input:

1 100 33

output:

Impossible

result:

ok n = 1, m = 100, k = 33

Test #18:

score: 0

Accepted

time: 2ms

memory: 3592kb

input:

100 100 1

output:

Possible
*...................................................................................................
....................................................................................................
............................................................................................

result:

ok n = 100, m = 100, k = 1

Test #19:

score: 0

Accepted

time: 2ms

memory: 3664kb

input:

100 100 100

output:

Possible
*...................................................................................................
.*..................................................................................................
..*.........................................................................................

result:

ok n = 100, m = 100, k = 100

Test #20:

score: 0

Accepted

time: 2ms

memory: 3668kb

input:

100 100 99

output:

Possible
*...................................................................................................
.*..................................................................................................
..*.........................................................................................

result:

ok n = 100, m = 100, k = 99

Test #21:

score: 0

Accepted

time: 2ms

memory: 3592kb

input:

100 99 100

output:

Impossible

result:

ok n = 100, m = 99, k = 100