oj.uz

Submission #7246

# Submission time Handle Problem Language Result Execution time Memory
7246 2014-07-28T12:54:37 Z gs13068 배열 탈출 (GA8_array) C++
100 / 100
 608 ms 39696 KB 
#include<cstdio>
#include<algorithm>

int a[2223][2223];
int d[2223][2223];

int main()
{
    int i,j,n;
    scanf("%d",&n);
    for(i=1;i<=n;i++)for(j=1;j<=n;j++)scanf("%d",&a[i][j]);
    for(i=2;i<=n;i++)a[i][0]=-246641;
    for(j=2;j<=n;j++)a[0][j]=-246641;
    for(i=1;i<=n;i++)for(j=1;j<=n;j++)d[i][j]=std::min(d[i-1][j]+std::max(a[i][j]-a[i-1][j]+1,0),d[i][j-1]+std::max(a[i][j]-a[i][j-1]+1,0));
    printf("%d",d[n][n]-a[1][1]-1);
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 39696 KB Output is correct
2 Correct 0 ms 39696 KB Output is correct
3 Correct 0 ms 39696 KB Output is correct
4 Correct 0 ms 39696 KB Output is correct
5 Correct 0 ms 39696 KB Output is correct
6 Correct 0 ms 39696 KB Output is correct
7 Correct 0 ms 39696 KB Output is correct
8 Correct 0 ms 39696 KB Output is correct
9 Correct 0 ms 39696 KB Output is correct
10 Correct 0 ms 39696 KB Output is correct
11 Correct 0 ms 39696 KB Output is correct
12 Correct 0 ms 39696 KB Output is correct
13 Correct 0 ms 39696 KB Output is correct
14 Correct 0 ms 39696 KB Output is correct
15 Correct 0 ms 39696 KB Output is correct
16 Correct 0 ms 39696 KB Output is correct
17 Correct 0 ms 39696 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 39696 KB Output is correct
2 Correct 0 ms 39696 KB Output is correct
3 Correct 0 ms 39696 KB Output is correct
4 Correct 0 ms 39696 KB Output is correct
5 Correct 0 ms 39696 KB Output is correct
6 Correct 0 ms 39696 KB Output is correct
7 Correct 0 ms 39696 KB Output is correct
8 Correct 0 ms 39696 KB Output is correct
9 Correct 0 ms 39696 KB Output is correct
10 Correct 0 ms 39696 KB Output is correct
11 Correct 0 ms 39696 KB Output is correct
12 Correct 0 ms 39696 KB Output is correct
13 Correct 0 ms 39696 KB Output is correct
14 Correct 0 ms 39696 KB Output is correct
15 Correct 0 ms 39696 KB Output is correct
16 Correct 0 ms 39696 KB Output is correct
17 Correct 0 ms 39696 KB Output is correct
18 Correct 0 ms 39696 KB Output is correct
19 Correct 0 ms 39696 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 39696 KB Output is correct
2 Correct 8 ms 39696 KB Output is correct
3 Correct 0 ms 39696 KB Output is correct
4 Correct 0 ms 39696 KB Output is correct
5 Correct 8 ms 39696 KB Output is correct
6 Correct 8 ms 39696 KB Output is correct
7 Correct 8 ms 39696 KB Output is correct
8 Correct 4 ms 39696 KB Output is correct
9 Correct 8 ms 39696 KB Output is correct
10 Correct 4 ms 39696 KB Output is correct
11 Correct 8 ms 39696 KB Output is correct
12 Correct 4 ms 39696 KB Output is correct
13 Correct 8 ms 39696 KB Output is correct
14 Correct 0 ms 39696 KB Output is correct
15 Correct 0 ms 39696 KB Output is correct
16 Correct 0 ms 39696 KB Output is correct
17 Correct 8 ms 39696 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 588 ms 39696 KB Output is correct
2 Correct 596 ms 39696 KB Output is correct
3 Correct 580 ms 39696 KB Output is correct
4 Correct 584 ms 39696 KB Output is correct
5 Correct 488 ms 39696 KB Output is correct
6 Correct 520 ms 39696 KB Output is correct
7 Correct 580 ms 39696 KB Output is correct
8 Correct 608 ms 39696 KB Output is correct
9 Correct 584 ms 39696 KB Output is correct
10 Correct 568 ms 39696 KB Output is correct
11 Correct 544 ms 39696 KB Output is correct
12 Correct 508 ms 39696 KB Output is correct
13 Correct 504 ms 39696 KB Output is correct
14 Correct 540 ms 39696 KB Output is correct
15 Correct 460 ms 39696 KB Output is correct
16 Correct 548 ms 39696 KB Output is correct
17 Correct 548 ms 39696 KB Output is correct
18 Correct 512 ms 39696 KB Output is correct
19 Correct 552 ms 39696 KB Output is correct
20 Correct 564 ms 39696 KB Output is correct
21 Correct 508 ms 39696 KB Output is correct