Submission #22483

#	Time	Username	Problem	Language	Result	Execution time	Memory
22483		카시코이 (#40)	Young Zebra (KRIII5_YZ)	C++98	2 / 7	56 ms	113144 KiB

YZ

#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;

int n, m;
char board[2603][2603];
int visit[2603][2603];
int di[] = { 0, 1, 0, -1 }, dj[] = { 1, 0, -1, 0 };
int outlist[20000000];

int main() {
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	scanf("%d %d", &n, &m);
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			scanf(" %c", &board[i][j]);
		}
	}
	for (int i = 0; i < n * 3; ++i) {
		for (int j = 0; j < m * 3; ++j) {
			board[i][j] = board[i % n][j % m];
		}
	}

	int cur = 0;

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

			++cur;
			int cnt = 0;
			queue<pair<int, int> > q;
			visit[i][j] = cur;
			q.push(make_pair(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] + n) % n, nj = (cj + dj[k] + m) % m;
					if (visit[ni][nj] != 0) continue;
					if (board[ni][nj] != board[i][j]) continue;
					visit[ni][nj] = cur;
					q.push(make_pair(ni, nj));
				}
			}

			outlist[cur] = cnt;
		}
	}

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			int out = outlist[visit[i][j]];
			printf("%d ", out);
		}
		printf("\n");
	}
	return 0;
}

Compilation message (stderr)

YZ.cpp: In function 'int main()':
YZ.cpp:17: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:20:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf(" %c", &board[i][j]);
                              ^

• Subtask 1: 2 / 7