oj.uz

Submission #436884

# Submission time Handle Problem Language Result Execution time Memory
436884 2021-06-25T07:42:43 Z qwerasdfzxcl Sandwich (JOI16_sandwich) C++14
35 / 100
 8000 ms 7452 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
char matrix[404][404];
int visited[404][404];
int dp[404][404][2], dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, 1, -1}, n, m;

bool valid(int x, int y){
    return ((1<=x && x<=n) && (1<=y && y<=m));
}

int count_visited(){
    int ret = 0;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++) if (visited[i][j]) ret++;
        int cnt = 0;
        if (visited[i][1]) cnt++;
        for (int j=2;j<=m;j++) if (visited[i][j] && !visited[i][j-1]) cnt++;
        assert(cnt<=2);
    }
    return ret;
}

bool dfs(int x, int y, int c){
    if (visited[x][y]) return visited[x][y]==1e9;
    visited[x][y] = c+1;
    bool ret = 1;
    int nx1 = x+dx[c], nx2 = y+dy[c];
    if (valid(nx1, nx2)){
        ret &= dfs(nx1, nx2, c);
    }
    int d = 2;
    if (!c && matrix[x][y]=='Z') d = 3;
    if (c && matrix[x][y]=='N') d = 3;
    int nx3 = x+dx[d], nx4 = y+dy[d];
    if (valid(nx3, nx4)){
        if (d==2 && matrix[nx3][nx4]=='N') ret &= dfs(nx3, nx4, 0);
        else if (d==3 && matrix[nx3][nx4]=='Z') ret &= dfs(nx3, nx4, 0);
        else ret &= dfs(nx3, nx4, 1);
    }
    visited[x][y] = 1e9;
    return ret;
}

int main(){
    scanf("%d %d", &n, &m);
    for (int i=1;i<=n;i++){
        scanf("%s", matrix[i]+1);
        for (int j=1;j<=m;j++) dp[i][j][0] = dp[i][j][1] = 1e9;
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            for (int k=1;k<=n;k++) fill(visited[k]+1, visited[k]+m+1, 0);
            if (dfs(i, j, 0)) dp[i][j][0] = count_visited()<<1;
            for (int k=1;k<=n;k++) fill(visited[k]+1, visited[k]+m+1, 0);
            if (dfs(i, j, 1)) dp[i][j][1] = count_visited()<<1;
            //printf("%d %d: %d %d\n", i, j, dp[i][j][0], dp[i][j][1]);
        }
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            int ans = min(dp[i][j][0], dp[i][j][1]);
            if (ans==1e9) ans = -1;
            printf("%d ", ans);
        }
        printf("\n");
    }
    return 0;
}

Compilation message

sandwich.cpp: In function 'int main()':
sandwich.cpp:47:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
sandwich.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         scanf("%s", matrix[i]+1);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 311 ms 644 KB Output is correct
7 Correct 106 ms 536 KB Output is correct
8 Correct 112 ms 536 KB Output is correct
9 Correct 59 ms 520 KB Output is correct
10 Correct 131 ms 548 KB Output is correct
11 Correct 186 ms 556 KB Output is correct
12 Correct 61 ms 460 KB Output is correct
13 Correct 160 ms 584 KB Output is correct
14 Correct 174 ms 588 KB Output is correct
15 Correct 91 ms 460 KB Output is correct
16 Correct 67 ms 552 KB Output is correct
17 Correct 69 ms 536 KB Output is correct
18 Correct 81 ms 460 KB Output is correct
19 Correct 77 ms 664 KB Output is correct
20 Correct 86 ms 536 KB Output is correct
21 Correct 92 ms 548 KB Output is correct
22 Correct 79 ms 552 KB Output is correct
23 Correct 79 ms 536 KB Output is correct
24 Correct 180 ms 572 KB Output is correct
25 Correct 179 ms 460 KB Output is correct
26 Correct 195 ms 616 KB Output is correct
27 Correct 129 ms 536 KB Output is correct
28 Correct 204 ms 544 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 311 ms 644 KB Output is correct
7 Correct 106 ms 536 KB Output is correct
8 Correct 112 ms 536 KB Output is correct
9 Correct 59 ms 520 KB Output is correct
10 Correct 131 ms 548 KB Output is correct
11 Correct 186 ms 556 KB Output is correct
12 Correct 61 ms 460 KB Output is correct
13 Correct 160 ms 584 KB Output is correct
14 Correct 174 ms 588 KB Output is correct
15 Correct 91 ms 460 KB Output is correct
16 Correct 67 ms 552 KB Output is correct
17 Correct 69 ms 536 KB Output is correct
18 Correct 81 ms 460 KB Output is correct
19 Correct 77 ms 664 KB Output is correct
20 Correct 86 ms 536 KB Output is correct
21 Correct 92 ms 548 KB Output is correct
22 Correct 79 ms 552 KB Output is correct
23 Correct 79 ms 536 KB Output is correct
24 Correct 180 ms 572 KB Output is correct
25 Correct 179 ms 460 KB Output is correct
26 Correct 195 ms 616 KB Output is correct
27 Correct 129 ms 536 KB Output is correct
28 Correct 204 ms 544 KB Output is correct
29 Correct 5 ms 332 KB Output is correct
30 Correct 7 ms 2252 KB Output is correct
31 Execution timed out 8022 ms 7452 KB Time limit exceeded
32 Halted 0 ms 0 KB -