답안 #23110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
23110	2017-05-03T05:55:54 Z	sgc109	Young Zebra (KRIII5_YZ)	C++11	0 / 7	126 ms	14840 KB

YZ

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const int INF = 0x3c3c3c3c;
const long long INFL = 0x3c3c3c3c3c3c3c3c;

int N,M;
char pane[403][403];
char pane2[1203][1203];
int parent[1440003];
int size[1440003];
int calcId(int i, int j){
	return i*3*M + j;
}
int find(int p){
	if(p==parent[p]) return p;
	return parent[p] = find(parent[p]);
}
void merge(int a, int b){
	a = find(a), b = find(b);
	if(a==b) return;
	parent[a] = b;
	size[b] += size[a];
}
bool inRange(int i, int j){
	return 0 <= i && i < 3*N && 0 <= j && j < 3*M;
}

int main() {
	for(int i = 0 ; i < 1440003; i++) parent[i] = i, size[i] = 1;
	scanf("%d%d", &N, &M);
	for(int i = 0 ; i < N ; i++){
		scanf("%s",pane[i]);
	}

	for(int i = 0 ; i < 3*N; i++){
		for(int j = 0 ; j < 3*M; j++){
			pane2[i][j] = pane[i%N][j%M];
		}
	}

	for(int i = 0 ; i < 3*N; i++){
		for(int j = 0 ; j < 3*M; j++){
			for(int k = 0 ; k < 4; k++){
				int ni = i+"1201"[k]-'0'-1;
				int nj = j+"2110"[k]-'0'-1;
				if(!inRange(ni, nj) || pane2[i][j] != pane2[ni][nj]) continue;
				merge(calcId(i, j), calcId(ni, nj));
			}
		}
	}
	for(int i = N; i < 2*N; i++){
		for(int j = M; j < 2*M; j++){
			for(int k = 0 ; k < 4; k++){
				int ni = i+("1201"[k]-'0'-1)*N;	
				int nj = j+("2110"[k]-'0'-1)*M;
				if(find( calcId(i, j) ) == find( calcId(ni, nj) )) size[find(calcId(i, j))] = -1; 
			}
		}
	}

	for(int i = N; i < 2*N; i++){
		for(int j = M; j < 2*M; j++){
			printf("%d ",size[find(calcId(i, j))]);
		}
		printf("\n");
	}
	return 0;
}

Compilation message

YZ.cpp: In function 'int main()':
YZ.cpp:31: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:33:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",pane[i]);
                      ^

Subtask #1

0.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	123 ms	14840 KB	Output is partially correct
2	Incorrect	126 ms	14840 KB	Output isn't correct
3	Halted	0 ms	0 KB	-