제출 #249892

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
249892		MarcoMeijer	Dango Maker (JOI18_dango_maker)	C++14	13 / 100	1 ms	384 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

//===================//
//  Added libraries  //
//===================//

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 4000;
int n, m;
char gr[MX][MX];
string cur;
int dx[]={1,0};
int dy[]={0,1};
int ans = 0;

bool inside(int x, int y) {return x>=0 && x<n && y>=0 && y<m;}
void findRGW(int x, int y) {
    RE(d,2) {
        cur = "";
        RE(i,3) {
            int nx = x+dx[d]*i;
            int ny = y+dy[d]*i;
            if(inside(nx,ny)) cur += gr[nx][ny];
        }
        if(cur == "RGW") {
            RE(i,3) {
                int nx = x+dx[d]*i;
                int ny = y+dy[d]*i;
                gr[nx][ny] = 'X';
            }
            ans++;
        }
    }
}

void program() {
    cin>>n>>m;
    RE(i,n) RE(j,m) cin>>gr[i][j];
    RE(i,n) RE(j,m) findRGW(i,j);
    cout<<ans<<endl;
}

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