Submission #512832

# Submission time Handle Problem Language Result Execution time Memory
512832 2022-01-16T18:46:14 Z MathMate Game (IOI14_game) C++17
100 / 100
337 ms 19344 KB
// #include <game.h>
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 1.5e3 + 5;

// graf_ustawionych -> graf krawedzi ustawionych i przyjmuje, ze mozliwe nie sa ustawione
// graf_ustawionych_i_mozliwych -> graf krawedzi ustawionych i przyjmuje, ze mozliwe tez sa ustawione
// Na poczatku ma wszystkie krawedzie sa nieustawione w grafie graf_ustawionych
// Na poczatku ma wszystkie krawedzie sa ustawione w grafie graf_ustawionych_i_mozliwych
// Na zapytanie o to czy {a, b} sa polaczone:
// * "YES" -> gdy {a, b} jest mostem w grafie_ustawionych_i_mozliwych
// * "NO" -> w przeciwnym przypadku
// Czyli innymi slowy odpowiadamy:
// * "YES" -> w przeciwnym przypadku
// * "NO" -> gdy {a, b} nalezy do cyklu w grafie_ustawionych_i_mozliwych

// Zeby rozwiazac to szybciej niz w O(MAX_N ^ 4) -> czyli w O(MAX_N ^ 2)
// Do znajdowania mostow posluzymy sie struktura F & U (DSU)
// I tablice ilosc_krawedzi_laczacych_wierzcholki[a][b], ktora bedzie mowila nam
// Ile krawedzi laczy find_set(a) z find_set(b)
// Krawedz {a, b} bedzie mostem w grafie_ustawionych_i_mozliwych,
// Jesli ilosc_krawedzi_laczacych_wierzcholki[a][b] == 1
// union_sets() zajmuje O(n), a find_set() zajmuje O(1)

// Poczatkowo ilosc_krawedzi_laczacych_wierzcholki[a][b] == 1 dla kazdej pary {a, b},
// Gdzie a != b

// Jesli odpowiadamy "NO", to zmniejszamy ilosc_krawedzi_laczacych_wierzcholki[a][b] i ilosc_krawedzi_laczacych_wierzcholki[b][a] o 1
// Jesli odpowiadamy "YES", to dla kazdego reprezentanta i,
// Robimy ilosc_krawedzi_laczacych_wierzcholki[a][i] += ilosc_krawedzi_laczacych_wierzcholki[b][i]

// Operacji union_set() moze byc maksymalnie (n - 1), wiec wszystkie operacje union_set() to O(MAX_N ^ 2)
// Update ilosc_krawedzi_laczacych_wierzcholki[a][b] w przypadku "YES", to O(n), ale operacji update wykonamy maksymalnie (n - 1), wiec wszystkie updaty to O(MAX_N ^ 2)

// Calkowita zlozonosc: O(MAX_N ^ 2)

int ilosc_krawedzi_laczacych_wierzcholki[MAX_N][MAX_N];

vector <int> rodzic(MAX_N);

int n;

int find_set(int v)
{
	if(v == rodzic[v])
	{
		return v;
	}

	return rodzic[v] = find_set(rodzic[v]);
}

void make_set(int v)
{
	rodzic[v] = v;
}

void union_sets(int a, int b)
{
	a = find_set(a);
	b = find_set(b);

	for(int i = 0; i < n; i++)
	{
		int reprezentant_i = find_set(i);

		if(reprezentant_i == i)
		{
			ilosc_krawedzi_laczacych_wierzcholki[a][i] += ilosc_krawedzi_laczacych_wierzcholki[b][i];

			ilosc_krawedzi_laczacych_wierzcholki[i][a] = ilosc_krawedzi_laczacych_wierzcholki[a][i];
		}
	}

	rodzic[b] = a;
}

bool check(int a, int b)
{
	return find_set(a) == find_set(b);
}

void initialize(int ilosc_wierzcholkow)
{
	n = ilosc_wierzcholkow;

	for(int i = 0; i < n; i++)
	{
		make_set(i);
	}

	for(int i = 0; i < n; i++)
	{
		for(int j = i + 1; j < n; j++)
		{
			ilosc_krawedzi_laczacych_wierzcholki[i][j] = (i != j);
			ilosc_krawedzi_laczacych_wierzcholki[j][i] = (i != j);
		}
	}
}

int hasEdge(int a, int b)
{
	a = find_set(a);
	b = find_set(b);

	if(a == b)
	{
		return 0;
	}

	bool ok = (ilosc_krawedzi_laczacych_wierzcholki[a][b] == 1);

	if(ok)
	{
		union_sets(a, b);
	}

	else
	{
		ilosc_krawedzi_laczacych_wierzcholki[a][b]--;
		ilosc_krawedzi_laczacych_wierzcholki[b][a]--;
	}

	return ok;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 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 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 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 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 0 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 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 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 1 ms 588 KB Output is correct
36 Correct 1 ms 588 KB Output is correct
37 Correct 1 ms 588 KB Output is correct
38 Correct 1 ms 588 KB Output is correct
39 Correct 1 ms 588 KB Output is correct
40 Correct 1 ms 588 KB Output is correct
41 Correct 1 ms 588 KB Output is correct
42 Correct 1 ms 588 KB Output is correct
43 Correct 1 ms 588 KB Output is correct
44 Correct 1 ms 588 KB Output is correct
45 Correct 1 ms 588 KB Output is correct
46 Correct 1 ms 588 KB Output is correct
47 Correct 1 ms 588 KB Output is correct
48 Correct 1 ms 588 KB Output is correct
49 Correct 1 ms 588 KB Output is correct
50 Correct 1 ms 588 KB Output is correct
51 Correct 1 ms 588 KB Output is correct
52 Correct 1 ms 588 KB Output is correct
53 Correct 1 ms 588 KB Output is correct
54 Correct 2 ms 588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 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 0 ms 332 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 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 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 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 588 KB Output is correct
35 Correct 1 ms 588 KB Output is correct
36 Correct 1 ms 588 KB Output is correct
37 Correct 1 ms 588 KB Output is correct
38 Correct 1 ms 588 KB Output is correct
39 Correct 1 ms 588 KB Output is correct
40 Correct 1 ms 588 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 1 ms 588 KB Output is correct
43 Correct 1 ms 588 KB Output is correct
44 Correct 2 ms 588 KB Output is correct
45 Correct 1 ms 588 KB Output is correct
46 Correct 1 ms 588 KB Output is correct
47 Correct 1 ms 588 KB Output is correct
48 Correct 1 ms 592 KB Output is correct
49 Correct 1 ms 592 KB Output is correct
50 Correct 1 ms 588 KB Output is correct
51 Correct 1 ms 588 KB Output is correct
52 Correct 1 ms 588 KB Output is correct
53 Correct 1 ms 588 KB Output is correct
54 Correct 2 ms 588 KB Output is correct
55 Correct 34 ms 4112 KB Output is correct
56 Correct 34 ms 4164 KB Output is correct
57 Correct 33 ms 4676 KB Output is correct
58 Correct 34 ms 4296 KB Output is correct
59 Correct 36 ms 5048 KB Output is correct
60 Correct 33 ms 4980 KB Output is correct
61 Correct 36 ms 5044 KB Output is correct
62 Correct 35 ms 4500 KB Output is correct
63 Correct 35 ms 4128 KB Output is correct
64 Correct 33 ms 4108 KB Output is correct
65 Correct 32 ms 4092 KB Output is correct
66 Correct 34 ms 4108 KB Output is correct
67 Correct 36 ms 4208 KB Output is correct
68 Correct 36 ms 5064 KB Output is correct
69 Correct 43 ms 4176 KB Output is correct
70 Correct 35 ms 4152 KB Output is correct
71 Correct 33 ms 4256 KB Output is correct
72 Correct 32 ms 4092 KB Output is correct
73 Correct 35 ms 4164 KB Output is correct
74 Correct 37 ms 4180 KB Output is correct
75 Correct 33 ms 4164 KB Output is correct
76 Correct 77 ms 6880 KB Output is correct
77 Correct 81 ms 7136 KB Output is correct
78 Correct 75 ms 8816 KB Output is correct
79 Correct 75 ms 7792 KB Output is correct
80 Correct 80 ms 6852 KB Output is correct
81 Correct 77 ms 6836 KB Output is correct
82 Correct 76 ms 6800 KB Output is correct
83 Correct 77 ms 6840 KB Output is correct
84 Correct 79 ms 6904 KB Output is correct
85 Correct 136 ms 10420 KB Output is correct
86 Correct 133 ms 11460 KB Output is correct
87 Correct 137 ms 9752 KB Output is correct
88 Correct 140 ms 9796 KB Output is correct
89 Correct 137 ms 10692 KB Output is correct
90 Correct 181 ms 11504 KB Output is correct
91 Correct 146 ms 10712 KB Output is correct
92 Correct 149 ms 9700 KB Output is correct
93 Correct 133 ms 9676 KB Output is correct
94 Correct 324 ms 17720 KB Output is correct
95 Correct 332 ms 16816 KB Output is correct
96 Correct 320 ms 19344 KB Output is correct
97 Correct 337 ms 18324 KB Output is correct
98 Correct 333 ms 17660 KB Output is correct
99 Correct 320 ms 19300 KB Output is correct
100 Correct 337 ms 18116 KB Output is correct