답안 #22655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
22655	2017-04-30T06:10:35 Z	dhsrhkdgus(#943, kjp4155, cok1973, dhsrhkdgus)	Young Zebra (KRIII5_YZ)	C++11	0 / 7	66 ms	47172 KB

YZ

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll,ll> Pll;

#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()

#define ABS(x) (((x) > 0 ) ? (x) : (-(x)))
#define MAX2(x, y) (((x) > (y)) ? (x) : (y))
#define MIN2(x, y) (((x) < (y)) ? (x) : (y))

#define MAX3(x, y, z) ( (x) > (y)  ? ( (x) > (z) ? (x) : (z)  ) : ( (y) > (z) ? (y) : (z) )  )
#define MIN3(x, y, z) ( (x) < (y)  ? ( (x) < (z) ? (x) : (z)  ) : ( (y) < (z) ? (y) : (z) )  )
#define MID3(val1,val2,val3) MAX2(MIN2(MAX2(val1,val2),val3),MIN2(val1,val2))

#define geti1(X) scanf("%d",&X)
#define geti2(X,Y) scanf("%d%d",&X,&Y)
#define geti3(X,Y,Z) scanf("%d%d%d",&X,&Y,&Z)
#define geti4(X,Y,Z,W) scanf("%d%d%d%d",&X,&Y,&Z,&W)

#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define INF 987654321
#define IINF 987654321987654321

int N,M,NN,MM;
int xx[4] = {1,-1,0,0}, yy[4] = {0,0,1,-1};

char p[500][500]; int ans[500][500]; bool vis[2000][2000];
int sz[500][500]; int group[2000][2000];
char s[2000][2000];
int g = 0; int gsize[2000*2000];
bool inbound(int y, int x ){
	if( x < 0 || y < 0 || x >= MM || y >= NN ) return false;
	return true;
}
int dfs(int y, int x){
	int sz = 1; group[y][x] = g;
	vis[y][x] = true;
	rep(k,4){
		int ny = y + yy[k]; int nx = x + xx[k];
		if( !inbound(ny,nx) ) continue;
		if( vis[ny][nx] ) continue;
		if( s[y][x] == s[ny][nx] ) sz += dfs(ny,nx);
	}
	return sz;
}

int main(void){
	geti(N,M);
	rep(i,N) scanf("%s",p[i]);
	NN = N*3; MM = M*3;

	rep(i,NN){
		rep(j,MM){
			s[i][j] = p[i%N][j%M];	
		}
	}
	
	rep(i,NN){
		rep(j,MM)if( !vis[i][j] ) {
			g++;
			gsize[g] = dfs(i,j);
		}
	}
	/*
	rep(i,NN){
		rep(j,MM) printf("%d ",group[i][j]);
		printf("\n");
	}
	*/
	rep(i,N){
		rep(j,M){
	
			int y = i + N; int x = j + M; 
			bool ok = false;
			ok |= (group[y][x] == group[y-N][x]);
			ok |= (group[y][x] == group[y+N][x]);

			ok |= (group[y][x] == group[y-N][x-M]);
			ok |= (group[y][x] == group[y-N][x+M]);
			ok |= (group[y][x] == group[y+N][x-M]);
			ok |= (group[y][x] == group[y+N][x+M]);
			
			ok |= (group[y][x] == group[y][x+M]);
			ok |= (group[y][x] == group[y][x-M]);
			
			if( ok ){
				printf("-1 "); continue;
			}
			printf("%d ",gsize[group[y][x]]);
		}
		printf("\n");
	}

}	

Compilation message

YZ.cpp: In function 'int main()':
YZ.cpp:74:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  geti(N,M);
           ^
YZ.cpp:75:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  rep(i,N) scanf("%s",p[i]);
                           ^

Subtask #1

0.0 / 7.0

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