| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 252898 | 2020-07-26T12:19:20 Z | Erkhemkhuu | 무지개나라 (APIO17_rainbow) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
const ll sN = 105;
char grid[sN][sN];
void init(ll n, ll m, ll sz, ll q, ll curx, ll cury, string path) {
ll i, j;
for(i = 0; i <= n; i++)
for(j = 0; j <= m; j++)
grid[i][j] = '0';
for(i = 0; i < sz; i++) {
if(path[i] == 'N') grid[--curx][cury] = 'X';
if(path[i] == 'E') grid[curx][++cury] = 'X';
if(path[i] == 'S') grid[++curx][cury] = 'X';
if(path[i] == 'W') grid[curx][--cury] = 'X';
}
return;
}
ll colours(ll x0, ll y0, ll x1, ll y1) {
ll N = x1 - x0 + 1;
ll M = y1 - y0 + 1;
ll i, j;
char temp[sN][sN];
for(i = x0; i <= x1; i++)
for(j = y0; j <= y1; j++)
temp[i - x0 + 1][j - y0 + 1] = grid[i][j];
ll cnt = 0;
for(i = 1; i <= N; i++) {
for(j = 1; j <= M; j++) {
if(temp[i][j] == '0') {
cnt++;
queue <ll> q;
q.push(i * 1000 + j);
while(!q.empty()) {
ll v = q.front();
ll curx = v / 1000;
ll cury = v % 1000;
q.pop();
temp[curx][cury] = 'M';
if(curx - 1 >= 1 && temp[curx - 1][cury] == '0') q.push((curx - 1) * 1000 + cury);
if(cury + 1 <= M && temp[curx][cury + 1] == '0') q.push(curx * 1000 + cury + 1);
if(curx + 1 <= N && temp[curx + 1][cury] == '0') q.push((curx + 1) * 1000 + cury);
if(cury - 1 >= 1 && temp[curx][cury - 1] == '0') q.push(curx * 1000 + cury - 1);
}
}
}
}
return cnt;
}