oj.uz

Submission #58161

# Submission time Handle Problem Language Result Execution time Memory
58161 2018-07-17T04:42:47 Z qkxwsm Game (IOI14_game) C++17
100 / 100
 944 ms 16336 KB 
#include "game.h"
#include <bits/stdc++.h>

using namespace std;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long randomize(long long mod)
{
	return ((1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}

#define MP make_pair
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-20;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 1513

long long normalize(long long x, long long mod = INF)
{
	return (((x % mod) + mod) % mod);
}

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int N;
int cnt[MAXN];
int dsu[MAXN];
int sz[MAXN];
int ask[MAXN][MAXN];

void initialize(int n)
{
	N = n;
	for (int i = 0; i < N; i++)
	{
		dsu[i] = i;
		sz[i] = 1;
	}
}
int find_parent(int u)
{
	if (u == dsu[u])
	{
		return dsu[u];
	}
	dsu[u] = find_parent(dsu[u]);
	return dsu[u];
}
void merge(int u, int v)
{
	u = find_parent(u);
	v = find_parent(v);
	if (u == v)
	{
		return;
	}
	if (sz[u] > sz[v])
	{
		swap(u, v);
	}
	dsu[u] = v;
	sz[v] += sz[u];
	for (int i = 0; i < N; i++)
	{
		if (u == i || v == i)
		{
			continue;
		}
		ask[v][i] += ask[u][i];
		ask[i][v] = ask[v][i];
	}
	ask[v][v] = 0;
	return;
}
int hasEdge(int u, int v)
{
	int res = 0;
	u = find_parent(u);
	v = find_parent(v);
	ask[u][v]++;
	ask[v][u]++;
	if (ask[u][v] == sz[u] * sz[v])
	{
		res = 1;
		merge(u, v);
	}
	return res;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 612 KB Output is correct
8 Correct 3 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 2 ms 612 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 3 ms 612 KB Output is correct
14 Correct 2 ms 612 KB Output is correct
15 Correct 2 ms 612 KB Output is correct
16 Correct 2 ms 612 KB Output is correct
17 Correct 3 ms 620 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 1 ms 620 KB Output is correct
20 Correct 2 ms 620 KB Output is correct
21 Correct 3 ms 620 KB Output is correct
22 Correct 2 ms 620 KB Output is correct
23 Correct 2 ms 620 KB Output is correct
24 Correct 2 ms 624 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 624 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 3 ms 624 KB Output is correct
4 Correct 2 ms 624 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 3 ms 716 KB Output is correct
13 Correct 3 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 3 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 3 ms 716 KB Output is correct
26 Correct 3 ms 716 KB Output is correct
27 Correct 3 ms 752 KB Output is correct
28 Correct 3 ms 752 KB Output is correct
29 Correct 3 ms 764 KB Output is correct
30 Correct 2 ms 764 KB Output is correct
31 Correct 3 ms 764 KB Output is correct
32 Correct 3 ms 764 KB Output is correct
33 Correct 3 ms 764 KB Output is correct
34 Correct 5 ms 892 KB Output is correct
35 Correct 4 ms 892 KB Output is correct
36 Correct 4 ms 912 KB Output is correct
37 Correct 4 ms 924 KB Output is correct
38 Correct 4 ms 924 KB Output is correct
39 Correct 4 ms 940 KB Output is correct
40 Correct 3 ms 940 KB Output is correct
41 Correct 3 ms 940 KB Output is correct
42 Correct 4 ms 956 KB Output is correct
43 Correct 3 ms 956 KB Output is correct
44 Correct 4 ms 956 KB Output is correct
45 Correct 3 ms 956 KB Output is correct
46 Correct 4 ms 956 KB Output is correct
47 Correct 5 ms 956 KB Output is correct
48 Correct 5 ms 956 KB Output is correct
49 Correct 7 ms 972 KB Output is correct
50 Correct 4 ms 972 KB Output is correct
51 Correct 5 ms 972 KB Output is correct
52 Correct 4 ms 972 KB Output is correct
53 Correct 3 ms 972 KB Output is correct
54 Correct 3 ms 972 KB Output is correct

Subtask #3
58.0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 2 ms 972 KB Output is correct
3 Correct 2 ms 972 KB Output is correct
4 Correct 2 ms 972 KB Output is correct
5 Correct 3 ms 972 KB Output is correct
6 Correct 2 ms 972 KB Output is correct
7 Correct 2 ms 972 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 3 ms 972 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 3 ms 972 KB Output is correct
12 Correct 2 ms 972 KB Output is correct
13 Correct 2 ms 972 KB Output is correct
14 Correct 2 ms 972 KB Output is correct
15 Correct 3 ms 972 KB Output is correct
16 Correct 3 ms 972 KB Output is correct
17 Correct 2 ms 972 KB Output is correct
18 Correct 2 ms 972 KB Output is correct
19 Correct 2 ms 972 KB Output is correct
20 Correct 2 ms 972 KB Output is correct
21 Correct 3 ms 972 KB Output is correct
22 Correct 3 ms 972 KB Output is correct
23 Correct 2 ms 972 KB Output is correct
24 Correct 2 ms 972 KB Output is correct
25 Correct 3 ms 972 KB Output is correct
26 Correct 2 ms 972 KB Output is correct
27 Correct 2 ms 972 KB Output is correct
28 Correct 3 ms 972 KB Output is correct
29 Correct 3 ms 972 KB Output is correct
30 Correct 2 ms 972 KB Output is correct
31 Correct 3 ms 972 KB Output is correct
32 Correct 3 ms 972 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 4 ms 972 KB Output is correct
35 Correct 5 ms 972 KB Output is correct
36 Correct 5 ms 972 KB Output is correct
37 Correct 4 ms 972 KB Output is correct
38 Correct 4 ms 972 KB Output is correct
39 Correct 4 ms 972 KB Output is correct
40 Correct 3 ms 1100 KB Output is correct
41 Correct 3 ms 1100 KB Output is correct
42 Correct 5 ms 1100 KB Output is correct
43 Correct 6 ms 1100 KB Output is correct
44 Correct 3 ms 1100 KB Output is correct
45 Correct 3 ms 1100 KB Output is correct
46 Correct 4 ms 1100 KB Output is correct
47 Correct 4 ms 1100 KB Output is correct
48 Correct 4 ms 1100 KB Output is correct
49 Correct 4 ms 1100 KB Output is correct
50 Correct 4 ms 1100 KB Output is correct
51 Correct 5 ms 1100 KB Output is correct
52 Correct 3 ms 1100 KB Output is correct
53 Correct 3 ms 1100 KB Output is correct
54 Correct 4 ms 1100 KB Output is correct
55 Correct 60 ms 4412 KB Output is correct
56 Correct 73 ms 4412 KB Output is correct
57 Correct 98 ms 4468 KB Output is correct
58 Correct 79 ms 4468 KB Output is correct
59 Correct 64 ms 4552 KB Output is correct
60 Correct 61 ms 4552 KB Output is correct
61 Correct 74 ms 4552 KB Output is correct
62 Correct 59 ms 4552 KB Output is correct
63 Correct 90 ms 4552 KB Output is correct
64 Correct 59 ms 4552 KB Output is correct
65 Correct 100 ms 4552 KB Output is correct
66 Correct 65 ms 4552 KB Output is correct
67 Correct 76 ms 4552 KB Output is correct
68 Correct 80 ms 4564 KB Output is correct
69 Correct 76 ms 4580 KB Output is correct
70 Correct 89 ms 4580 KB Output is correct
71 Correct 94 ms 4580 KB Output is correct
72 Correct 101 ms 4580 KB Output is correct
73 Correct 78 ms 4580 KB Output is correct
74 Correct 60 ms 4580 KB Output is correct
75 Correct 59 ms 4580 KB Output is correct
76 Correct 237 ms 7032 KB Output is correct
77 Correct 223 ms 7128 KB Output is correct
78 Correct 204 ms 7128 KB Output is correct
79 Correct 204 ms 7128 KB Output is correct
80 Correct 214 ms 7128 KB Output is correct
81 Correct 164 ms 7128 KB Output is correct
82 Correct 156 ms 7128 KB Output is correct
83 Correct 148 ms 7128 KB Output is correct
84 Correct 201 ms 7128 KB Output is correct
85 Correct 369 ms 9844 KB Output is correct
86 Correct 325 ms 9940 KB Output is correct
87 Correct 352 ms 9940 KB Output is correct
88 Correct 325 ms 9940 KB Output is correct
89 Correct 327 ms 9940 KB Output is correct
90 Correct 414 ms 9992 KB Output is correct
91 Correct 338 ms 9992 KB Output is correct
92 Correct 381 ms 9992 KB Output is correct
93 Correct 280 ms 9992 KB Output is correct
94 Correct 772 ms 16336 KB Output is correct
95 Correct 742 ms 16336 KB Output is correct
96 Correct 766 ms 16336 KB Output is correct
97 Correct 783 ms 16336 KB Output is correct
98 Correct 944 ms 16336 KB Output is correct
99 Correct 864 ms 16336 KB Output is correct
100 Correct 729 ms 16336 KB Output is correct