oj.uz

답안 #102282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102282 2019-03-24T06:00:31 Z qkxwsm Designated Cities (JOI19_designated_cities) C++14
23 / 100
 2000 ms 53832 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 < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); 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 200013

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, Q, R;
vpi edge[MAXN];
ll ans[MAXN];
ll tot;
int parent[MAXN], subtree[MAXN];
ll down[MAXN], up[MAXN];
ll enter[MAXN];
ll best[MAXN];
vl others[MAXN];
bitset<MAXN> done;

void dfs1(int u)
{
	subtree[u] = 1;
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (v == parent[u])
		{
			up[u] += d;
		}
	}
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (v == parent[u] || done[v]) continue;
		parent[v] = u;
		down[v] = down[u] + d;
		up[v] = up[u];
		dfs1(v);
		subtree[u] += subtree[v];
	}
}
void dfs(int u)
{
	subtree[u] = 1;
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (v == parent[u] || done[v]) continue;
		parent[v] = u;
		dfs(v);
		subtree[u] += subtree[v];
	}
}
void clean(int u)
{
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (v == parent[u] || done[v]) continue;
		clean(v);
	}
	subtree[u] = 0;
	parent[u] = N;
	others[u].clear();
	best[u] = 0;
}
int find_cent(int u, int sz)
{
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (v == parent[u] || done[v]) continue;
		if (subtree[v] * 2 > (sz / 2)) return find_cent(v, sz);
	}
	return u;
}
void solve(int u)
{
	bool flag = true;
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (v == parent[u] || done[v]) continue;
		flag = false;
		solve(v);
	}
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (v == parent[u] || done[v]) continue;
		if (SZ(others[v]) >= SZ(others[u]))
		{
			swap(others[v], others[u]);
		}
		others[u].insert(others[u].end(), ALL(others[v]));
		ll cur = best[u], could = best[v] + d;
		if (cur) others[u].PB(min(cur, could));
		best[u] = max(cur, could);
	}
	return;
}
//now centroid decomp!
void go(int u)
{
	dfs(u);
	ll mx1 = -LLINF, mx2 = -LLINF;
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (v == parent[u] || done[v]) continue;
		solve(v);
		ll cur = best[v] + d;
		if (cur > mx1)
		{
			if (mx2 != -LLINF) others[u].PB(mx2);
			mx2 = mx1;
			mx1 = cur;
		}
		else if (cur > mx2)
		{
			if (mx2 != -LLINF) others[u].PB(mx2);
			mx2 = cur;
		}
		else
		{
			others[u].PB(cur);
		}
		others[u].insert(others[u].end(), ALL(others[v]));
	}
	sort(ALL(others[u]));
	ll sum = enter[u] - mx1 - mx2;
	ckmin(ans[2], sum);
	FOR(i, 3, 3 + SZ(others[u]))
	{
		sum -= others[u][SZ(others[u]) - i + 2];
		ckmin(ans[i], sum);
	}
	done[u] = true;
	clean(u);
	for (pii p : edge[u])
	{
		int v = p.se, d = p.fi;
		if (done[v]) continue;
		dfs(v);
		if (subtree[v] == 1) continue;
		int c = find_cent(v, subtree[v]);
		clean(v);
		go(c);
	}
	return;
}


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;
	// N = 10000;
	FOR(i, 0, N - 1)
	{
		int u, v; ll c, d;
		cin >> u >> v >> c >> d;
		u--; v--;
		tot += (c + d);
		edge[u].PB({c, v});
		edge[v].PB({d, u});
	}
	FOR(i, 0, N) if (SZ(edge[i]) != 1) R = i;
	parent[R] = N;
	dfs1(R);
	ll totdown = 0;
	FOR(i, 0, N)
	{
		for (pii p : edge[i])
		{
			int v = p.se, d = p.fi;
			if (v != parent[i]) totdown += d;
		}
	}
	FOR(u, 0, N) enter[u] = totdown + up[u] - down[u];
	FOR(i, 1, N + 1) ans[i] = LLINF;
	go(R);
	FOR(u, 0, N) ckmin(ans[1], enter[u]);
	FOR(i, 1, N) ckmin(ans[i + 1], ans[i]);
	cin >> Q;
	while(Q--)
	{
		int x;
		cin >> x;
		if (N == 2)
		{
			cout << (x == 1 ? ans[x] : 0) << '\n';
			continue;
		}
		cout << ans[x] << '\n';
	}
	// 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

designated_cities.cpp: In function 'void dfs(int)':
designated_cities.cpp:191:17: warning: unused variable 'd' [-Wunused-variable]
   int v = p.se, d = p.fi;
                 ^
designated_cities.cpp: In function 'void clean(int)':
designated_cities.cpp:202:17: warning: unused variable 'd' [-Wunused-variable]
   int v = p.se, d = p.fi;
                 ^
designated_cities.cpp: In function 'int find_cent(int, int)':
designated_cities.cpp:215:17: warning: unused variable 'd' [-Wunused-variable]
   int v = p.se, d = p.fi;
                 ^
designated_cities.cpp: In function 'void solve(int)':
designated_cities.cpp:226:17: warning: unused variable 'd' [-Wunused-variable]
   int v = p.se, d = p.fi;
                 ^
designated_cities.cpp:223:7: warning: variable 'flag' set but not used [-Wunused-but-set-variable]
  bool flag = true;
       ^~~~
designated_cities.cpp: In function 'void go(int)':
designated_cities.cpp:286:17: warning: unused variable 'd' [-Wunused-variable]
   int v = p.se, d = p.fi;
                 ^

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 9840 KB Output is correct
2 Correct 13 ms 9728 KB Output is correct
3 Correct 12 ms 9804 KB Output is correct
4 Correct 13 ms 9856 KB Output is correct
5 Correct 12 ms 9728 KB Output is correct
6 Correct 13 ms 9728 KB Output is correct
7 Correct 12 ms 9728 KB Output is correct
8 Correct 14 ms 9856 KB Output is correct
9 Correct 14 ms 9828 KB Output is correct
10 Correct 13 ms 9836 KB Output is correct
11 Correct 12 ms 9728 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 9828 KB Output is correct
2 Execution timed out 2050 ms 53832 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 9772 KB Output is correct
2 Execution timed out 2033 ms 52956 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 9840 KB Output is correct
2 Correct 13 ms 9728 KB Output is correct
3 Correct 12 ms 9804 KB Output is correct
4 Correct 13 ms 9856 KB Output is correct
5 Correct 12 ms 9728 KB Output is correct
6 Correct 13 ms 9728 KB Output is correct
7 Correct 12 ms 9728 KB Output is correct
8 Correct 14 ms 9856 KB Output is correct
9 Correct 14 ms 9828 KB Output is correct
10 Correct 13 ms 9836 KB Output is correct
11 Correct 12 ms 9728 KB Output is correct
12 Correct 12 ms 9728 KB Output is correct
13 Correct 20 ms 10240 KB Output is correct
14 Correct 18 ms 10240 KB Output is correct
15 Correct 17 ms 10240 KB Output is correct
16 Correct 19 ms 10240 KB Output is correct
17 Correct 18 ms 10368 KB Output is correct
18 Correct 19 ms 10112 KB Output is correct
19 Correct 17 ms 10112 KB Output is correct
20 Correct 16 ms 10112 KB Output is correct
21 Correct 18 ms 10172 KB Output is correct
22 Correct 19 ms 10240 KB Output is correct
23 Correct 18 ms 10240 KB Output is correct
24 Correct 15 ms 10112 KB Output is correct
25 Correct 19 ms 10240 KB Output is correct
26 Correct 16 ms 9984 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 9828 KB Output is correct
2 Execution timed out 2050 ms 53832 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 9840 KB Output is correct
2 Correct 13 ms 9728 KB Output is correct
3 Correct 12 ms 9804 KB Output is correct
4 Correct 13 ms 9856 KB Output is correct
5 Correct 12 ms 9728 KB Output is correct
6 Correct 13 ms 9728 KB Output is correct
7 Correct 12 ms 9728 KB Output is correct
8 Correct 14 ms 9856 KB Output is correct
9 Correct 14 ms 9828 KB Output is correct
10 Correct 13 ms 9836 KB Output is correct
11 Correct 12 ms 9728 KB Output is correct
12 Correct 14 ms 9828 KB Output is correct
13 Execution timed out 2050 ms 53832 KB Time limit exceeded
14 Halted 0 ms 0 KB -