oj.uz

Submission #476237

# Submission time Handle Problem Language Result Execution time Memory
476237 2021-09-25T14:09:40 Z rainboy Teoretičar (COCI18_teoreticar) C
0 / 130
 1191 ms 17552 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	200000
#define M	500000

int max(int a, int b) { return a > b ? a : b; }

int ii[M], jj[M], cc[M];
int *eh[N], eo[N];

void dfs(int i) {
	int c = 1;

	while (eo[i]) {
		int h = eh[i][--eo[i]];

		if (!cc[h])
			cc[h] = c ^= 3, i ^= ii[h] ^ jj[h];
	}
}

void solve(int *hh, int m, int a, int b) {
	int mid, h, h_, h1, h2, i, j, tmp;

	if (m == 0)
		return;
	if (b - a == 1) {
		for (h = 0; h < m; h++)
			cc[hh[h]] = a;
		return;
	}
	mid = (a + b) / 2;
	for (h = 0; h < m; h++) {
		h_ = hh[h], i = ii[h_], j = jj[h_];
		eh[i][eo[i]++] = h_, eh[j][eo[j]++] = h_;
	}
	for (h = 0; h < m; h++) {
		h_ = hh[h], i = ii[h_], j = jj[h_];
		if (eo[i] % 2 == 1)
			dfs(i);
		if (eo[j] % 2 == 1)
			dfs(j);
	}
	for (h = 0; h < m; h++) {
		h_ = hh[h], i = ii[h_], j = jj[h_];
		if (eo[i] % 2 == 0)
			dfs(i);
		if (eo[j] % 2 == 0)
			dfs(j);
	}
	h1 = 0, h2 = m;
	while (h1 < h2) {
		int c = cc[hh[h1]];

		cc[hh[h1]] = 0;
		if (c == 1)
			h1++;
		else {
			h2--;
			tmp = hh[h1], hh[h1] = hh[h2], hh[h2] = tmp;
		}
	}
	solve(hh, h1, a, mid), solve(hh + h1, m - h1, mid, b);
}

int main() {
	static int hh[M];
	int n, n1, n2, m, h, i, j, d_;

	scanf("%d%d%d", &n1, &n2, &m), n = n1 + n2;
	for (h = 0; h < m; h++) {
		scanf("%d%d", &i, &j), i--, j--, j += n1;
		ii[h] = i, jj[h] = j;
		eo[i]++, eo[j]++;
	}
	d_ = 0;
	for (i = 0; i < n; i++) {
		eh[i] = (int *) malloc(eo[i] * sizeof *eh[i]);
		d_ = max(d_, eo[i]);
		eo[i] = 0;
	}
	while ((d_ & d_ - 1) != 0)
		d_++;
	for (h = 0; h < m; h++)
		hh[h] = h;
	solve(hh, m, 1, d_ + 1);
	printf("%d\n", d_);
	for (h = 0; h < m; h++)
		printf("%d\n", cc[h]);
	return 0;
}

Compilation message

teoreticar.c: In function 'main':
teoreticar.c:83:18: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   83 |  while ((d_ & d_ - 1) != 0)
      |               ~~~^~~
teoreticar.c:71:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |  scanf("%d%d%d", &n1, &n2, &m), n = n1 + n2;
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
teoreticar.c:73:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   scanf("%d%d", &i, &j), i--, j--, j += n1;
      |   ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 588 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 460 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 368 ms 15004 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 339 ms 15064 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1191 ms 17552 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 745 ms 13868 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #9
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 591 ms 11612 KB not colored properly
2 Halted 0 ms 0 KB -

Subtask #10
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 591 ms 11592 KB not colored properly
2 Halted 0 ms 0 KB -