# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224062 | Ruxandra985 | Dango Maker (JOI18_dango_maker) | C++14 | 5 ms | 512 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;
void fill (int i , int j){
f[i][j] = 1;
if (a[i][j] == 'R'){
if (a[i][j + 1] == 'G' && a[i][j + 2] == 'W' && !f[i][j + 1] && !f[i][j + 2]){
oriz++;
fill (i , j + 1);
fill (i , j + 2);
}
if (a[i + 1][j] == 'G' && a[i + 2][j] == 'W' && !f[i + 1][j] && !f[i + 2][j]){
vert++;
fill (i + 1 , j);
fill (i + 2 , j);
}
}
else if (a[i][j] == 'G'){
if (a[i][j - 1] == 'R' && a[i][j + 1] == 'W' && !f[i][j + 1] && !f[i][j - 1]){
oriz++;
fill (i , j - 1);
fill (i , j + 1);
}
if (a[i - 1][j] == 'R' && a[i + 1][j] == 'W' && !f[i - 1][j] && !f[i + 1][j]){
vert++;
fill (i + 1 , j);
fill (i - 1 , j);
}
}
else {
if (a[i][j - 1] == 'G' && a[i][j - 2] == 'R' && !f[i][j - 1] && !f[i][j - 2]){
oriz++;
fill (i , j - 1);
fill (i , j - 2);
}
if (a[i - 1][j] == 'G' && a[i - 2][j] == 'R' && !f[i - 1][j] && !f[i - 2][j]){
vert++;
fill (i - 1 , j);
fill (i - 2 , j);
}
}
}
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , m , i , j , sol = 0;
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 (!f[i][j] && a[i][j] == 'R'){
vert = oriz = 0;
fill (i , j);
sol = sol + max(vert , oriz);
}
}
}
fprintf (fout,"%d",sol);
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... |