oj.uz

Submission #286374

# Submission time Handle Problem Language Result Execution time Memory
286374 2020-08-30T10:41:03 Z Alexa2001 Sandwich (JOI16_sandwich) C++17
100 / 100
 7183 ms 12500 KB 
#include <bits/stdc++.h>

using namespace std;

const int inf = 1e9;
const int Nmax = 404;

int cells, n, m;
bool bad;

char a[Nmax][Nmax];
int ans[Nmax][Nmax];
int Upper[Nmax][Nmax], Lower[Nmax][Nmax];

void add_upper(int x, int y);


void add_lower(int x, int y)
{
    if(Lower[x][y] == 1) bad = 1;
    if(Lower[x][y]) return;
    Lower[x][y] = 1;

    ++cells;

    if(a[x][y] == 'N') /// adaug dreapta
    {
        if(a[x][y+1] == 'N')
            add_lower(x, y+1);
        else if(a[x][y+1] == 'Z')
            add_upper(x, y+1);

        if(x - 1 >= 1)
            add_lower(x-1, y);
    }
    else
    {
        if(a[x][y-1] == 'N')
            add_upper(x, y-1);
        else if(a[x][y-1] == 'Z')
            add_lower(x, y-1);

        if(x - 1 >= 1)
            add_lower(x-1, y);
    }

    Lower[x][y] = -1;
}

void add_upper(int x, int y)
{
    if(Upper[x][y] == 1) bad = 1;
    if(Upper[x][y]) return;
    Upper[x][y] = 1;

    ++cells;

    if(a[x][y] == 'N') /// adaug dreapta
    {
        if(a[x][y-1] == 'N')
            add_upper(x, y-1);
        else if(a[x][y-1] == 'Z')
            add_lower(x, y-1);

        if(x + 1 <= n)
            add_upper(x+1, y);
    }
    else
    {
        if(a[x][y+1] == 'N')
            add_lower(x, y+1);
        else if(a[x][y+1] == 'Z')
            add_upper(x, y+1);

        if(x + 1 <= n)
            add_upper(x+1, y);
    }

    Upper[x][y] = -1;
}

void solve1(int c)
{
    int i, j;
    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
            Lower[i][j] = Upper[i][j] = 0;

    cells = 0;
    bad = 0;

    for(i=1; i<=n; ++i)
    {
        add_lower(i, c);
        if(bad) return;
        ans[i][c] = min(ans[i][c], cells);
    }
}


void solve2(int c)
{
    int i, j;
    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
            Lower[i][j] = Upper[i][j] = 0;

    cells = 0;
    bad = 0;

    for(i=n; i; --i)
    {
        add_upper(i, c);
        if(bad) return;
        ans[i][c] = min(ans[i][c], cells);
    }
}


int main()
{
  //  freopen("input", "r", stdin);
    cin.tie(0); cin.sync_with_stdio(false);

    cin >> n >> m;

    int i, j;
    for(i=1; i<=n; ++i) cin >> (a[i] + 1);

    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
            ans[i][j] = inf;

    for(i=1; i<=m; ++i)
        solve1(i);

    for(i=1; i<=m; ++i)
        solve2(i);

    for(i=1; i<=n; ++i)
        for(j=1; j<=m; ++j)
            cout << (ans[i][j] == inf ? -1 : 2 * ans[i][j]) << " \n"[j==m];

    return 0;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 12 ms 768 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 10 ms 668 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 7 ms 640 KB Output is correct
14 Correct 7 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 3 ms 640 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 2 ms 672 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 10 ms 640 KB Output is correct
25 Correct 7 ms 640 KB Output is correct
26 Correct 5 ms 640 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 6 ms 768 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 12 ms 768 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 10 ms 668 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 7 ms 640 KB Output is correct
14 Correct 7 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 4 ms 640 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 3 ms 640 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 2 ms 672 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 10 ms 640 KB Output is correct
25 Correct 7 ms 640 KB Output is correct
26 Correct 5 ms 640 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 2 ms 2432 KB Output is correct
31 Correct 7183 ms 12500 KB Output is correct
32 Correct 6986 ms 11880 KB Output is correct
33 Correct 501 ms 4728 KB Output is correct
34 Correct 778 ms 3576 KB Output is correct
35 Correct 974 ms 2936 KB Output is correct
36 Correct 3 ms 2432 KB Output is correct
37 Correct 1201 ms 3576 KB Output is correct
38 Correct 1470 ms 3540 KB Output is correct
39 Correct 1188 ms 3560 KB Output is correct
40 Correct 4526 ms 3744 KB Output is correct
41 Correct 2661 ms 2520 KB Output is correct
42 Correct 3177 ms 5624 KB Output is correct
43 Correct 3110 ms 5628 KB Output is correct
44 Correct 3355 ms 5336 KB Output is correct
45 Correct 724 ms 3516 KB Output is correct
46 Correct 1354 ms 3576 KB Output is correct
47 Correct 1141 ms 3576 KB Output is correct
48 Correct 784 ms 3192 KB Output is correct
49 Correct 1224 ms 3576 KB Output is correct
50 Correct 1210 ms 3552 KB Output is correct
51 Correct 1238 ms 3576 KB Output is correct
52 Correct 614 ms 3544 KB Output is correct
53 Correct 585 ms 3576 KB Output is correct
54 Correct 557 ms 3576 KB Output is correct
55 Correct 590 ms 3448 KB Output is correct
56 Correct 599 ms 3656 KB Output is correct
57 Correct 407 ms 3320 KB Output is correct
58 Correct 3343 ms 4600 KB Output is correct
59 Correct 3397 ms 4688 KB Output is correct
60 Correct 2235 ms 3960 KB Output is correct
61 Correct 2219 ms 7416 KB Output is correct
62 Correct 1312 ms 3704 KB Output is correct
63 Correct 2441 ms 11260 KB Output is correct