oj.uz

Submission #480137

# Submission time Handle Problem Language Result Execution time Memory
480137 2021-10-14T19:25:45 Z rainboy Checker (COCI19_checker) C
110 / 110
 110 ms 2880 KB 
#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);
	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

checker.c: In function 'main':
checker.c:63:69: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   63 |   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]--;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 2688 KB Output is correct
2 Correct 96 ms 2756 KB Output is correct
3 Correct 97 ms 2756 KB Output is correct
4 Correct 104 ms 2808 KB Output is correct
5 Correct 97 ms 2800 KB Output is correct
6 Correct 95 ms 2748 KB Output is correct
7 Correct 100 ms 2880 KB Output is correct
8 Correct 94 ms 2756 KB Output is correct
9 Correct 100 ms 2800 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 2700 KB Output is correct
2 Correct 98 ms 2796 KB Output is correct
3 Correct 97 ms 2800 KB Output is correct
4 Correct 97 ms 2736 KB Output is correct
5 Correct 96 ms 2732 KB Output is correct
6 Correct 94 ms 2680 KB Output is correct
7 Correct 101 ms 2684 KB Output is correct
8 Correct 94 ms 2796 KB Output is correct
9 Correct 104 ms 2800 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 105 ms 2688 KB Output is correct
16 Correct 96 ms 2756 KB Output is correct
17 Correct 97 ms 2756 KB Output is correct
18 Correct 104 ms 2808 KB Output is correct
19 Correct 97 ms 2800 KB Output is correct
20 Correct 95 ms 2748 KB Output is correct
21 Correct 100 ms 2880 KB Output is correct
22 Correct 94 ms 2756 KB Output is correct
23 Correct 100 ms 2800 KB Output is correct
24 Correct 98 ms 2700 KB Output is correct
25 Correct 98 ms 2796 KB Output is correct
26 Correct 97 ms 2800 KB Output is correct
27 Correct 97 ms 2736 KB Output is correct
28 Correct 96 ms 2732 KB Output is correct
29 Correct 94 ms 2680 KB Output is correct
30 Correct 101 ms 2684 KB Output is correct
31 Correct 94 ms 2796 KB Output is correct
32 Correct 104 ms 2800 KB Output is correct
33 Correct 102 ms 2756 KB Output is correct
34 Correct 97 ms 2792 KB Output is correct
35 Correct 101 ms 2776 KB Output is correct
36 Correct 97 ms 2760 KB Output is correct
37 Correct 97 ms 2716 KB Output is correct
38 Correct 100 ms 2800 KB Output is correct
39 Correct 99 ms 2700 KB Output is correct
40 Correct 110 ms 2792 KB Output is correct
41 Correct 95 ms 2780 KB Output is correct
42 Correct 91 ms 2772 KB Output is correct
43 Correct 95 ms 2748 KB Output is correct