oj.uz

Submission #544735

# Submission time Handle Problem Language Result Execution time Memory
544735 2022-04-02T16:14:53 Z rainboy Plus Minus (BOI17_plusminus) C
100 / 100
 64 ms 3608 KB 
#include <stdio.h>

#define N	100000
#define MD	1000000007

unsigned int X = 12345;

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

int xx[N], yy[N]; char cc[N];

int compare_x(const void *a, const void *b) {
	int i = *(int *) a;
	int j = *(int *) b;

	return xx[i] - xx[j];
}

int compare_y(const void *a, const void *b) {
	int i = *(int *) a;
	int j = *(int *) b;

	return yy[i] - yy[j];
}

int (*compare)(const void *, const void *);

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

		while (j < k) {
			int c = compare(&ii[j], &i_);

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

long long power(int a, int k) {
	long long b = a, p = 1;

	while (k) {
		if (k & 1)
			p = p * b % MD;
		b = b * b % MD;
		k >>= 1;
	}
	return p;
}

int main() {
	static int ii[N];
	int n, x_, y_, i, j, extra, cnt, ans;

	scanf("%d%d%d", &x_, &y_, &n);
	extra = 1;
	for (i = 0; i < n; i++) {
		static char s[2];

		scanf("%s%d%d", s, &xx[i], &yy[i]);
		cc[i] = s[0];
		if (((xx[i] + yy[i]) % 2 == (xx[0] + yy[0]) % 2) != (cc[i] == cc[0]))
			extra = 0;
		ii[i] = i;
	}
	ans = 0;
	compare = compare_x, sort(ii, 0, n);
	cnt = x_;
	for (i = 0; i < n; i = j) {
		int x = xx[ii[i]];

		j = i + 1;
		while (j < n && xx[ii[j]] == x) {
			if ((yy[ii[i]] % 2 == yy[ii[j]] % 2) != (cc[ii[i]] == cc[ii[j]])) {
				cnt = -1;
				goto outx;
			}
			j++;
		}
		cnt--;
	}
outx:
	if (cnt >= 0)
		ans = (ans + power(2, cnt)) % MD;
	compare = compare_y, sort(ii, 0, n);
	cnt = y_;
	for (i = 0; i < n; i = j) {
		int y = yy[ii[i]];

		j = i + 1;
		while (j < n && yy[ii[j]] == y) {
			if ((xx[ii[i]] % 2 == xx[ii[j]] % 2) != (cc[ii[i]] == cc[ii[j]])) {
				cnt = -1;
				goto outy;
			}
			j++;
		}
		cnt--;
	}
outy:
	if (cnt >= 0)
		ans = (ans + power(2, cnt)) % MD;
	if (extra)
		ans = (ans - (n > 0 ? 1 : 2) + MD) % MD;
	printf("%d\n", ans);
	return 0;
}

Compilation message

plusminus.c: In function 'main':
plusminus.c:68:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |  scanf("%d%d%d", &x_, &y_, &n);
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plusminus.c:73:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   scanf("%s%d%d", s, &xx[i], &yy[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 288 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 288 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 39 ms 2384 KB Output is correct
17 Correct 42 ms 2480 KB Output is correct
18 Correct 41 ms 2456 KB Output is correct
19 Correct 38 ms 2388 KB Output is correct
20 Correct 50 ms 2464 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 288 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 39 ms 2384 KB Output is correct
17 Correct 42 ms 2480 KB Output is correct
18 Correct 41 ms 2456 KB Output is correct
19 Correct 38 ms 2388 KB Output is correct
20 Correct 50 ms 2464 KB Output is correct
21 Correct 58 ms 2852 KB Output is correct
22 Correct 1 ms 288 KB Output is correct
23 Correct 58 ms 2820 KB Output is correct
24 Correct 59 ms 2764 KB Output is correct
25 Correct 57 ms 2868 KB Output is correct
26 Correct 54 ms 3120 KB Output is correct
27 Correct 56 ms 3088 KB Output is correct
28 Correct 64 ms 3120 KB Output is correct
29 Correct 55 ms 3092 KB Output is correct
30 Correct 63 ms 3608 KB Output is correct