Submission #211147

# Submission time Handle Problem Language Result Execution time Memory
211147 2020-03-19T10:18:37 Z mode149256 Game (IOI14_game) C++14
100 / 100
533 ms 25976 KB
/*input

*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#include "game.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

const int MX = 1510;

vii liko(MX, vi(MX, 1));
vbb buvo(MX, vb(MX, false));

vi p;
int N;

void initialize(int n) {
	N = n;
	p = vi(n + 1); for (int i = 0; i <= n; i++) p[i] = i;
}

void unionSet(int a, int b) {
	int prad = a;
	for (int i = 0; i < N; ++i)
	{
		if (p[i] == prad) {
			p[i] = b;
		}
	}
}

void merge(int a, int b) {
	unionSet(a, b);
	int tev = p[a];

	for (int i = 0; i < N; ++i)
	{
		if (i == a or i == b) continue;
		liko[i][tev] = liko[tev][i] = liko[a][i] + liko[b][i];
	}
}

int hasEdge(int u, int v) {
	buvo[u][v] = buvo[v][u] = true;
	u = p[u];
	v = p[v];

	if (u == v) return 0;
	liko[u][v]--;
	liko[v][u]--;

	if (liko[u][v]) {
		return 0;
	}

	merge(u, v);
	return 1;
}
# Verdict Execution time Memory Grader output
1 Correct 10 ms 9600 KB Output is correct
2 Correct 11 ms 9600 KB Output is correct
3 Correct 10 ms 9600 KB Output is correct
4 Correct 10 ms 9600 KB Output is correct
5 Correct 10 ms 9600 KB Output is correct
6 Correct 10 ms 9600 KB Output is correct
7 Correct 10 ms 9600 KB Output is correct
8 Correct 10 ms 9600 KB Output is correct
9 Correct 10 ms 9600 KB Output is correct
10 Correct 10 ms 9728 KB Output is correct
11 Correct 10 ms 9728 KB Output is correct
12 Correct 10 ms 9600 KB Output is correct
13 Correct 10 ms 9600 KB Output is correct
14 Correct 10 ms 9600 KB Output is correct
15 Correct 10 ms 9600 KB Output is correct
16 Correct 10 ms 9728 KB Output is correct
17 Correct 9 ms 9600 KB Output is correct
18 Correct 10 ms 9600 KB Output is correct
19 Correct 10 ms 9600 KB Output is correct
20 Correct 11 ms 9600 KB Output is correct
21 Correct 10 ms 9728 KB Output is correct
22 Correct 10 ms 9728 KB Output is correct
23 Correct 10 ms 9856 KB Output is correct
24 Correct 10 ms 9728 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 9600 KB Output is correct
2 Correct 11 ms 9600 KB Output is correct
3 Correct 10 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 10 ms 9600 KB Output is correct
6 Correct 10 ms 9728 KB Output is correct
7 Correct 10 ms 9600 KB Output is correct
8 Correct 10 ms 9600 KB Output is correct
9 Correct 10 ms 9600 KB Output is correct
10 Correct 10 ms 9600 KB Output is correct
11 Correct 10 ms 9780 KB Output is correct
12 Correct 10 ms 9600 KB Output is correct
13 Correct 9 ms 9600 KB Output is correct
14 Correct 10 ms 9600 KB Output is correct
15 Correct 10 ms 9600 KB Output is correct
16 Correct 10 ms 9600 KB Output is correct
17 Correct 9 ms 9600 KB Output is correct
18 Correct 11 ms 9600 KB Output is correct
19 Correct 10 ms 9600 KB Output is correct
20 Correct 10 ms 9600 KB Output is correct
21 Correct 10 ms 9600 KB Output is correct
22 Correct 10 ms 9600 KB Output is correct
23 Correct 10 ms 9728 KB Output is correct
24 Correct 9 ms 9728 KB Output is correct
25 Correct 10 ms 9600 KB Output is correct
26 Correct 11 ms 9728 KB Output is correct
27 Correct 10 ms 9600 KB Output is correct
28 Correct 10 ms 9600 KB Output is correct
29 Correct 12 ms 9728 KB Output is correct
30 Correct 10 ms 9728 KB Output is correct
31 Correct 10 ms 9708 KB Output is correct
32 Correct 10 ms 9728 KB Output is correct
33 Correct 11 ms 9600 KB Output is correct
34 Correct 11 ms 9728 KB Output is correct
35 Correct 11 ms 9728 KB Output is correct
36 Correct 11 ms 9728 KB Output is correct
37 Correct 11 ms 9728 KB Output is correct
38 Correct 11 ms 9728 KB Output is correct
39 Correct 10 ms 9728 KB Output is correct
40 Correct 11 ms 9728 KB Output is correct
41 Correct 11 ms 9728 KB Output is correct
42 Correct 11 ms 9728 KB Output is correct
43 Correct 11 ms 9728 KB Output is correct
44 Correct 11 ms 9728 KB Output is correct
45 Correct 11 ms 9728 KB Output is correct
46 Correct 11 ms 9728 KB Output is correct
47 Correct 11 ms 9728 KB Output is correct
48 Correct 11 ms 9728 KB Output is correct
49 Correct 11 ms 9728 KB Output is correct
50 Correct 11 ms 9728 KB Output is correct
51 Correct 10 ms 9720 KB Output is correct
52 Correct 10 ms 9728 KB Output is correct
53 Correct 10 ms 9728 KB Output is correct
54 Correct 10 ms 9728 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 9600 KB Output is correct
2 Correct 10 ms 9728 KB Output is correct
3 Correct 10 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 10 ms 9600 KB Output is correct
7 Correct 9 ms 9728 KB Output is correct
8 Correct 10 ms 9600 KB Output is correct
9 Correct 9 ms 9600 KB Output is correct
10 Correct 9 ms 9600 KB Output is correct
11 Correct 12 ms 9600 KB Output is correct
12 Correct 10 ms 9728 KB Output is correct
13 Correct 9 ms 9600 KB Output is correct
14 Correct 10 ms 9600 KB Output is correct
15 Correct 11 ms 9728 KB Output is correct
16 Correct 13 ms 9728 KB Output is correct
17 Correct 10 ms 9728 KB Output is correct
18 Correct 12 ms 9728 KB Output is correct
19 Correct 13 ms 9600 KB Output is correct
20 Correct 11 ms 9600 KB Output is correct
21 Correct 12 ms 9600 KB Output is correct
22 Correct 11 ms 9600 KB Output is correct
23 Correct 11 ms 9728 KB Output is correct
24 Correct 12 ms 9600 KB Output is correct
25 Correct 10 ms 9600 KB Output is correct
26 Correct 12 ms 9728 KB Output is correct
27 Correct 11 ms 9728 KB Output is correct
28 Correct 10 ms 9728 KB Output is correct
29 Correct 10 ms 9728 KB Output is correct
30 Correct 10 ms 9728 KB Output is correct
31 Correct 10 ms 9600 KB Output is correct
32 Correct 10 ms 9728 KB Output is correct
33 Correct 10 ms 9776 KB Output is correct
34 Correct 13 ms 9856 KB Output is correct
35 Correct 11 ms 9728 KB Output is correct
36 Correct 11 ms 9728 KB Output is correct
37 Correct 11 ms 9728 KB Output is correct
38 Correct 10 ms 9728 KB Output is correct
39 Correct 11 ms 9728 KB Output is correct
40 Correct 11 ms 9728 KB Output is correct
41 Correct 11 ms 9728 KB Output is correct
42 Correct 11 ms 9728 KB Output is correct
43 Correct 11 ms 9728 KB Output is correct
44 Correct 10 ms 9728 KB Output is correct
45 Correct 10 ms 9728 KB Output is correct
46 Correct 11 ms 9728 KB Output is correct
47 Correct 10 ms 9728 KB Output is correct
48 Correct 10 ms 9728 KB Output is correct
49 Correct 11 ms 9856 KB Output is correct
50 Correct 11 ms 9856 KB Output is correct
51 Correct 11 ms 9728 KB Output is correct
52 Correct 10 ms 9728 KB Output is correct
53 Correct 10 ms 9728 KB Output is correct
54 Correct 13 ms 9728 KB Output is correct
55 Correct 58 ms 11512 KB Output is correct
56 Correct 62 ms 11384 KB Output is correct
57 Correct 60 ms 11384 KB Output is correct
58 Correct 61 ms 11388 KB Output is correct
59 Correct 60 ms 11384 KB Output is correct
60 Correct 70 ms 11512 KB Output is correct
61 Correct 81 ms 11512 KB Output is correct
62 Correct 65 ms 11384 KB Output is correct
63 Correct 71 ms 11384 KB Output is correct
64 Correct 64 ms 11384 KB Output is correct
65 Correct 56 ms 11512 KB Output is correct
66 Correct 64 ms 11384 KB Output is correct
67 Correct 60 ms 11384 KB Output is correct
68 Correct 60 ms 11384 KB Output is correct
69 Correct 62 ms 11512 KB Output is correct
70 Correct 63 ms 11384 KB Output is correct
71 Correct 59 ms 11512 KB Output is correct
72 Correct 59 ms 11384 KB Output is correct
73 Correct 60 ms 11512 KB Output is correct
74 Correct 61 ms 11512 KB Output is correct
75 Correct 59 ms 11388 KB Output is correct
76 Correct 129 ms 13688 KB Output is correct
77 Correct 134 ms 13688 KB Output is correct
78 Correct 131 ms 13688 KB Output is correct
79 Correct 135 ms 13872 KB Output is correct
80 Correct 132 ms 13816 KB Output is correct
81 Correct 127 ms 13688 KB Output is correct
82 Correct 132 ms 13792 KB Output is correct
83 Correct 130 ms 13816 KB Output is correct
84 Correct 127 ms 13700 KB Output is correct
85 Correct 230 ms 16760 KB Output is correct
86 Correct 235 ms 16760 KB Output is correct
87 Correct 231 ms 17016 KB Output is correct
88 Correct 229 ms 16776 KB Output is correct
89 Correct 232 ms 16760 KB Output is correct
90 Correct 230 ms 16760 KB Output is correct
91 Correct 228 ms 16764 KB Output is correct
92 Correct 234 ms 16760 KB Output is correct
93 Correct 224 ms 16760 KB Output is correct
94 Correct 518 ms 25848 KB Output is correct
95 Correct 533 ms 25720 KB Output is correct
96 Correct 512 ms 25848 KB Output is correct
97 Correct 506 ms 25848 KB Output is correct
98 Correct 518 ms 25976 KB Output is correct
99 Correct 530 ms 25808 KB Output is correct
100 Correct 526 ms 25976 KB Output is correct