oj.uz

답안 #22444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22444 2017-04-30T04:43:19 Z 카시코이(#958, xdoju, ntopia, pps789) Young Zebra (KRIII5_YZ) C++11
0 / 7
 109 ms 52020 KB 
#include <cstdio>
#include <vector>
#include <queue>
#include <unordered_set>
#include <algorithm>
using namespace std;

int n, m;
char board[1003][1003];
int visit[1603][1603];
int di[] = { 0, 1, 0, -1 }, dj[] = { 1, 0, -1, 0 };
int outlist[10000000];

int main() {
	//freopen("input.txt", "r", stdin);
	scanf("%d %d", &n, &m);
	for (int i = 0; i < n; ++i) {
		scanf("%s", board[i]);
	}

	int cur = 0;

	for (int i = 0; i < 3 * n; ++i) {
		for (int j = 0; j < 3 * m; ++j) {
			if (visit[i][j]) continue;

			++cur;
			int cnt = 0;
			queue<pair<int, int>> q;
			visit[i][j] = cur;
			q.emplace(i, j);
			while (!q.empty()) {
				int ci = q.front().first, cj = q.front().second;
				q.pop();
				++cnt;

				for (int k = 0; k < 4; ++k) {
					int ni = ci + di[k], nj = cj + dj[k];
					if (ni < 0 || ni >= n * 3 || nj < 0 || nj >= m * 3 || visit[ni][nj]) continue;
					if (board[ni % n][nj % m] != board[i % n][j % m]) continue;
					visit[ni][nj] = cur;
					q.emplace(ni, nj);
				}
			}

			outlist[cur] = cnt;
		}
	}

	unordered_set<int> edgeset;
	for (int i = 0; i < n * 3; ++i) {
		edgeset.insert(visit[i][0]);
		edgeset.insert(visit[i][m * 3 - 1]);
	}
	for (int j = 0; j < m * 3; ++j) {
		edgeset.insert(visit[0][j]);
		edgeset.insert(visit[n * 3 - 1][j]);
	}

	for (int i = n; i < n * 2; ++i) {
		for (int j = m; j < m * 2; ++j) {
			int out = outlist[visit[i][j]];
			if (edgeset.count(visit[i][j])) out = -1;
			printf("%d", out);
			if (j < m * 2 - 1) putchar(' ');
		}
		putchar('\n');
	}
	return 0;
}

Compilation message

YZ.cpp: In function 'int main()':
YZ.cpp:16:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
                        ^
YZ.cpp:18:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", board[i]);
                        ^

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 52020 KB Output is correct
2 Incorrect 109 ms 52020 KB Extra information in the output file
3 Halted 0 ms 0 KB -