QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#602344#7733. Cool, It’s Yesterday Four Times MoreflsTL 106ms4644kbC++203.3kb2024-09-30 23:18:412024-09-30 23:18:43

Judging History

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

  • [2024-09-30 23:18:43]
  • 评测
  • 测评结果:TL
  • 用时:106ms
  • 内存:4644kb
  • [2024-09-30 23:18:41]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define qmx(a,b) a<b?b:a
#define qmn(a,b) a>b?b:a
#define ll long long
#define fr first
#define se second
#define pir pair< pair<int, int>, pair<int, int> > 

const int mxn = 1e3+3;

char mp[mxn][mxn];

//bool vis[mxn][mxn];

int n, m, cntn;

vector < pair<int, int> > xyz;

map < pir , bool > res, vis;

bool outBound(int inx, int iny){
    return inx < 1 || iny < 1 || inx > n || iny > m;
}

bool trydel(int dx, int dy, int sx, int sy, int step){
    pir XYZ = make_pair(make_pair(dx, dy), make_pair(sx, sy));
    if(vis[XYZ]){
        return res[XYZ];
    }
    vis[XYZ] = true;
    if(outBound(dx, dy) || mp[dx][dy] == 'O'){
        return (res[XYZ] = false);
    }
    if(outBound(sx, sy) || mp[sx][sy] == 'O'){
        return (res[XYZ] = true);
    }
    res[XYZ] = false;
    //if(!vis[make_pair(make_pair(dx - 1, dy), make_pair(sx - 1, sy))])
        res[XYZ] |= trydel(dx - 1, dy, sx - 1, sy, step + 1);
    //if(!vis[make_pair(make_pair(dx, dy - 1), make_pair(sx, sy - 1))])
        res[XYZ] |= trydel(dx, dy - 1, sx, sy - 1, step + 1);
    //if(!vis[make_pair(make_pair(dx + 1, dy), make_pair(sx + 1, sy))])
        res[XYZ] |= trydel(dx + 1, dy, sx + 1, sy, step + 1);
    //if(!vis[make_pair(make_pair(dx, dy + 1), make_pair(sx, sy + 1))])
        res[XYZ] |= trydel(dx, dy + 1, sx, sy + 1, step + 1);
    //cerr << dx <<"," << dy << " / " << sx << "," << sy << ":" << res[XYZ] <<" & " << step<< endl;
    if(step && !res[XYZ])
        vis[XYZ] = false;
    return res[XYZ];
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    bool fail;
    int test, ans;
    cin>>test;
    while(test--){
        cntn = 0;
        ans = 0;
        xyz.clear();
        vis.clear();
        res.clear();
        cin >> n >> m;
        for(int i = 1 ; i <= n ; i++){
            for(int j = 1 ; j <= m ; j++){
                cin >> mp[i][j];
                if(mp[i][j] == '.'){
                    cntn++;
                    xyz.push_back(make_pair(i, j));
                    //cerr << i << " " << j << endl;
                }
            }
        }
        for(int i = 0 ; i < cntn ; i++){
            fail = false;
            for(int j = 0 ; j < cntn ; j++){
                if(i != j){
                    //memset(vis, 0, sizeof(vis));
                    ///vis[xyz[i].first][xyz[i].second] = true;
                    pir XYZ = make_pair(make_pair(xyz[i].first, xyz[i].second), make_pair(xyz[j].first, xyz[j].second));
                    //cerr << xyz[i].first <<" " << xyz[i].second << ": " << xyz[j].first <<" "<< xyz[j].second << endl;
                    //vis[XYZ] = false;
                    //cerr << xyz[i].first <<" " << xyz[i].second << ": " << xyz[j].first <<" "<< xyz[j].second << " " <<trydel(xyz[i].first, xyz[i].second, xyz[j].first, xyz[j].second) << endl;
                    if(!trydel(xyz[i].first, xyz[i].second, xyz[j].first, xyz[j].second, 0)){
                        //cerr << xyz[i].first <<" " << xyz[i].second << ": " << xyz[j].first <<" "<< xyz[j].second << endl;
                        fail = true;
                        break;
                    }
                }
            }
            if(!fail){
                ans++;
            }
        }
        cout << ans << "\n";
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3684kb

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: 7ms
memory: 3700kb

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: 106ms
memory: 4644kb

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: -100
Time Limit Exceeded

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:


result: