oj.uz

Submission #946966

# Submission time Handle Problem Language Result Execution time Memory
946966 2024-03-15T08:40:02 Z ezzzay Dango Maker (JOI18_dango_maker) C++14
13 / 100
 2000 ms 4572 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define double long double
const int N=3e3+6;
char arr[N][N];
int ans=0;
int n,m;
int dp[N][N];
void fun(int y, int x, int w){
    if(dp[y][x]>w+1)return;
    dp[y][x]=w;
    ans=max(ans,w);
    for(int i=y;i<=n;i++){
        if(i==y){
            for(int j=x;j<=m;j++){
                if(arr[i][j]=='R' and arr[i][j+1]=='G' and arr[i][j+2]=='W'){
                    arr[i][j]='X';
                    arr[i][j+1]='X';
                    arr[i][j+2]='X';
                    fun(i,j,w+1);
                    arr[i][j]='R';
                    arr[i][j+1]='G';
                    arr[i][j+2]='W';
                }
                if(arr[i][j]=='R' and arr[i+1][j]=='G' and arr[i+2][j]=='W'){
                    
                    arr[i][j]='X';
                    arr[i+1][j]='X';
                    arr[i+2][j]='X';
                    fun(i,j,w+1);
                    arr[i][j]='R';
                    arr[i+1][j]='G';
                    arr[i+2][j]='W';
                }
            }
        }
        else{
            for(int j=1;j<=m;j++){
                if(arr[i][j]=='R' and arr[i][j+1]=='G' and arr[i][j+2]=='W'){
                    arr[i][j]='X';
                    arr[i][j+1]='X';
                    arr[i][j+2]='X';
                    fun(i,j,w+1);
                    arr[i][j]='R';
                    arr[i][j+1]='G';
                    arr[i][j+2]='W';
                }
                if(arr[i][j]=='R' and arr[i+1][j]=='G' and arr[i+2][j]=='W'){
                    
                    arr[i][j]='X';
                    arr[i+1][j]='X';
                    arr[i+2][j]='X';
                    fun(i,j,w+1);
                    arr[i][j]='R';
                    arr[i+1][j]='G';
                    arr[i+2][j]='W';
                }
            }
        }
    }
}
signed main(){
    cin>>n>>m;
    int cnt=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            dp[i][j]=0;
            cin>>arr[i][j];
        }
    }
    fun(1,1,0);
    cout<<ans;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:67:9: warning: unused variable 'cnt' [-Wunused-variable]
   67 |     int cnt=0;
      |         ^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 6 ms 4444 KB Output is correct
21 Correct 6 ms 4572 KB Output is correct
22 Correct 41 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Execution timed out 2097 ms 4444 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 6 ms 4444 KB Output is correct
21 Correct 6 ms 4572 KB Output is correct
22 Correct 41 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Execution timed out 2097 ms 4444 KB Time limit exceeded
28 Halted 0 ms 0 KB -