QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#318107 | #7733. Cool, It’s Yesterday Four Times More | TYU0_0 | AC ✓ | 96ms | 8952kb | C++14 | 2.7kb | 2024-01-30 15:30:25 | 2024-01-30 15:30:26 |
Judging History
answer
#include <bits/stdc++.h>
#define MAXP 1000
using namespace std;
int n, m, ans;
vector<string> MAP;
char s[MAXP + 10];
// vis[x]:状态 x 位于哪个连通块里
// 如果状态 x 和 y 的两只袋鼠都没有被移除,那么它们之间的连边就是双向的,可以维护连通块
int vis[MAXP * MAXP + 10];
// flag[x]:状态 x 是否能达成第一只袋鼠打败第二只袋鼠的情况
bool flag[MAXP * MAXP + 10];
// 把状态 (i, j, r, c) 映射成一个整数
int gao(int i, int j, int r, int c) {
return
i * m * n * m +
j * n * m +
r * m +
c;
}
// 把整数 msk 映射回状态 (i, j, r, c)
void ungao(int msk, int &i, int &j, int &r, int &c) {
i = msk / (m * n * m);
j = msk / (n * m) % m;
r = msk / m % n;
c = msk % m;
}
// 检查 (i, j) 是不是洞或者棋盘外面
bool fall(int i, int j) {
return i < 0 || j < 0 || i >= n || j >= m || MAP[i][j] == 'O';
}
short dir[4][2] = {0, 1, 1, 0, -1, 0, 0, -1};
// 从状态 S 开始 bfs
void bfs(int S) {
queue<int> q;
q.push(S); vis[S] = S;
flag[S] = false;
while (!q.empty()) {
int i, j, r, c; ungao(q.front(), i, j, r, c); q.pop();
for (int k = 0; k < 4; k++) {
int ii = i + dir[k][0], jj = j + dir[k][1];
int rr = r + dir[k][0], cc = c + dir[k][1];
// 第一只袋鼠还在空地上
if (fall(ii, jj)) continue;
// 如果第二只袋鼠此时被移除了
// 则 S 所在的连通块的所有状态,都能达成第一只袋鼠打败第二只袋鼠
if (fall(rr, cc)) { flag[S] = true; continue; }
int nxt = gao(ii, jj, rr, cc);
if (vis[nxt] >= 0) continue;
q.push(nxt); vis[nxt] = S;
}
}
}
// 检查一开始位于 (i, j) 的袋鼠能否打败其它所有袋鼠
int check(int i, int j) {
for (int r = 0; r < n; r++) for (int c = 0; c < m; c++) if (MAP[r][c] == '.') {
if (i == r && j == c) continue;
int msk = gao(i, j, r, c);
if (vis[msk] == -1) bfs(msk);
if (!flag[vis[msk]]) return 0;
}
return 1;
}
void solve() {
scanf("%d%d", &n, &m);
MAP.clear();
for (int i = 0; i < n; i++) {
scanf("%s", s);
MAP.push_back(string(s));
}
memset(vis, -1, sizeof(int) * (n * m * n * m + 3));
ans = 0;
// 检查每只袋鼠能否打败其它所有袋鼠
for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (MAP[i][j] == '.') ans += check(i, j);
printf("%d\n", ans);
}
int main() {
int tcase; scanf("%d", &tcase);
while (tcase--) solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3784kb
input:
4 2 5 .OO.. O..O. 1 3 O.O 1 3 .O. 2 3 OOO OOO
output:
3 1 0 0
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
200 2 4 OOO. OO.. 2 3 OOO .O. 3 3 O.O OOO OO. 4 1 . . O O 1 2 .O 1 1 . 2 5 .OO.. .O.O. 2 1 O O 1 1 O 1 3 .OO 5 1 O O . O . 5 2 O. .. O. .O .. 5 3 ... ... .OO ..O OOO 3 5 ..O.O .O.O. .OO.O 5 2 .O OO O. O. .. 2 1 O O 3 5 .O.OO O...O ..OO. 1 5 ..... 5 1 O . O . . 5 3 OOO OO. .OO OO. O.O 2 1 O . 5 2 O. ...
output:
3 0 0 2 1 1 3 0 0 1 0 7 9 4 4 0 6 5 2 0 1 6 4 5 2 0 0 5 3 3 1 4 1 0 7 5 2 3 7 3 0 6 2 2 2 0 4 6 6 3 3 2 3 5 2 1 0 3 3 4 4 2 2 0 7 6 4 8 5 3 2 5 2 1 2 1 4 0 0 2 5 1 4 6 6 1 6 2 2 3 4 5 2 1 0 1 9 3 4 11 0 3 2 1 0 0 4 3 1 4 3 8 3 0 3 6 2 5 1 3 3 4 0 2 11 2 2 4 0 4 4 6 2 1 2 3 0 5 0 16 4 3 2 6 0 8 3 3 1...
result:
ok 200 lines
Test #3:
score: 0
Accepted
time: 4ms
memory: 3844kb
input:
50 10 9 OOOO.O... O...O.OOO .....O... ..OO..O.O ...O..O.O ..OOO..O. ..OOO...O .OO.O..OO .O.O.OO.. .O..O.O.O 10 10 .O.OOO.OO. ...OOOOOOO ...O.O..O. .O.O..O... .O.O.OO..O ..OO.O..OO O....O..OO OO...OOOOO OO.OO.O..O .O.O.OOOOO 10 8 O..OOO.O O.OOOO.. O..OO.OO OO..OO.. .OOO..O. .OO.OO.O OOO..OO. ..O..OO....
output:
31 40 13 25 40 37 27 29 20 26 25 29 21 29 21 31 32 31 33 34 25 31 18 25 41 28 20 45 20 29 18 21 27 28 35 13 20 17 32 29 28 23 23 23 24 18 28 17 35 24
result:
ok 50 lines
Test #4:
score: 0
Accepted
time: 39ms
memory: 8912kb
input:
5 1 1000 ....O..OO..O..O..OO...OOO.OOOO.O...O....OOOOO.....OO..OOOO.O..O....OOOO..OO..OOOO......O.O.O..O..OO.OO.OO.O....O.O.O.O.O.OO..O.O.OO..O..OO..O.OOO...O...O.O.O..O....O.OO...O..O...O.OOO..OO.O..O.OO.O.O..OOOO..O.OO.O.O....O.OO.......OOOO....O.O.O.O..OOO.O.OO.OOO..O...O.O.O.O.OO.O.OOOO...O.OO.....
output:
7 380 294 373 291
result:
ok 5 lines
Test #5:
score: 0
Accepted
time: 0ms
memory: 6120kb
input:
200 1 1 . 2 5 OOOO. OOOOO 3 2 O. O. OO 3 1 O . O 3 2 .. OO OO 1 5 ...OO 3 5 OOOOO OOOOO OOO.O 4 3 OOO OOO OO. OO. 1 3 O.O 3 1 O . . 1 2 O. 3 3 OOO O.. ... 5 4 O.OO ..OO O.OO OOOO OOOO 2 2 O. OO 3 2 OO OO O. 4 4 OOO. OO.. OO.O ...O 1 4 .OOO 4 3 O.. OOO OOO OOO 4 1 O . . O 3 2 O. OO OO 5 3 OO. OOO OOO...
output:
1 1 2 1 2 3 1 2 1 2 1 5 4 1 1 7 1 2 2 1 1 6 0 1 1 5 1 1 2 1 3 8 1 2 1 3 2 10 4 1 3 1 2 1 1 1 1 1 2 1 1 2 2 4 3 1 2 7 4 1 4 1 1 1 2 1 2 1 7 1 1 1 1 1 3 1 1 2 4 1 4 1 1 1 1 1 1 1 1 1 3 7 1 1 2 5 1 3 7 1 9 2 9 4 4 0 12 6 4 6 2 0 8 6 3 4 16 5 4 5 2 7 1 0 0 1 4 2 9 0 2 3 7 6 13 7 10 11 4 2 13 5 8 8 0 16 ...
result:
ok 200 lines
Test #6:
score: 0
Accepted
time: 0ms
memory: 5868kb
input:
50 7 9 OOOOOOO.. OOOOOOO.. OOO....OO ....OO..O .O...OOOO .....OOOO OO...OOOO 8 8 .OO.O... .O...... OOO.OOOO OO..OOOO ..O.OO.O O...OOOO O..OOOOO O..OOOOO 9 8 OO....OO OO..OOOO O..OOOOO ..O..OOO .....O.. .....O.. OOOOOOOO OOOOOOOO .OOOOOOO 8 10 .O.OOOOOOO ...OO.OOOO ......OOOO O..O....OO O..OOO.O.O O....
output:
22 23 22 35 33 15 21 23 24 16 29 15 29 40 23 30 6 25 37 23 25 33 19 12 34 43 44 21 51 29 35 67 22 53 33 53 32 46 50 48 42 45 31 46 45 30 48 53 54 43
result:
ok 50 lines
Test #7:
score: 0
Accepted
time: 27ms
memory: 8952kb
input:
5 1 1000 OO.OOO....O..OOOO..OOOOOOOOOOOOOOOOOOOOOOOOOOOO..OOOOOOOOOOO....OOOOOOOOOOOO...OO.OOOOOOOOOOOO.OOOOOOO....OOOOOOO......OOOOOOOOOOOOOOOOOOOOOOOO..OOO.O.OO..OO....OOOOOOOOO.OO.OOOOO.OOOOOOO....OOOOOOOO.OOOOO...OOOOOOOOOOOOOOOO.OOOOOOOOOOOOOOOOO.OOOOOOOOOOOOOOOOOOOOOOOOOOOO..OOOOOOOOOOOOOOOO.....
output:
0 355 363 384 280
result:
ok 5 lines
Test #8:
score: 0
Accepted
time: 45ms
memory: 8676kb
input:
5 1 1000 O.O...O................OOOO........OO..........OOOO....OO...O...OO....O...OO...O.............OOOOOO......................OOO......OO..........O...............O........................OO....................O..........O..........OO.......OOOO.O..OO...OOO....O.................................O...
output:
34 458 503 370 493
result:
ok 5 lines
Test #9:
score: 0
Accepted
time: 85ms
memory: 8944kb
input:
5 1 1000 O......OOO..O..OO.OO..................................................................................................................................................................................................................................................................................
output:
966 963 971 965 963
result:
ok 5 lines
Test #10:
score: 0
Accepted
time: 41ms
memory: 8624kb
input:
5 5 200 ........................................................................................................................................................................................................ .....OO...OO.OO.O..O..O.OO.OO.OOO.O.OOO...OO.OO...O.O.OO.O.O...OO..OOO..OOOOOOO.OO.O..O.O.O...
output:
508 502 508 499 506
result:
ok 5 lines
Test #11:
score: 0
Accepted
time: 96ms
memory: 8656kb
input:
5 2 500 .....................................................................................................................................................................O.................................................................................................................................
output:
996 994 992 990 988
result:
ok 5 lines
Test #12:
score: 0
Accepted
time: 87ms
memory: 8888kb
input:
5 2 500 .........................................................................................................................................................................................................................................................O.............................................
output:
997 995 993 991 989
result:
ok 5 lines
Test #13:
score: 0
Accepted
time: 41ms
memory: 8752kb
input:
5 333 3 .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. .O. ...
output:
667 667 667 667 667
result:
ok 5 lines
Test #14:
score: 0
Accepted
time: 31ms
memory: 8684kb
input:
5 200 5 .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O. .O.O...
output:
401 401 401 401 401
result:
ok 5 lines
Test #15:
score: 0
Accepted
time: 28ms
memory: 8608kb
input:
5 3 333 .......................................................................................................................................................................................................................................................................................................
output:
333 333 333 333 333
result:
ok 5 lines
Test #16:
score: 0
Accepted
time: 3ms
memory: 8900kb
input:
5 2 500 O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O....
output:
0 0 0 0 0
result:
ok 5 lines
Test #17:
score: 0
Accepted
time: 91ms
memory: 8932kb
input:
5 6 160 ...O..O......O...O..O......O......O.O.O..O......O......O......O......O......O.....OO.O.O..O...O..O..O...O.OO..OO......O....O.O.....OO......O....O.OO..OO.O...... .O....O......O.O....O......O......O...OO.O......O.O.O..O......O......O......O......O......OO...O.O.OO...O......O......O......OO.......
output:
36 570 743 694 682
result:
ok 5 lines
Test #18:
score: 0
Accepted
time: 96ms
memory: 8692kb
input:
5 2 499 .........................................................................................................................................................................................................................................................O.............................................
output:
994 994 990 990 986
result:
ok 5 lines
Extra Test:
score: 0
Extra Test Passed