oj.uz

Submission #7517

# Submission time Handle Problem Language Result Execution time Memory
7517 2014-08-10T09:59:11 Z jalmal 배열 탈출 (GA8_array) C++
0 / 100
 1404 ms 39936 KB 
#include <stdio.h>

int N, arr[2230][2230], tab[2230][2230];

void upd(int x, int y)
{
    int m = 2147483647;
    if(x > 1)
    {
        if(arr[y][x] < arr[y][x-1])
        {
            if(tab[y][x-1] < m) m = tab[y][x-1];
        }
        else
        {
            if(tab[y][x-1] + arr[y][x] - arr[y][x-1] + 1 < m) m = tab[y][x-1] + arr[y][x] - arr[y][x-1] + 1;
        }
    }
    if(y > 1)
    {
        if(arr[y][x] < arr[y-1][x])
        {
            if(tab[y-1][x] < m) m = tab[y-1][x];
        }
        else
        {
            if(tab[y-1][x] + arr[y][x] - arr[y-1][x] + 1 < m) m = tab[y-1][x] + arr[y][x] - arr[y-1][x] + 1;
        }
    }
    tab[y][x] = m;
}

int main()
{
    //freopen("input.txt", "r",  stdin);
    int i, j;

    scanf("%d", &N);
    for(i = 1; i <= N; i ++) for(j = 1; j <= N; j ++) scanf("%d", &arr[i][j]);

    for(i = 2; i <= N; i ++)
    {
        int x, y;
        for(x = 1, y = i; x <= i; x ++, y --)
        {
            upd(x, y);
        }
    }

    for(i = 2; i <= N; i ++)
    {
        int x, y;
        for(x = i, y = N; x <= N; x ++, y --)
        {
            upd(x, y);
        }
    }

    for(i = 1; i <= N; i ++)
    {
        for(j = 1; j <= N; j ++) printf("%d ", tab[i][j]); puts("");
    }

    return 0;
}

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 39936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 39936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 39936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 51.0

# Verdict Execution time Memory Grader output
1 Too much output 1404 ms 39936 KB
2 Halted 0 ms 0 KB -