Submission #26576

#	Time	Username	Problem	Language	Result	Execution time	Memory
26576		kajebiii	Young Zebra (KRIII5_YZ)	C++14	7 / 7	56 ms	10020 KiB

YZ

#include <stdio.h>
#include <algorithm>
#include <vector>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <string.h>
 
using namespace std;
 
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long ll;
typedef pair<int, int> pi;
 
const int MAX_N = 4e2 + 10;
 
int N, M;
char Mp[MAX_N*3][MAX_N*3];
int Chk[MAX_N][MAX_N];
pi Last[MAX_N][MAX_N];
bool Vis[MAX_N*3][MAX_N*3];
 
int main() {
	scanf("%d%d", &N, &M);
	for(int i=0; i<N; i++) scanf("%s", Mp[i]);
	for(int i=0; i<3*N; i++) for(int j=0; j<3*M; j++) Mp[i][j] = Mp[i%N][j%M];
	for(int x=0; x<N; x++) for(int y=0; y<M; y++) {
		if(Chk[x][y] != 0) continue;
 
		pi s = make_pair(x+N*1000, y+M*1000);
		queue<pi> Q; Q.push(s); Vis[x][y] = true; Last[x][y] = s;
		vector<pi> list;
 
		bool impos = false;
		while(!Q.empty()) {
			int a, b; tie(a, b) = Q.front(); 
			list.push_back(Q.front()); Q.pop();
 
			for(int k=0; k<4; k++) {
				int na = a + "1012"[k] - '1', nb = b + "0121"[k] - '1';
				if(Mp[na%N][nb%M] != Mp[a%N][b%M]) continue;
				if(Vis[na%N][nb%M]) {
					if(Last[na%N][nb%M] != make_pair(na, nb))
						impos = true;
					continue;
				}
				Vis[na%N][nb%M] = true;
				Last[na%N][nb%M] = make_pair(na, nb);
				Q.push(make_pair(na, nb));
			}
		}
		int val = list.size(); if(impos) val = -1;
		for(pi &e : list) Chk[e.first%N][e.second%M] = val;
	}
	for(int i=0; i<N; i++, puts("")) for(int j=0; j<M; j++) printf("%d ", Chk[i][j]);
	return 0;
}

Compilation message (stderr)

YZ.cpp: In function 'int main()':
YZ.cpp:26:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
                       ^
YZ.cpp:27:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0; i<N; i++) scanf("%s", Mp[i]);
                                           ^

• Subtask 1: 7 / 7