Submission #480136

#TimeUsernameProblemLanguageResultExecution timeMemory
480136rainboyChecker (COCI19_checker)C11
110 / 110
120 ms6012 KiB
#include <stdio.h>

#define N	200000

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int ii[N], jj[N];

void sort(int *hh, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, h = hh[l + rand_() % (r - l)], tmp;

		while (j < k) {
			int c = ii[hh[j]] != ii[h] ? ii[hh[j]] - ii[h] : jj[h] - jj[hh[j]];

			if (c == 0)
				j++;
			else if (c < 0) {
				tmp = hh[i], hh[i] = hh[j], hh[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = hh[j], hh[j] = hh[k], hh[k] = tmp;
			}
		}
		sort(hh, l, i);
		l = k;
	}
}

int main() {
	static char cc[N + 1];
	static int hh[N];
	int n, h, i, cnt, ok;

	scanf("%*d%d%s", &n, cc);
	for (i = 0; i < n; i++)
		cc[i] -= '0';
	for (i = 1; i < n; i++)
		cc[i] ^= cc[i - 1];
	ok = cc[n - 1] == 0;
	for (h = 0; h < n - 3; h++) {
		int c, tmp;

		scanf("%d%d%d", &ii[h], &jj[h], &c), ii[h]--, jj[h]--;
		if (ii[h] > jj[h])
			tmp = ii[h], ii[h] = jj[h], jj[h] = tmp;
		if ((cc[jj[h] - 1] ^ (ii[h] == 0 ? 0 : cc[ii[h] - 1])) != c)
			ok = 0;
		hh[h] = h;
	}
	sort(hh, 0, n - 3);
	if (n <= 2000 && 1) {
		int h_;

		for (h = 0; h < n - 3; h++)
			for (h_ = h + 1; h_ < n - 3; h_++)
				if (!(ii[h] <= ii[h_] && jj[h_] <= jj[h] || ii[h_] <= ii[h] && jj[h] <= jj[h_])
						&& !(jj[h] <= ii[h_] || jj[h_] <= ii[h]) || ii[h] == ii[h_] && jj[h] == jj[h_]) {
					printf("neispravna triangulacija\n");
					return 0;
				}
	} else {
		cnt = 0;
		for (h = 0; h < n - 3; h++) {
			int h_ = hh[h];

			while (cnt && jj[hh[cnt - 1]] <= ii[h_])
				cnt--;
			if (cnt && (jj[h_] > jj[hh[cnt - 1]] || ii[h_] == ii[hh[cnt - 1]] && jj[h_] == jj[hh[cnt - 1]])) {
				printf("neispravna triangulacija\n");
				return 0;
			}
			hh[cnt++] = h_;
		}
	}
	printf(ok ? "tocno\n" : "neispravno bojenje\n");
	return 0;
}

Compilation message (stderr)

checker.c: In function 'main':
checker.c:62:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   62 |     if (!(ii[h] <= ii[h_] && jj[h_] <= jj[h] || ii[h_] <= ii[h] && jj[h] <= jj[h_])
      |           ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
checker.c:63:7: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   62 |     if (!(ii[h] <= ii[h_] && jj[h_] <= jj[h] || ii[h_] <= ii[h] && jj[h] <= jj[h_])
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   63 |       && !(jj[h] <= ii[h_] || jj[h_] <= ii[h]) || ii[h] == ii[h_] && jj[h] == jj[h_]) {
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
checker.c:74:70: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   74 |    if (cnt && (jj[h_] > jj[hh[cnt - 1]] || ii[h_] == ii[hh[cnt - 1]] && jj[h_] == jj[hh[cnt - 1]])) {
      |                                            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
checker.c:40:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  scanf("%*d%d%s", &n, cc);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~
checker.c:49:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |   scanf("%d%d%d", &ii[h], &jj[h], &c), ii[h]--, jj[h]--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...