oj.uz

Submission #749602

# Submission time Handle Problem Language Result Execution time Memory
749602 2023-05-28T09:53:07 Z tch1cherin Dango Maker (JOI18_dango_maker) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, M;
  cin >> N >> M;
  vector<string> s(N);
  for (auto &v : s) {
    cin >> v;
  }
  int ans = 0;
  vector<pair<int, int>> order;
  for (int m = 0; m < N + M; m++) {
    for (int i = m; i >= 0; i--) {
      int j = m - i;
      if (i >= N || j >= M) {
        continue;
      }
      order.emplace_back(i, j);
    }
  }
  for (auto [i, j] : order) {
    if (s[i][j] == 'W') {
      if (i >= 2 && s[i - 1][j] == 'G' && s[i - 2][j] == 'R') {
        ans++;
        s[i][j] = s[i - 1][j] = s[i - 2][j] = '*'; 
      }
      if (j >= 2 && s[i][j - 1] == 'G' && s[i][j - 2] == 'R') {
        ans++;
        s[i][j] = s[i][j - 1] = s[i][j - 2] = '*';
      }
    }
  }
  cout << ans << "\n";
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -