oj.uz

답안 #341965

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341965 2020-12-31T19:45:21 Z Hazem Maja (COCI18_maja) C++14
44 / 110
 2000 ms 620 KB 
/*
ID: tmhazem1
LANG: C++14
TASK: pprime
*/

#include <bits/stdc++.h>
using namespace std;

#define S second
#define F first
#define LL long long

const int N = 104;


LL LINF = 100000000000000000;
LL INF = 1000000000;
int MOD = 1e9+7;

LL dp[N][N][2];
LL vals[N][N];

int main()
{
    // freopen("out.txt","w",stdout);
    int n,m,a,b,k;
    scanf("%d%d%d%d%d",&n,&m,&a,&b,&k);

    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        scanf("%lld",&vals[i][j]);

    for(int i=0;i<=n+1;i++)
        for(int j=0;j<=m+1;j++)
            dp[i][j][0] = dp[i][j][1] = -LINF;

    dp[a][b][0] = 0;
    for(int k1=1;k1<=k;k1++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
            dp[i][j][k1&1] = max({dp[i-1][j][1-(k1&1)],dp[i+1][j][1-(1&k1)],dp[i][j-1][1-(1&k1)],dp[i][j+1][1-(1&k1)]})+vals[i][j];

    printf("%lld\n",dp[a][b][0]);
}

Compilation message

maja.cpp: In function 'int main()':
maja.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%d%d%d%d%d",&n,&m,&a,&b,&k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
maja.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   32 |         scanf("%lld",&vals[i][j]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 6 ms 364 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 364 KB Output is correct
2 Correct 9 ms 364 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2068 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2064 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2058 ms 620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2039 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2045 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2075 ms 492 KB Time limit exceeded
2 Halted 0 ms 0 KB -