# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224233 | Ruxandra985 | Dango Maker (JOI18_dango_maker) | C++14 | 5 ms | 384 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;
char a[3010][3010];
int f[3010][3010] , vert , oriz , n , m , sol;
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int i , j;
fscanf (fin,"%d%d\n",&n,&m);
for (i = 1 ; i <= n ; i++)
fgets(a[i] + 1 , m + 10 , fin);
for (i = 1 ; i <= n ; i++){
for (j = 1 ; j <= m ; j++){
if (a[i][j] == 'W'){
if (i >= 3 && a[i - 1][j] == 'G' && a[i - 2][j] == 'R')
f[i][j] = max(f[i][j] , 1 + f[i - 3][j] + f[i][j - 1] - f[i - 3][j - 1]);
if (j >= 3 && a[i][j - 1] == 'G' && a[i][j - 2] == 'R')
f[i][j] = max(f[i][j] , 1 + f[i][j - 3] + f[i - 1][j] - f[i - 1][j - 3]);
f[i][j] = max(f[i][j] , f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1]);
}
else f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1];
}
}
fprintf (fout,"%d",f[n][m]);
return 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... |