oj.uz

Submission #55406

# Submission time Handle Problem Language Result Execution time Memory
55406 2018-07-07T07:57:40 Z 강태규(#1543) Sandwich (JOI16_sandwich) C++11
35 / 100
 8000 ms 15300 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>

using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;
 
int r, c;
char grid[501][501];

struct _edge {
    int t, x, y;
};

_edge edge[2][501][501][2];
int used[2][500][500];
int fin[2][500][500];

int imin(int x, int y) {
    return x < y ? x : y;
}

const int inf = 1e6;
int dfs(int t, int x, int y) {
    if (fin[t][x][y]) return 0;
    if (used[t][x][y]) return inf;
    used[t][x][y] = 1;
    int ret = 1;
    
    for (int i = 0; i < 2; ++i) {
        if (edge[t][x][y][i].t == -1) continue;
        _edge j = edge[t][x][y][i];
        ret += dfs(j.t, j.x, j.y);
        if (ret > inf) break;
    }
    fin[t][x][y] = 1;
    return imin(ret, inf);
}

int ans[500][500];

int main() {
    scanf("%d%d", &r, &c);
    for (int i = 0; i < r; ++i) {
        scanf("%s", grid[i]);
    }
    for (int i = 0; i < r; ++i) {
        for (int j = 0; j < c; ++j) {
            edge[0][i][j][0] = edge[0][i][j][1] = edge[1][i][j][0] = edge[1][i][j][1] = { -1, -1, -1 };
            if (j) edge[0][i][j][0] = { 0, i, j - 1 };
            if (i + 1 < r) edge[grid[i][j] != 'N'][i][j][1] = { grid[i + 1][j] != 'N', i + 1, j };
            if (j + 1 < c) edge[1][i][j][0] = { 1, i, j + 1 };
            if (i) edge[grid[i][j] != 'Z'][i][j][1] = { grid[i - 1][j] != 'Z', i - 1, j };
        }
    }
    for (int i = 0; i < r; ++i) {
        for (int j = 0; j < r; ++j) {
            for (int k = 0; k < c; ++k) {
                used[0][j][k] = 0;
                used[1][j][k] = 0;
                fin[0][j][k] = 0;
                fin[1][j][k] = 0;
            }
        }
        int sum = 0;
        for (int j = 0; j < c; ++j) {
            if (sum < inf) sum += dfs(0, i, j);
            sum = imin(sum, inf);
            ans[i][j] = sum;
        }
    }
    
    for (int i = 0; i < r; ++i) {
        for (int j = 0; j < r; ++j) {
            for (int k = 0; k < c; ++k) {
                used[0][j][k] = 0;
                used[1][j][k] = 0;
                fin[0][j][k] = 0;
                fin[1][j][k] = 0;
            }
        }
        int sum = 0;
        for (int j = c; j--; ) {
            if (sum < inf) sum += dfs(1, i, j);
            sum = imin(sum, inf);
            ans[i][j] = min(ans[i][j], sum);
        }
    }
    for (int i = 0; i < r; ++i) {
        for (int j = 0; j < c; ++j) {
            printf("%d ", ans[i][j] < inf ? 2 * ans[i][j] : -1);
        }
        printf("\n");
    }
    
	return 0;
}

Compilation message

sandwich.cpp: In function 'int main()':
sandwich.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &r, &c);
     ~~~~~^~~~~~~~~~~~~~~~
sandwich.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", grid[i]);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 4 ms 1472 KB Output is correct
4 Correct 3 ms 1472 KB Output is correct
5 Correct 3 ms 1472 KB Output is correct
6 Correct 4 ms 1580 KB Output is correct
7 Correct 11 ms 1708 KB Output is correct
8 Correct 10 ms 1708 KB Output is correct
9 Correct 7 ms 1708 KB Output is correct
10 Correct 8 ms 1708 KB Output is correct
11 Correct 13 ms 1708 KB Output is correct
12 Correct 6 ms 1708 KB Output is correct
13 Correct 12 ms 1764 KB Output is correct
14 Correct 12 ms 1764 KB Output is correct
15 Correct 6 ms 1764 KB Output is correct
16 Correct 8 ms 1764 KB Output is correct
17 Correct 8 ms 1764 KB Output is correct
18 Correct 8 ms 1764 KB Output is correct
19 Correct 7 ms 1764 KB Output is correct
20 Correct 5 ms 1764 KB Output is correct
21 Correct 7 ms 1764 KB Output is correct
22 Correct 5 ms 1764 KB Output is correct
23 Correct 7 ms 1764 KB Output is correct
24 Correct 13 ms 1764 KB Output is correct
25 Correct 13 ms 1764 KB Output is correct
26 Correct 11 ms 1828 KB Output is correct
27 Correct 7 ms 1828 KB Output is correct
28 Correct 10 ms 2088 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 4 ms 1472 KB Output is correct
4 Correct 3 ms 1472 KB Output is correct
5 Correct 3 ms 1472 KB Output is correct
6 Correct 4 ms 1580 KB Output is correct
7 Correct 11 ms 1708 KB Output is correct
8 Correct 10 ms 1708 KB Output is correct
9 Correct 7 ms 1708 KB Output is correct
10 Correct 8 ms 1708 KB Output is correct
11 Correct 13 ms 1708 KB Output is correct
12 Correct 6 ms 1708 KB Output is correct
13 Correct 12 ms 1764 KB Output is correct
14 Correct 12 ms 1764 KB Output is correct
15 Correct 6 ms 1764 KB Output is correct
16 Correct 8 ms 1764 KB Output is correct
17 Correct 8 ms 1764 KB Output is correct
18 Correct 8 ms 1764 KB Output is correct
19 Correct 7 ms 1764 KB Output is correct
20 Correct 5 ms 1764 KB Output is correct
21 Correct 7 ms 1764 KB Output is correct
22 Correct 5 ms 1764 KB Output is correct
23 Correct 7 ms 1764 KB Output is correct
24 Correct 13 ms 1764 KB Output is correct
25 Correct 13 ms 1764 KB Output is correct
26 Correct 11 ms 1828 KB Output is correct
27 Correct 7 ms 1828 KB Output is correct
28 Correct 10 ms 2088 KB Output is correct
29 Correct 2 ms 2088 KB Output is correct
30 Correct 16 ms 7972 KB Output is correct
31 Correct 415 ms 15028 KB Output is correct
32 Correct 409 ms 15140 KB Output is correct
33 Correct 97 ms 15140 KB Output is correct
34 Correct 2319 ms 15300 KB Output is correct
35 Correct 3167 ms 15300 KB Output is correct
36 Correct 81 ms 15300 KB Output is correct
37 Correct 4656 ms 15300 KB Output is correct
38 Correct 3232 ms 15300 KB Output is correct
39 Correct 3922 ms 15300 KB Output is correct
40 Execution timed out 8052 ms 15300 KB Time limit exceeded
41 Halted 0 ms 0 KB -