Submission #66008437

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <stdlib.h>
int N, M, Q;
int query[212345][3];
struct kengen_s {
  int user, page;
};
int cmp(const void* x, const void* y) {
  struct kengen_s a = *(const struct kengen_s*)x, b = *(const struct kengen_s*)y;
  if (a.user != b.user) return a.user < b.user ? -1 : 1;
  return a.page < b.page ? -1 : a.page > b.page;
}
int zac = 0;
struct kengen_s zal[212345];
char is_ok[212345];
char is_allok[212345];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int N, M, Q;
int query[212345][3];

struct kengen_s {
	int user, page;
};

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

int zac = 0;
struct kengen_s zal[212345];

char is_ok[212345];
char is_allok[212345];

int get_id(int user, int page) {
	struct kengen_s query = { user, page };
	int l = 0, r = zac - 1;
	while (l <= r) {
		int m = l + (r - l) / 2;
		int c = cmp(&zal[m], &query);
		if (c == 0) return m;
		if (c < 0) l = m + 1; else r = m - 1;
	}
	return zac;
}

int main(void) {
	int i;
	int zac_raw = 0;
	if (scanf("%d%d%d", &N, &M, &Q) != 3) return 1;
	for (i = 1; i <= Q; i++) {
		if (scanf("%d%d", &query[i][0], &query[i][1]) != 2) return 1;
		if (query[i][0] != 2) {
			if (scanf("%d", &query[i][2]) != 1) return 1;
		}
	}

	/* 座標圧縮 */
	for (i = 1; i <= Q; i++) {
		if (query[i][0] == 1) {
			zal[zac_raw++] = (struct kengen_s){ query[i][1], query[i][2] };
		}
	}
	qsort(zal, zac_raw, sizeof(*zal), cmp);
	zac = zac_raw > 0;
	for (i = 1; i < zac_raw; i++) {
		if (zal[zac - 1].user != zal[i].user || zal[zac - 1].page != zal[i].page) {
			zal[zac++] = zal[i];
		}
	}

	for (i = 1; i <= Q; i++) {
		switch (query[i][0]) {
			case 1:
				{
					int id = get_id(query[i][1], query[i][2]);
					if (id >= zac) {
						puts("ERROR!!!!!");
						return 42;
					}
					is_ok[id] = 1;
				}
				break;
			case 2:
				is_allok[query[i][1]] = 1;
				break;
			case 3:
				{
					int id = get_id(query[i][1], query[i][2]);
					puts(is_allok[query[i][1]] || (id < zac && is_ok[id]) ? "Yes" : "No");
				}
				break;
		}
	}

	return 0;
}

Submission Info

Judge Result