# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66863 | ekrem | Dango Maker (JOI18_dango_maker) | C++98 | 1759 ms | 143860 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 <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 3005
using namespace std;
int n, m, ans, a[N][N], dp[N][N][3];
char c;
//dur = 0 hic koyma
//dur = 1 yatak
//dur = 2 dikey
int f(int i, int j, int dur){
if(i > n or j > m or i < 1 or j < 1)
return 0;
int &r = dp[i][j][dur];
if(r != -1)
return r;
int art = 0;
if(dur == 1)
if(a[i][j] == 2 and a[i][j - 1] == 1 and a[i][j + 1] == 3)
art = 1;
if(dur == 2)
if(a[i][j] == 2 and a[i - 1][j] == 1 and a[i + 1][j] == 3)
art = 1;
if(dur == 0)
r = max(f(i - 1, j + 1, 0), max(f(i - 1, j + 1, 1), f(i - 1, j + 1, 2)));
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |