oj.uz

답안 #92468

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
92468 2019-01-03T01:22:29 Z qkxwsm Min-max tree (BOI18_minmaxtree) C++14
29 / 100
 297 ms 52320 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '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 expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a), i##__end__ = (b); i < i##__end__; i++)
#define FORD(i, a, b) for (auto i = (a) - 1, i##__end__ = (b); i >= i##__end__; i--)
#define ALL(x) (x).begin(), (x).end()

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

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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, K, T, V;
vi edge[MAXN];
pii bound[MAXN];
int parent[MAXN];
int ancestor[25][MAXN];
pii dup[25][MAXN];
int st[MAXN], ft[MAXN], depth[MAXN];
int ans[MAXN];
vpi edge1[MAXN];
bitset<MAXN> vis, VIS;

bool insubt(int u, int v)
{
	return (u == N) || (st[u] <= st[v] && st[v] <= ft[u]);
}
void dfs(int u)
{
	st[u] = ft[u] = T;
	T++;
	for (int v : edge[u])
	{
		if (v == parent[u]) continue;
		parent[v] = u;
		depth[v] = depth[u] + 1;
		dfs(v);
		ft[u] = ft[v];
	}
}
int lca(int u, int v)
{
	//how far up does v go before u
	if (insubt(v, u)) return -1;
	FORD(i, 20, 0)
	{
		if (!insubt(ancestor[i][v], u))
		{
			v = ancestor[i][v];
		}
	}
	return v;
}
void work(int u)
{
	if (vis[u]) return;
	vis[u] = true;
	int vert = -1;
	for (pii p : edge1[u])
	{
		if (u != 0 && u != V - 1 && ans[p.se] == u) vert = p.se;
	}
	for (pii p : edge1[u])
	{
		if (p.se == vert) continue;
		ans[p.se] = p.fi;
		work(p.fi);
	}
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N;
	FOR(i, 0, N - 1)
	{
		int u, v; cin >> u >> v; u--; v--;
		edge[u].PB(v);
		edge[v].PB(u);
	}
	parent[0] = N; dfs(0);
	FOR(i, 0, 22)
	{
		ancestor[i][N] = N;
	}
	FOR(i, 0, N)
	{
		ancestor[0][i] = parent[i];
		dup[0][i] = {-INF, INF};
	}
	FOR(i, 1, 21)
	{
		FOR(j, 0, N)
		{
			ancestor[i][j] = ancestor[i - 1][ancestor[i - 1][j]];
			dup[i][j] = {-INF, INF};
		}
	}
	cin >> K;
	while(K--)
	{
		int u, v, val;
		char typ;
		cin >> typ >> u >> v >> val; u--; v--;
		if (typ == 'm')
		{
			int w = lca(u, v), diff = depth[v] - depth[w] + 1;
			if (w != -1)
			{
				int x = v;
				FORD(i, 20, 0)
				{
					if (diff & (1 << i))
					{
						ckmax(dup[i][x].fi, val);
						x = ancestor[i][x];
					}
				}
			}
			w = lca(v, u);
			if (w != -1)
			{
				int x = u, diff = depth[u] - depth[w] + 1;
				FORD(i, 20, 0)
				{
					if (diff & (1 << i))
					{
						ckmax(dup[i][x].fi, val);
						x = ancestor[i][x];
					}
				}
			}
		}
		if (typ == 'M')
		{
			int w = lca(u, v);
			if (w != -1)
			{
				int x = v, diff = depth[v] - depth[w] + 1;
				FORD(i, 20, 0)
				{
					if (diff & (1 << i))
					{
						ckmin(dup[i][x].se, val);
						x = ancestor[i][x];
					}
				}
			}
			w = lca(v, u);
			if (w != -1)
			{
				int x = u, diff = depth[u] - depth[w] + 1;
				FORD(i, 20, 0)
				{
					if (diff & (1 << i))
					{
						ckmin(dup[i][x].se, val);
						x = ancestor[i][x];
					}
				}
			}
		}
	}
	FORD(i, 20, 1)
	{
		FOR(j, 0, N)
		{
			ckmin(dup[i - 1][j].se, dup[i][j].se);
			ckmin(dup[i - 1][ancestor[i - 1][j]].se, dup[i][j].se);
			ckmax(dup[i - 1][j].fi, dup[i][j].fi);
			ckmax(dup[i - 1][ancestor[i - 1][j]].fi, dup[i][j].fi);
		}
	}
	FOR(i, 0, N)
	{
		bound[i] = dup[0][i];
		// cerr << bound[i].fi << ' ' << bound[i].se << endl;
	}
	vi compress;
	//you can have one or the other, but not both!
	FOR(i, 1, N)
	{
		compress.PB(bound[i].fi);
		compress.PB(bound[i].se);
	}
	compress.PB(-INF); compress.PB(INF);
	sort(ALL(compress));
	compress.erase(unique(ALL(compress)), compress.end());
	V = SZ(compress);
	FOR(i, 1, N)
	{
		bound[i].fi = LB(ALL(compress), bound[i].fi) - compress.begin();
		bound[i].se = LB(ALL(compress), bound[i].se) - compress.begin();
		assert(bound[i].fi != bound[i].se);
		if (bound[i] == MP(0, V - 1)) continue;
		edge1[bound[i].fi].PB({bound[i].se, i});
		edge1[bound[i].se].PB({bound[i].fi, i});
	}
	work(0);
	work(V - 1);
	FOR(i, 1, V - 1)
	{
		if (vis[i]) continue;
		for (pii p : edge1[i])
		{
			if (p.fi != 0 && p.fi != V - 1 && vis[p.fi])
			{
				assert(ans[p.se] == p.fi || ans[p.se] == i);
			}
		}
		pii p = edge1[i][0];
		ans[p.se] = i;
		// cerr << "ans" << p.se << " = " << i << endl;
		work(i);
	}
	FOR(i, 1, N)
	{
		VIS[ans[i]] = true;
	}
	FOR(i, 1, V - 1)
	{
		if (!VIS[i]) return 0;
	}
	FOR(i, 1, N)
	{
		cout << i + 1 << ' ' << parent[i] + 1 << ' ' << (ans[i] == 0 ? randomize(INF) : compress[ans[i]]) << '\n';
	}
	//we don't need to worry about 0 and V-1, but other ones we must satisfy
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Compilation message

minmaxtree.cpp: In function 'int32_t main()':
minmaxtree.cpp:254:48: warning: array subscript is below array bounds [-Warray-bounds]
    int w = lca(u, v), diff = depth[v] - depth[w] + 1;
                                         ~~~~~~~^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 24188 KB Output is correct
2 Correct 26 ms 24184 KB Output is correct
3 Correct 25 ms 24156 KB Output is correct
4 Correct 25 ms 24184 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 52028 KB Output is correct
2 Correct 193 ms 50284 KB Output is correct
3 Correct 269 ms 51048 KB Output is correct
4 Correct 290 ms 52320 KB Output is correct
5 Correct 297 ms 50892 KB Output is correct
6 Correct 259 ms 50944 KB Output is correct
7 Correct 192 ms 50412 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 48652 KB Output is correct
2 Correct 136 ms 49120 KB Output is correct
3 Correct 167 ms 49940 KB Output is correct
4 Correct 165 ms 50536 KB Output is correct
5 Correct 201 ms 49260 KB Output is correct
6 Correct 189 ms 49384 KB Output is correct
7 Incorrect 133 ms 47680 KB Unexpected end of file - int32 expected
8 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 24188 KB Output is correct
2 Correct 26 ms 24184 KB Output is correct
3 Correct 25 ms 24156 KB Output is correct
4 Correct 25 ms 24184 KB Output is correct
5 Correct 282 ms 52028 KB Output is correct
6 Correct 193 ms 50284 KB Output is correct
7 Correct 269 ms 51048 KB Output is correct
8 Correct 290 ms 52320 KB Output is correct
9 Correct 297 ms 50892 KB Output is correct
10 Correct 259 ms 50944 KB Output is correct
11 Correct 192 ms 50412 KB Output is correct
12 Correct 136 ms 48652 KB Output is correct
13 Correct 136 ms 49120 KB Output is correct
14 Correct 167 ms 49940 KB Output is correct
15 Correct 165 ms 50536 KB Output is correct
16 Correct 201 ms 49260 KB Output is correct
17 Correct 189 ms 49384 KB Output is correct
18 Incorrect 133 ms 47680 KB Unexpected end of file - int32 expected
19 Halted 0 ms 0 KB -