# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28678 | 三( ε:) (#68) | Test Data Creation (FXCUP2_testdata) | C++11 | 993 ms | 216032 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <climits>
#include <algorithm>
using namespace std;
int p[90010];
int dp[90010][610]; // [ù ��° ��λ��� ��ġ][�� ��° ��λ��� ��ġ.. �ε� ù ��° ��λ��� ��ġ���� N���� ���� ������ ���� �ٷ�]
bool ans[90010];
int main(){
int N, M; scanf("%d%d", &N, &M);
for(int i = 0; i < N * M; i++) scanf("%d", &p[i]);
for(int i = 0; i < N * M; i++){
for(int j = 0; j <= 600; j++) dp[i][j] = INT_MAX;
}
dp[0][300] = p[0];
for(int i = 0; i < N * M; i++){
for(int j = 0; j <= 600; j++){
int v = INT_MAX;
int y = i + j - 300; if(y < 0 || y >= N * M) continue;
if(i == 0 && j == 300) continue;
// printf("%d, %d\n", i, y);
// i�� ���ʿ��� �̵� : (i - 1, i + j - 300) = [i - 1][j + 1]
if(i % M > 0 && j + 1 >= 0 && j + 1 <= 600 && dp[i - 1][j + 1] < INT_MAX){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |