oj.uz

Submission #379962

# Submission time Handle Problem Language Result Execution time Memory
379962 2021-03-19T20:07:30 Z NintsiChkhaidze Dango Maker (JOI18_dango_maker) C++14
0 / 100
 1 ms 512 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
using namespace std;
char a[3005][3005];
int dp[3005][3005];
int main(){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
    int n,m;
    cin>>n>>m;
    
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            cin>>a[i][j];
           
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++){
            dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1];
           
           if (a[i][j] == 'R' && a[i][j + 1] == 'G' && a[i][j + 2] == 'W') dp[i][j]++;
            else if (a[i][j] == 'R' && a[i + 1][j] == 'G' && a[i + 2][j] == 'W') dp[i][j]++;
        }
    
    cout<<dp[n][m];
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Incorrect 1 ms 512 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Incorrect 1 ms 512 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Incorrect 1 ms 512 KB Output isn't correct
7 Halted 0 ms 0 KB -