提出 #64661407

---

ソースコード 拡げる

#include <stdio.h>
#include <stdlib.h>

#define MOD_BY 759149
#define MULT 414157

int get_hash(int x, int y) {
	return (int)((((long long)x * MULT + y) % MOD_BY + MOD_BY) % MOD_BY);
}

struct element_s {
	int x, y;
	struct element_s* next;
};

struct element_s* ht[MOD_BY];

void ht_add(int x, int y) {
	int hash = get_hash(x, y);
	struct element_s** p = &ht[hash];
	while (*p != NULL) {
		if ((*p)->x == x && (*p)->y == y) return;
		p = &(*p)->next;
	}
	*p = malloc(sizeof(**p));
	if (*p == NULL) exit(2);
	**p = (struct element_s){ x, y, NULL };
}

int ht_exists(int x, int y) {
	int hash = get_hash(x, y);
	struct element_s* p = ht[hash];
	while (p != NULL) {
		if (p->x == x && p->y == y) return 1;
		p = p->next;
	}
	return 0;
}

int N, R, C;
char S[212345];

int main(void) {
	int dx = 0, dy = 0;
	int i;
	if (scanf("%d%d%d", &N, &R, &C) != 3) return 1;
	if (scanf("%212344s", S) != 1) return 1;
	ht_add(0, 0);
	for (i = 0; i < N; i++) {
		switch (S[i]) {
			case 'N': dy++; break;
			case 'W': dx++; break;
			case 'S': dy--; break;
			case 'E': dx--; break;
		}
		ht_add(dx, dy);
		putchar('0' + ht_exists(C + dx, R + dy));
	}
	putchar('\n');
	return 0;
}

/*

逆にスポーンポイントと高橋君を移動させる

*/

提出情報

ジャッジ結果