# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123046 | arnold518 | Dango Maker (JOI18_dango_maker) | C++14 | 2059 ms | 94392 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>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 10;
const int MAXVAL = 6e4;
int N, M;
char A[MAXN+10][MAXN+10];
int pow3[MAXN+10], dp[MAXN+10][MAXN+10][MAXVAL+10];
int solve(int y, int x, int mask)
{
if(y==N) return 0;
int &ret=dp[y][x][mask];
if(ret!=-1) return ret;
ret=0;
if(x+1==M) ret=max(ret, solve(y+1, 0, mask/3+pow3[M-1]*(max(mask%3-1, 0))));
else ret=max(ret, solve(y, x+1, mask/3+pow3[M-1]*(max(mask%3-1, 0))));
if(A[y][x]=='R')
{
if(y+2<N && A[y][x]=='R' && A[y+1][x]=='G' && A[y+2][x]=='W' && mask%3==0)
{
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... |