oj.uz

Submission #69915

# Submission time Handle Problem Language Result Execution time Memory
69915 2018-08-22T01:20:06 Z qkxwsm Cats or Dogs (JOI18_catdog) C++17
38 / 100
 3000 ms 51620 KB 
#include "catdog.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
	int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
		return x ^ (x >> 7) ^ (x >> 4);
	}
	int operator()(long long x) const
	{
		return x ^ (x >> 32);
	}
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

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);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
static long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
static int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

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

#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 100013

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

int N;
vector<int> edge[MAXN];
int parent[MAXN], depth[MAXN];
int heavy[MAXN], head[MAXN], ranking[MAXN], subtree[MAXN], siz[MAXN];
int arr[MAXN];
pll dp[MAXN];
pll big[3] = {{0, 0}, {0, INF}, {INF, 0}};

pll operator + (const pll &a, const pll &b)
{
	return {a.fi + b.fi, a.se + b.se};
}
pll operator - (const pll &a, const pll &b)
{
	return {a.fi - b.fi, a.se - b.se};
}
pll trans(int u, int v)
{
	return big[v] - big[u];
}
void dfs(int u)
{
	subtree[u] = 1;
	for (int v : edge[u])
	{
		if (v == parent[u]) continue;
		parent[v] = u;
		depth[v] = depth[u] + 1;
		dfs(v);
		subtree[u] += subtree[v];
	}
	heavy[u] = N;
	for (int v : edge[u])
	{
		if (v == parent[u]) continue;
		if (subtree[v] * 2 >= subtree[u]) heavy[u] = v;
	}
}
void dfs_heavy(int u)
{
	if (heavy[u] != N)
	{
		head[heavy[u]] = head[u];
		ranking[heavy[u]] = ranking[u] + 1;
		dfs_heavy(heavy[u]);
	}
	for (int v : edge[u])
	{
		if (v == parent[u]) continue;
		if (v == heavy[u]) continue;
		ranking[v] = 0;
		head[v] = v;
		dfs_heavy(v);
	}
	return;
}
void initialize(int n, vector<int> a, vector<int> b)
{
	N = n;
	for (int i = 0; i < N - 1; i++)
	{
		int u = a[i], v = b[i];
		u--; v--;
		edge[u].PB(v);
		edge[v].PB(u);
	}
	parent[N] = N; parent[0] = N;
	dfs(0);
	dfs_heavy(0);
	for (int i = 0; i < N; i++)
	{
		arr[i] = -1;
	}
}
void upd(int u, pll p)
{
	pll was = {min(dp[u].fi, dp[u].se + 1), min(dp[u].se, dp[u].fi + 1)};
	dp[u] = dp[u] + p;
	pll cur = {min(dp[u].fi, dp[u].se + 1), min(dp[u].se, dp[u].fi + 1)};
	if (u == 0)
	{
		return;
	}
	upd(parent[u], cur - was);
}
int setval(int u, int v)
{
	pll change = trans(arr[u], v);
	arr[u] = v;
	upd(u, change);
	return min(dp[0].fi, dp[0].se);
}
int cat(int u)
{
	u--;
	return setval(u, 1);
}
int dog(int u)
{
	u--;
	return setval(u, 2);
}
int neighbor(int u)
{
	u--;
	return setval(u, 0);
}

Compilation message

catdog.cpp:44:12: warning: 'int randomize(int)' defined but not used [-Wunused-function]
 static int randomize(int mod)
            ^~~~~~~~~
catdog.cpp:40:18: warning: 'long long int randomizell(long long int)' defined but not used [-Wunused-function]
 static long long randomizell(long long mod)
                  ^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 5 ms 2800 KB Output is correct
3 Correct 6 ms 2840 KB Output is correct
4 Correct 6 ms 2840 KB Output is correct
5 Correct 6 ms 2840 KB Output is correct
6 Correct 5 ms 3100 KB Output is correct
7 Correct 5 ms 3100 KB Output is correct
8 Correct 5 ms 3100 KB Output is correct
9 Correct 4 ms 3100 KB Output is correct
10 Correct 5 ms 3100 KB Output is correct
11 Correct 5 ms 3100 KB Output is correct
12 Correct 5 ms 3100 KB Output is correct
13 Correct 7 ms 3100 KB Output is correct
14 Correct 6 ms 3100 KB Output is correct
15 Correct 6 ms 3100 KB Output is correct
16 Correct 6 ms 3100 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 5 ms 2800 KB Output is correct
3 Correct 6 ms 2840 KB Output is correct
4 Correct 6 ms 2840 KB Output is correct
5 Correct 6 ms 2840 KB Output is correct
6 Correct 5 ms 3100 KB Output is correct
7 Correct 5 ms 3100 KB Output is correct
8 Correct 5 ms 3100 KB Output is correct
9 Correct 4 ms 3100 KB Output is correct
10 Correct 5 ms 3100 KB Output is correct
11 Correct 5 ms 3100 KB Output is correct
12 Correct 5 ms 3100 KB Output is correct
13 Correct 7 ms 3100 KB Output is correct
14 Correct 6 ms 3100 KB Output is correct
15 Correct 6 ms 3100 KB Output is correct
16 Correct 6 ms 3100 KB Output is correct
17 Correct 7 ms 3116 KB Output is correct
18 Correct 8 ms 3128 KB Output is correct
19 Correct 8 ms 3140 KB Output is correct
20 Correct 6 ms 3140 KB Output is correct
21 Correct 7 ms 3140 KB Output is correct
22 Correct 9 ms 3140 KB Output is correct
23 Correct 7 ms 3172 KB Output is correct
24 Correct 7 ms 3184 KB Output is correct
25 Correct 8 ms 3184 KB Output is correct
26 Correct 8 ms 3304 KB Output is correct
27 Correct 7 ms 3304 KB Output is correct
28 Correct 5 ms 3304 KB Output is correct
29 Correct 6 ms 3304 KB Output is correct
30 Correct 6 ms 3304 KB Output is correct
31 Correct 7 ms 3304 KB Output is correct
32 Correct 7 ms 3304 KB Output is correct

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 5 ms 2800 KB Output is correct
3 Correct 6 ms 2840 KB Output is correct
4 Correct 6 ms 2840 KB Output is correct
5 Correct 6 ms 2840 KB Output is correct
6 Correct 5 ms 3100 KB Output is correct
7 Correct 5 ms 3100 KB Output is correct
8 Correct 5 ms 3100 KB Output is correct
9 Correct 4 ms 3100 KB Output is correct
10 Correct 5 ms 3100 KB Output is correct
11 Correct 5 ms 3100 KB Output is correct
12 Correct 5 ms 3100 KB Output is correct
13 Correct 7 ms 3100 KB Output is correct
14 Correct 6 ms 3100 KB Output is correct
15 Correct 6 ms 3100 KB Output is correct
16 Correct 6 ms 3100 KB Output is correct
17 Correct 7 ms 3116 KB Output is correct
18 Correct 8 ms 3128 KB Output is correct
19 Correct 8 ms 3140 KB Output is correct
20 Correct 6 ms 3140 KB Output is correct
21 Correct 7 ms 3140 KB Output is correct
22 Correct 9 ms 3140 KB Output is correct
23 Correct 7 ms 3172 KB Output is correct
24 Correct 7 ms 3184 KB Output is correct
25 Correct 8 ms 3184 KB Output is correct
26 Correct 8 ms 3304 KB Output is correct
27 Correct 7 ms 3304 KB Output is correct
28 Correct 5 ms 3304 KB Output is correct
29 Correct 6 ms 3304 KB Output is correct
30 Correct 6 ms 3304 KB Output is correct
31 Correct 7 ms 3304 KB Output is correct
32 Correct 7 ms 3304 KB Output is correct
33 Correct 178 ms 9608 KB Output is correct
34 Correct 137 ms 10972 KB Output is correct
35 Correct 205 ms 10972 KB Output is correct
36 Correct 322 ms 17068 KB Output is correct
37 Correct 47 ms 17068 KB Output is correct
38 Correct 365 ms 20320 KB Output is correct
39 Correct 342 ms 22112 KB Output is correct
40 Correct 406 ms 24060 KB Output is correct
41 Correct 387 ms 26112 KB Output is correct
42 Correct 450 ms 27976 KB Output is correct
43 Correct 345 ms 29848 KB Output is correct
44 Correct 426 ms 31788 KB Output is correct
45 Correct 508 ms 33740 KB Output is correct
46 Correct 392 ms 35804 KB Output is correct
47 Correct 382 ms 37676 KB Output is correct
48 Correct 96 ms 37676 KB Output is correct
49 Correct 116 ms 39600 KB Output is correct
50 Correct 35 ms 39600 KB Output is correct
51 Correct 61 ms 39600 KB Output is correct
52 Correct 26 ms 39600 KB Output is correct
53 Correct 226 ms 42164 KB Output is correct
54 Correct 115 ms 42164 KB Output is correct
55 Correct 309 ms 42884 KB Output is correct
56 Correct 161 ms 42884 KB Output is correct
57 Correct 283 ms 46784 KB Output is correct
58 Correct 42 ms 46784 KB Output is correct
59 Correct 57 ms 46784 KB Output is correct
60 Correct 108 ms 48800 KB Output is correct
61 Correct 115 ms 50936 KB Output is correct
62 Correct 82 ms 50936 KB Output is correct
63 Execution timed out 3035 ms 51620 KB Time limit exceeded
64 Halted 0 ms 0 KB -