oj.uz

답안 #23115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23115 2017-05-03T06:30:15 Z sgc109 Young Zebra (KRIII5_YZ) C++11
2 / 7
 189 ms 15652 KB 
#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]-'1'+3*N)%(3*N);
				int nj = (j+"2110"[k]-'1'+3*M)%(3*M);
				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
2.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 14840 KB Output is correct
2 Correct 159 ms 14840 KB Output is correct
3 Partially correct 156 ms 14840 KB Output is partially correct
4 Partially correct 163 ms 14840 KB Output is partially correct
5 Correct 159 ms 14840 KB Output is correct
6 Correct 156 ms 14840 KB Output is correct
7 Correct 153 ms 14840 KB Output is correct
8 Correct 123 ms 14988 KB Output is correct
9 Correct 149 ms 14840 KB Output is correct
10 Correct 126 ms 15016 KB Output is correct
11 Correct 159 ms 14840 KB Output is correct
12 Correct 159 ms 14840 KB Output is correct
13 Correct 146 ms 14840 KB Output is correct
14 Correct 126 ms 14840 KB Output is correct
15 Correct 136 ms 14840 KB Output is correct
16 Correct 129 ms 14840 KB Output is correct
17 Correct 113 ms 15644 KB Output is correct
18 Correct 109 ms 15652 KB Output is correct
19 Correct 149 ms 14840 KB Output is correct
20 Correct 189 ms 14840 KB Output is correct
21 Correct 106 ms 14840 KB Output is correct
22 Correct 133 ms 14840 KB Output is correct
23 Correct 169 ms 14840 KB Output is correct
24 Correct 153 ms 14840 KB Output is correct
25 Correct 139 ms 14840 KB Output is correct
26 Correct 0 ms 14840 KB Output is correct
27 Correct 0 ms 14840 KB Output is correct
28 Correct 6 ms 14840 KB Output is correct
29 Correct 6 ms 14840 KB Output is correct
30 Correct 3 ms 14840 KB Output is correct
31 Correct 3 ms 14840 KB Output is correct
32 Correct 0 ms 14840 KB Output is correct
33 Correct 6 ms 14840 KB Output is correct
34 Correct 6 ms 14840 KB Output is correct
35 Correct 0 ms 14840 KB Output is correct
36 Correct 9 ms 14840 KB Output is correct
37 Correct 13 ms 14840 KB Output is correct
38 Correct 6 ms 14840 KB Output is correct
39 Correct 9 ms 14840 KB Output is correct
40 Correct 9 ms 14840 KB Output is correct