oj.uz

Submission #780122

# Submission time Handle Problem Language Result Execution time Memory
780122 2023-07-12T06:45:23 Z mychecksedad Dango Maker (JOI18_dango_maker) C++17
0 / 100
 90 ms 262144 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 1e7+100, M = 1e5+10, K = 20;


int n, m;
string s[N];
vector<pair<int, int>> g[N][2];
vector<bool> v(N);
vector<array<bool, 2>> vis(N);

pair<int, int> dfs(int x, int p){
  if(!v[x]) return {0, 0};
  pair<int, int> ans = {1, 0};
  vis[x][p] = 1;
  for(auto u: g[x][p]){
    if(vis[u.first][u.second]) continue;
    auto dp = dfs(u.first, u.second);
    ans.first += dp.second;
    ans.second += dp.first;
  }
  return ans;
}

void solve(){
  cin >> n >> m;
  for(int i = 0; i < n; ++i) cin >> s[i];
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < m; ++j){
      if(i < n - 2){
        int x = i*m+j;
        if(s[i][j] == 'R' && s[i+1][j] == 'G' && s[i+2][j] == 'W'){
          if(v[x]) g[x][0].pb({x, 1}), g[x][1].pb({x, 0});
          if(v[x+m]) g[x][0].pb({x+m-1, 1}), g[x+m-1][1].pb({x, 0});
          if(v[x+m+m]) g[x][0].pb({x+m+m-2, 1}), g[x+2*m-2][1].pb({x, 0});
          v[x] = v[x+m] = v[x+m+m] = 1;
        }
      }
      if(j < m-2){
        int x = i*m+j;

        if(s[i][j] == 'R' && s[i][j+1] == 'G' && s[i][j+2] == 'W'){
          if(v[x]) g[x][1].pb({x, 0}), g[x][0].pb({x, 1});
          if(v[x+1]) g[x][1].pb({x+1-m, 0}), g[x+1-m][0].pb({x, 1});
          if(v[x+2]) g[x][1].pb({x+2-m-m, 0}), g[x+2-2*m][0].pb({x, 1});
          v[x] = v[x+1] = v[x+2] = 1;
        }
      }
    }
  }
  int ans = 0;
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < m; ++j){
      if(s[i][j] != 'R') continue;
      if(!vis[i*m+j][0] || !vis[i*m+j][1]){
        int t = 0;
        if(!vis[i*m+j][1])
          t = 1;
        auto dp = dfs(i*m+j, t);
        ans += max(dp.first, dp.second);
      }
    }
  }
  cout << ans;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int T = 1, aa;
  // cin >> T;aa=T;
  while(T--){
    // cout << "Case #" << aa-T << ": ";
    solve();
  }
  return 0;
 
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:76:14: warning: unused variable 'aa' [-Wunused-variable]
   76 |   int T = 1, aa;
      |              ^~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 90 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 90 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Runtime error 90 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -