oj.uz

답안 #436863

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
436863 2021-06-25T06:52:47 Z qwerasdfzxcl Sandwich (JOI16_sandwich) C++14
0 / 100
 351 ms 640 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++;
    }
    return ret;
}

int SX, SY;
bool dfs(int x, int y, int c){
    if (SX==-1) SX = x, SY = y;
    else if (SX==x && SY==y) return 0;
    if (visited[x][y]) return visited[x][y]==c+1;
    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);
    }
    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);
            SX = SY = -1;
            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);
            SX = SY = -1;
            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:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
sandwich.cpp:47:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         scanf("%s", matrix[i]+1);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 35.0

# 결과 실행 시간 메모리 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 2 ms 460 KB Output is correct
6 Correct 351 ms 640 KB Output is correct
7 Correct 111 ms 544 KB Output is correct
8 Correct 115 ms 556 KB Output is correct
9 Correct 56 ms 524 KB Output is correct
10 Correct 142 ms 544 KB Output is correct
11 Correct 188 ms 548 KB Output is correct
12 Correct 63 ms 460 KB Output is correct
13 Correct 175 ms 580 KB Output is correct
14 Correct 190 ms 588 KB Output is correct
15 Correct 77 ms 460 KB Output is correct
16 Correct 62 ms 544 KB Output is correct
17 Correct 79 ms 536 KB Output is correct
18 Correct 67 ms 556 KB Output is correct
19 Correct 73 ms 552 KB Output is correct
20 Correct 97 ms 552 KB Output is correct
21 Correct 74 ms 552 KB Output is correct
22 Incorrect 72 ms 460 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 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 2 ms 460 KB Output is correct
6 Correct 351 ms 640 KB Output is correct
7 Correct 111 ms 544 KB Output is correct
8 Correct 115 ms 556 KB Output is correct
9 Correct 56 ms 524 KB Output is correct
10 Correct 142 ms 544 KB Output is correct
11 Correct 188 ms 548 KB Output is correct
12 Correct 63 ms 460 KB Output is correct
13 Correct 175 ms 580 KB Output is correct
14 Correct 190 ms 588 KB Output is correct
15 Correct 77 ms 460 KB Output is correct
16 Correct 62 ms 544 KB Output is correct
17 Correct 79 ms 536 KB Output is correct
18 Correct 67 ms 556 KB Output is correct
19 Correct 73 ms 552 KB Output is correct
20 Correct 97 ms 552 KB Output is correct
21 Correct 74 ms 552 KB Output is correct
22 Incorrect 72 ms 460 KB Output isn't correct
23 Halted 0 ms 0 KB -