Submission #714887

#	Time	Username	Problem	Language	Result	Execution time	Memory
714887		epicci23	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	344 KiB

dango_maker

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}

int n,m;
vector<vector<bool>> mark;

bool check1(int x,int y)
{
  return y+2<m && mark[x][y]==0 && mark[x][y+1]==0 && mark[x][y+2]==0;
}

bool check2(int x,int y)
{
  return x+2<n && mark[x][y]==0 && mark[x+1][y]==0 && mark[x+2][y]==0;
}

void solve()
{
  n=in(),m=in();
  int ans=0;
  vector<string> v;
  for(int i=0;i<n;i++)
  {
    string c=in2();
    v.pb(c);
  }
  
  mark.assign(n,vector<bool>(m,0));

  for(int i=0;i<n;i++)
  {
    for(int j=0;j<m;j++)
    {
      if(check1(i,j) && v[i][j]=='R' && v[i][j+1]=='G' && v[i][j+2]=='W')
      {
        ans++;
        mark[i][j]=mark[i][j+1]=mark[i][j+2]=1;
      }
      if(check2(i,j) && v[i][j]=='R' && v[i+1][j]=='G' && v[i+2][j]=='W')
      {
        ans++;
        mark[i][j]=mark[i+1][j]=mark[i+2][j]=1;
      }
    }
  }

  cout << ans << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message (stderr)

dango_maker.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

• Subtask 1: 13 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67