oj.uz

Submission #480101

# Submission time Handle Problem Language Result Execution time Memory
480101 2021-10-14T15:18:47 Z rainboy Trobojnica (COCI19_trobojnica) C
110 / 110
 47 ms 3552 KB 
#include <stdio.h>

#define N	200000

int main() {
	static char cc[N + 1];
	static int kk[4], ii[N];
	int n, i, x, cnt;

	scanf("%d%s", &n, cc);
	x = 0;
	for (i = 0; i < n; i++) {
		cc[i] -= '0';
		kk[(int) cc[i]]++;
		x ^= cc[i];
	}
	if (x != 0 || kk[1] == n || kk[2] == n || kk[3] == n) {
		printf("NE\n");
		return 0;
	}
	cnt = 0;
	ii[cnt++] = 0;
	printf("DA\n");
	for (i = 1; i < n; i++) {
		int a, b;

		while (cnt >= 2 && (a = cc[ii[cnt - 2]]) != (b = cc[ii[cnt - 1]]) && (kk[a] > 1 || kk[b] > 1)) {
			kk[a]--, kk[b]--, kk[a ^ b]++, cnt--;
			cc[ii[cnt - 1]] = a ^ b;
			printf("%d %d %d\n", ii[cnt - 1] + 1, i + 1, a ^ b);
		}
		ii[cnt++] = i;
	}
	return 0;
}

Compilation message

trobojnica.c: In function 'main':
trobojnica.c:10:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d%s", &n, cc);
      |  ^~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.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 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #2
40.0 / 40.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 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct

Subtask #3
50.0 / 50.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 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 47 ms 3552 KB Output is correct
22 Correct 47 ms 2648 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 47 ms 2992 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 23 ms 1488 KB Output is correct
28 Correct 2 ms 664 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 2 ms 588 KB Output is correct