oj.uz

Submission #235729

# Submission time Handle Problem Language Result Execution time Memory
235729 2020-05-29T14:21:38 Z Autoratch Dango Maker (JOI18_dango_maker) C++14
0 / 100
 5 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 3002;

int m,n,ans;
string c[N];
bool visited[N][N];

void solve(int x,int y)
{
    int hor = 0,ver = 0;
    for(int i = x,j = y;i>=1 and j>=1 and i<=m and j<=n;i++,j--)
    {
        visited[i][j] = true;
        if(c[i-1][j]=='R' and c[i+1][j]=='W') ver++;
        if(c[i][j-1]=='R' and c[i][j+1]=='W') hor++;
    }
    for(int i = x-1,j = y+1;i>=1 and j>=1 and i<=m and j<=n;i--,j++)
    {
        visited[i][j] = true;
        if(c[i-1][j]=='R' and c[i+1][j]=='W') ver++;
        if(c[i][j-1]=='R' and c[i][j+1]=='W') hor++;
    }
    ans+=max(hor,ver);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> m >> n;
    for(int i = 1;i <= m;i++) cin >> c[i],c[i] = " "+c[i];
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) if(!visited[i][j] and c[i][j]=='G') solve(i,j);
    cout << ans;
}

Subtask #1
0 / 13.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 67.0

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