Submission #71646

#	Time	Username	Problem	Language	Result	Execution time	Memory
71646		imsifile	Lokahian Rampart (FXCUP3_lokahia)	C++98	0 / 100	17 ms	32832 KiB

sungjin

#include "sungjin.h"

static int N, M, ba[1010][1010], chk[1010][1010], xx[4]={1,-1,0,0}, yy[4]={0,0,1,-1}; // DURL

static void dfs1(int x, int y){
	if(x<0 || y<0 || x>N+1 || y>M+1) return;
	if(chk[x][y]) return;
	chk[x][y]=-1;
	for(int i=0; i<4; i++){
		if(ba[x][y]&(1<<i)) continue;
		dfs1(x+xx[i], y+yy[i]);
	}
}

static int col;
static void dfs2(int x, int y){
	if(x<=0 || y<=0 || x>N || y>M) return;
	if(chk[x][y]) return;
	chk[x][y]=col;
	for(int i=0; i<4; i++) dfs2(x+xx[i], y+yy[i]);
}

void Init(int N_, int M_, int W, int R[], int C[], int dir[]) {
	N=N_, M=M_;
	for(int i=W; i--;){
		if(dir[i]==1) ba[R[i]][C[i]+1] |= 1<<3;
		if(dir[i]==2) ba[R[i]][C[i]-1] |= 1<<2;
		if(dir[i]==3) ba[R[i]+1][C[i]] |= 1<<1;
		if(dir[i]==4) ba[R[i]-1][C[i]] |= 1<<0;
	}
	dfs1(0,0);
	for(int i=1; i<=N; i++){
		for(int j=1; j<=M; j++){
			if(chk[i][j]) continue;
			++col; dfs2(i,j);
		}
	}
}

int WereSameTerritory(int R1, int C1, int R2, int C2) {
	if(chk[R1][C1]<0 || chk[R2][C2]<0) return 0;
	return chk[R1][C1] == chk[R2][C2];
}

dowoon

#include "dowoon.h"
#include <memory.h>

static int N, M, xx[4]={1,-1,0,0}, yy[4]={0,0,1,-1};
int hist[1010][1010][2][2], ba[1010][1010], sz;

int myAsk(int r1, int c1, int r2, int c2){
	if(r2<=0 || c2<=0 || r2>N || c2>M) return 0;
	if(hist[r1][c1][r2-r1][c2-c1]>=0) return hist[r1][c1][r2-r1][c2-c1];
	return hist[r1][c1][r2-r1][c2-c1]=Ask(r1,c1,r2,c2);
}

void dfs(int x, int y){
	if(x<=0 || y<=0 || x>N || y>M) return;
	if(ba[x][y]) return;
	ba[x][y]=1, sz++;

	for(int i=0; i<4; i++){
		if(myAsk(x,y,x+xx[i],y+yy[i])) dfs(x+xx[i], y+yy[i]);
	}
}

int Guess(int N_, int M_) {
	N=N_, M=M_;
	memset(hist, -1, sizeof(hist));
	for(int i=1; i<=N; i++){
		for(int j=1; j<=M; j++){
			sz=0; dfs(i,j);
			if(sz*2 > N*M) return 1;
		}
	}
	return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 87