제출 #712210

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

dango_maker

#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n";
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 3005

const int modulo = 1e9 + 7;

int arr[N][N], done[N][N];

int32_t main()
{
	fastio();

	map<char, int> val;
	val['R'] = 1, val['G'] = 2, val['W'] = 3;

	int n, m;
	cin>>n>>m;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			char tmp;
			cin>>tmp;
			arr[i][j] = val[tmp];
		}
	}

	int ans = 0;
	for (int i = 1; i <= min(n, m); i++)
	{
		for (int j = 1; j <= m - 2; j++)
		{
			if (done[i][j] || done[i][j + 1] ||done[i][j + 2]) continue;
			int val = arr[i][j] * 100 + arr[i][j + 1] * 10 + arr[i][j + 2];
			if (val == 123)
			{
				//cout<<i<<sp<<j<<sp<<1<<endl;
				done[i][j] = 1, done[i][j + 1] = 1, done[i][j + 2] = 1;
				ans++;
			}
		}
		
			
		for (int j = 1; j <= n - 2; j++)
		{
			if (done[j][i] || done[j + 1][i] || done[j + 2][i]) continue;
			int val = arr[j][i] * 100 + arr[j + 1][i] * 10 + arr[j + 2][i];
			if (val == 123)
			{
				//cout<<i<<sp<<j<<sp<<2<<endl;
				done[j][i] = 1, done[j + 1][i] = 1, done[j + 2][i] = 1;
				ans++;
			}
		}
		
			
	}

	cout<<ans<<endl;
	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " seconds\n";
}

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