提出 #41762485

---

ソースコード 拡げる

#include <stdio.h>
#include <stdlib.h>
 
struct item_s {
	int x, y;
	char used;
};
 
int cmp(const void* x, const void* y) {
	struct item_s a = *(const struct item_s*)x, b = *(const struct item_s*)y;
	if (a.y != b.y) return a.y < b.y ? -1 : 1;
	return a.x < b.x ? -1 : a.x > b.x;
}
 
int N, M, H, K;
char S[212345];
struct item_s items[212345];
 
int main(void) {
	int i;
	int x = 0, y = 0, t;
	if (scanf("%d%d%d%d", &N, &M, &H, &K) != 4) return 1;
	if (scanf("%212344s", S) != 1) return 1;
	for (i = 0; i < M; i++) {
		if (scanf("%d%d", &items[i].x, &items[i].y) != 2) return 1;
		items[i].used = 0;
	}
	qsort(items, M, sizeof(*items), cmp);
	t = H;
	for (i = 0; i < N; i++) {
		struct item_s q, *r;
		switch (S[i]) {
			case 'R': x++; break;
			case 'L': x--; break;
			case 'U': y++; break;
			case 'D': y--; break;
		}
		t--;
		if (t < 0) {
			puts("No");
			return 0;
		}
		q.x = x;
		q.y = y;
		q.used = 0;
		r = bsearch(&q, items, M, sizeof(*items), cmp);
		if (r != NULL && !r->used && t < K) {
			r->used = 1;
			t = K;
		}
	}
	puts("Yes");
	return 0;
}

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

struct item_s {
	int x, y;
	char used;
};

int cmp(const void* x, const void* y) {
	struct item_s a = *(const struct item_s*)x, b = *(const struct item_s*)y;
	if (a.y != b.y) return a.y < b.y ? -1 : 1;
	return a.x < b.x ? -1 : a.x > b.x;
}

int N, M, H, K;
char S[212345];
struct item_s items[212345];

int main(void) {
	int i;
	int x = 0, y = 0, t;
	if (scanf("%d%d%d%d", &N, &M, &H, &K) != 4) return 1;
	if (scanf("%212344s", S) != 1) return 1;
	for (i = 0; i < M; i++) {
		if (scanf("%d%d", &items[i].x, &items[i].y) != 2) return 1;
		items[i].used = 0;
	}
	qsort(items, M, sizeof(*items), cmp);
	t = H;
	for (i = 0; i < N; i++) {
		struct item_s q, *r;
		switch (S[i]) {
			case 'R': x++; break;
			case 'L': x--; break;
			case 'U': y++; break;
			case 'D': y--; break;
		}
		t--;
		if (t < 0) {
			puts("No");
			return 0;
		}
		q.x = x;
		q.y = y;
		q.used = 0;
		r = bsearch(&q, items, M, sizeof(*items), cmp);
		if (r != NULL && !r->used && t < K) {
			r->used = 1;
			t = K;
		}
	}
	puts("Yes");
	return 0;
}

提出情報

ジャッジ結果