oj.uz

Submission #631748

# Submission time Handle Problem Language Result Execution time Memory
631748 2022-08-18T15:54:11 Z rainboy Thousands Islands (IOI22_islands) C++17
100 / 100
 100 ms 22472 KB 
#include "islands.h"
#include <variant>
#include <vector>
#include <stdlib.h>
#include <string.h>

using namespace std;

typedef vector<int> vi;
typedef variant<bool, vi> vbvi;

const int N = 100000, M = 200000;

int ij[M];
int *eh[N], eo[N], eo_[N], *fh[N], fo[N]; char deleted[N];

void append(int **eh, int *eo, int i, int h) {
	int o = eo[i]++;
	if (o >= 2 && (o & o - 1) == 0)
		eh[i] = (int *) realloc(eh[i], o * 2 * sizeof *eh[i]);
	eh[i][o] = h;
}

void dfs(int j) {
	if (deleted[j] || eo_[j])
		return;
	deleted[j] = 1;
	for (int o = fo[j]; o--; ) {
		int h = fh[j][o], i = j ^ ij[h];
		eo_[i]--, dfs(i);
	}
}

int pp[N], ff[N]; char visited[N];
vi hh;

void circle(int i, int rev) {
	if (visited[i]) {
		if (!rev) {
			int j = i;
			do
				hh.push_back(ff[j]);
			while ((j = pp[j]) != i);
		} else {
			static int qu[N];
			int j = i, cnt = 0;
			do
				qu[cnt++] = ff[j];
			while ((j = pp[j]) != i);
			while (cnt--)
				hh.push_back(qu[cnt]);
		}
		return;
	}
	hh.push_back(ff[i]), circle(pp[i], rev), hh.push_back(ff[i]);
}

vbvi find_journey(int n, int m, vi ii, vi jj) {
	for (int i = 0; i < n; i++) {
		eh[i] = (int *) malloc(2 * sizeof *eh[i]);
		fh[i] = (int *) malloc(2 * sizeof *fh[i]);
	}
	for (int h = 0; h < m; h++) {
		int i = ii[h], j = jj[h];
		ij[h] = i ^ j;
		append(eh, eo, i, h), append(fh, fo, j, h), eo_[i]++;
	}
	for (int i = 0; i < n; i++)
		dfs(i);
	static int qu[N];
	int u = 0, cnt = 0;
	while (1) {
		if (eo_[u] == 0)
			return false;
		if (eo_[u] >= 2)
			break;
		for (int o = eo[u]; o--; ) {
			int h = eh[u][o], i = u ^ ij[h];
			if (!deleted[i]) {
				qu[cnt++] = h;
				eo_[u] = 0, dfs(u);
				u = i;
				break;
			}
		}
	}
	memset(pp, -1, n * sizeof *pp), memset(ff, -1, n * sizeof *ff);
	int v = -1, f = -1;
	for (int i = 0; i < n; i++)
		if (!deleted[i])
			for (int o = eo[i]; o--; ) {
				int h = eh[i][o], j = i ^ ij[h];
				if (!deleted[j]) {
					if (pp[i] == -1)
						pp[i] = j, ff[i] = h;
					else if (i == u)
						v = j, f = h;
				}
			}
	int i;
	i = u;
	while (!visited[i])
		visited[i] = 1, i = pp[i];
	while (visited[i] == 1)
		visited[i] = 2, i = pp[i];
	for (i = 0; i < n; i++)
		if (visited[i] == 1)
			visited[i] = 0;
	i = v;
	while (!visited[i])
		visited[i] = 1, i = pp[i];
	for (int h = 0; h < cnt; h++)
		hh.push_back(qu[h]);
	if (visited[i] == 2) {
		for (i = 0; i < n; i++)
			if (visited[i] == 1)
				visited[i] = 0;
		circle(u, 0), hh.push_back(f), circle(v, 1), hh.push_back(f);
	} else {
		while (visited[i] == 1)
			visited[i] = 2, i = pp[i];
		for (i = 0; i < n; i++)
			if (visited[i] == 1)
				visited[i] = 0;
		circle(u, 0), hh.push_back(f), circle(v, 0), hh.push_back(f);
		circle(u, 1), hh.push_back(f), circle(v, 1), hh.push_back(f);
	}
	for (int h = cnt - 1; h >= 0; h--)
		hh.push_back(qu[h]);
	return hh;
}

Compilation message

islands.cpp: In function 'void append(int**, int*, int, int)':
islands.cpp:19:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   19 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 34 ms 5268 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 21 ms 3400 KB Output is correct
18 Correct 15 ms 3112 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 36 ms 5264 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 30 ms 5796 KB Output is correct
4 Correct 34 ms 5920 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 37 ms 6596 KB Output is correct
21 Correct 34 ms 6124 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 45 ms 6276 KB Output is correct
28 Correct 36 ms 6400 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 45 ms 6856 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 33 ms 6308 KB Output is correct
33 Correct 33 ms 6220 KB Output is correct
34 Correct 17 ms 3540 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 30 ms 5520 KB Output is correct
37 Correct 35 ms 6656 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 29 ms 5480 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 41 ms 6844 KB Output is correct
42 Correct 37 ms 6440 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 15 ms 3028 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 38 ms 5876 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 34 ms 5268 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 21 ms 3400 KB Output is correct
31 Correct 15 ms 3112 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 36 ms 5264 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 17 ms 3156 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 37 ms 10940 KB Output is correct
44 Correct 31 ms 10932 KB Output is correct
45 Correct 33 ms 11340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 77 ms 18204 KB Output is correct
51 Correct 81 ms 21644 KB Output is correct
52 Correct 87 ms 21584 KB Output is correct
53 Correct 93 ms 22472 KB Output is correct
54 Correct 75 ms 21544 KB Output is correct
55 Correct 75 ms 21588 KB Output is correct
56 Correct 95 ms 22424 KB Output is correct
57 Correct 44 ms 11384 KB Output is correct
58 Correct 71 ms 16988 KB Output is correct
59 Correct 86 ms 14032 KB Output is correct
60 Correct 91 ms 14844 KB Output is correct
61 Correct 75 ms 14128 KB Output is correct
62 Correct 12 ms 5204 KB Output is correct
63 Correct 58 ms 13432 KB Output is correct
64 Correct 25 ms 3780 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 0 ms 340 KB Output is correct
67 Correct 72 ms 14668 KB Output is correct
68 Correct 38 ms 6992 KB Output is correct
69 Correct 41 ms 13424 KB Output is correct
70 Correct 1 ms 468 KB Output is correct
71 Correct 47 ms 8780 KB Output is correct
72 Correct 0 ms 340 KB Output is correct
73 Correct 63 ms 11840 KB Output is correct
74 Correct 65 ms 17200 KB Output is correct
75 Correct 3 ms 852 KB Output is correct
76 Correct 27 ms 8656 KB Output is correct
77 Correct 49 ms 18932 KB Output is correct
78 Correct 79 ms 14816 KB Output is correct
79 Correct 0 ms 340 KB Output is correct
80 Correct 100 ms 18288 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 31 ms 6348 KB Output is correct
83 Correct 1 ms 468 KB Output is correct
84 Correct 0 ms 340 KB Output is correct
85 Correct 30 ms 7964 KB Output is correct
86 Correct 1 ms 596 KB Output is correct
87 Correct 6 ms 7508 KB Output is correct
88 Correct 2 ms 596 KB Output is correct
89 Correct 73 ms 14796 KB Output is correct
90 Correct 87 ms 14252 KB Output is correct
91 Correct 87 ms 16800 KB Output is correct
92 Correct 0 ms 340 KB Output is correct