oj.uz

Submission #59044

# Submission time Handle Problem Language Result Execution time Memory
59044 2018-07-20T10:05:15 Z choikiwon Sandwich (JOI16_sandwich) C++17
35 / 100
 8000 ms 12988 KB 
#include<bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

const int MN = 402;

int E = 1;
int la[MN * MN * 4], nxt[MN * MN * 4], oppo[MN * MN * 4], deg[MN * MN * 2];
void add(int u, int v) {
    nxt[E] = la[u];
    la[u] = E;
    oppo[E] = v;
    deg[v]++;
    E++;
}

int N, M;
char G[MN][MN];

int f(int r, int c, int t) {
    return r * (2 * M) + c * 2 + t;
}

int ans[MN * MN * 2], vis[MN * MN * 2], pos = 1;
int q[1000010], head, tail;

int main() {
    scanf("%d %d", &N, &M);

    for(int i = 0; i < N; i++) {
        scanf("\n");
        for(int j = 0; j < M; j++) {
            scanf("%c", &G[i][j]);
        }
    }

    for(int i = 0; i < N; i++) {
        for(int j = 0; j < M; j++) {
            for(int k = 0; k < 2; k++) {
                if(k) {
                    if(i) add(f(i - 1, j, k), f(i, j, k));
                }
                else if(i < N - 1) add(f(i + 1, j, k), f(i, j, k));
                if(k ^ (G[i][j] == 'N')) {
                    if(j) add(f(i, j - 1, G[i][j - 1] == 'Z'), f(i, j, k));
                }
                else if(j < M - 1) add(f(i, j + 1, G[i][j + 1] == 'N'), f(i, j, k));
            }
        }
    }

    head = tail = 0;
    for(int i = 0; i < N * M * 2; i++) if(!deg[i]) {
        q[tail++] = i;
    }
    while(head < tail) {
        int u = q[head++];

        for(int i = la[u]; i; i = nxt[i]) {
            int v = oppo[i];
            deg[v]--;
            if(!deg[v]) {
                q[tail++] = v;
            }
        }
    }

    for(int i = 0; i < N; i++) {
        for(int j = 0; j < M; j++) {
            int k = G[i][j] == 'N';
            if(deg[ f(i, j, k) ]) continue;

            head = tail = 0;
            q[tail++] = f(i, j, k);
            ans[ f(i, j, k) ] += M - j;
            vis[ f(i, j, k) ] = pos;
            while(head < tail) {
                int u = q[head++];

                for(int x = la[u]; x != 0; x = nxt[x]) {
                    int v = oppo[x];
                    if(!deg[v] && vis[v] != pos) {
                        q[tail++] = v;
                        ans[v] += M - j;
                        vis[v] = pos;
                    }
                }
            }
        }
        pos++;
    }
    for(int i = 0; i < N; i++) {
        for(int j = M - 1; j >= 0; j--) {
            int k = G[i][j] == 'Z';
            if(deg[ f(i, j, k) ]) continue;

            head = tail = 0;
            q[tail++] = f(i, j, k);
            ans[ f(i, j, k) ] += j + 1;
            vis[ f(i, j, k) ] = pos;
            while(head < tail) {
                int u = q[head++];

                for(int x = la[u]; x != 0; x = nxt[x]) {
                    int v = oppo[x];
                    if(!deg[v] && vis[v] != pos) {
                        q[tail++] = v;
                        ans[v] += j + 1;
                        vis[v] = pos;
                    }
                }
            }
        }
        pos++;
    }

    for(int i = 0; i < N; i++) {
        for(int j = 0; j < M; j++) {
            if(deg[ f(i, j, 0) ] && deg[ f(i, j, 1) ]) printf("-1 ");
            else if(deg[ f(i, j, 0) ]) printf("%d ", 2 * ans[ f(i, j, 1) ]);
            else if(deg[ f(i, j, 1) ]) printf("%d ", 2 * ans[ f(i, j, 0) ]);
            else printf("%d ", 2 * min(ans[ f(i, j, 0) ], ans[ f(i, j, 1) ]));
        }
        printf("\n");
    }
}

Compilation message

sandwich.cpp: In function 'int main()':
sandwich.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~~
sandwich.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("\n");
         ~~~~~^~~~~~
sandwich.cpp:34:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%c", &G[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 3 ms 644 KB Output is correct
4 Correct 3 ms 644 KB Output is correct
5 Correct 2 ms 644 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 5 ms 804 KB Output is correct
8 Correct 5 ms 868 KB Output is correct
9 Correct 7 ms 868 KB Output is correct
10 Correct 5 ms 900 KB Output is correct
11 Correct 9 ms 900 KB Output is correct
12 Correct 4 ms 900 KB Output is correct
13 Correct 10 ms 900 KB Output is correct
14 Correct 8 ms 900 KB Output is correct
15 Correct 4 ms 900 KB Output is correct
16 Correct 5 ms 900 KB Output is correct
17 Correct 5 ms 900 KB Output is correct
18 Correct 6 ms 900 KB Output is correct
19 Correct 5 ms 900 KB Output is correct
20 Correct 5 ms 900 KB Output is correct
21 Correct 3 ms 900 KB Output is correct
22 Correct 4 ms 900 KB Output is correct
23 Correct 4 ms 900 KB Output is correct
24 Correct 8 ms 900 KB Output is correct
25 Correct 9 ms 900 KB Output is correct
26 Correct 5 ms 900 KB Output is correct
27 Correct 4 ms 940 KB Output is correct
28 Correct 7 ms 940 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 3 ms 644 KB Output is correct
4 Correct 3 ms 644 KB Output is correct
5 Correct 2 ms 644 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 5 ms 804 KB Output is correct
8 Correct 5 ms 868 KB Output is correct
9 Correct 7 ms 868 KB Output is correct
10 Correct 5 ms 900 KB Output is correct
11 Correct 9 ms 900 KB Output is correct
12 Correct 4 ms 900 KB Output is correct
13 Correct 10 ms 900 KB Output is correct
14 Correct 8 ms 900 KB Output is correct
15 Correct 4 ms 900 KB Output is correct
16 Correct 5 ms 900 KB Output is correct
17 Correct 5 ms 900 KB Output is correct
18 Correct 6 ms 900 KB Output is correct
19 Correct 5 ms 900 KB Output is correct
20 Correct 5 ms 900 KB Output is correct
21 Correct 3 ms 900 KB Output is correct
22 Correct 4 ms 900 KB Output is correct
23 Correct 4 ms 900 KB Output is correct
24 Correct 8 ms 900 KB Output is correct
25 Correct 9 ms 900 KB Output is correct
26 Correct 5 ms 900 KB Output is correct
27 Correct 4 ms 940 KB Output is correct
28 Correct 7 ms 940 KB Output is correct
29 Correct 3 ms 940 KB Output is correct
30 Correct 3 ms 940 KB Output is correct
31 Correct 32 ms 8764 KB Output is correct
32 Correct 30 ms 8764 KB Output is correct
33 Correct 10 ms 8764 KB Output is correct
34 Correct 5282 ms 12896 KB Output is correct
35 Correct 3001 ms 12896 KB Output is correct
36 Correct 26 ms 12896 KB Output is correct
37 Correct 7498 ms 12900 KB Output is correct
38 Correct 5976 ms 12988 KB Output is correct
39 Correct 6924 ms 12988 KB Output is correct
40 Execution timed out 8077 ms 12988 KB Time limit exceeded
41 Halted 0 ms 0 KB -