oj.uz

답안 #409947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
409947 2021-05-21T19:41:10 Z LucaDantas Designated Cities (JOI19_designated_cities) C++17
22 / 100
 1414 ms 58992 KB 
// Se eu pegar um cara qualquer e definir que ele vai ser um resort e minha raiz
// eu posso fazer um guloso escolhendo sempre o cara mais fundo e atualizando a profundidade
// dos outros, o problema é que eu nao necessariamente preciso pegar essa raiz
// entao eu teria q brutar todas as possiveis, o que ficaria n^2, já pega n<=2000 though
// Faço um centroid e em cada nivel eu escolho sempre caras de pelo menos duas subarvores
// diferentes, se a melhor resposta n tiver ai so descer nos filhos e ta safe
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#include <iostream>
#include <cassert>
using namespace std;

// template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '['; string sep = ""; for (const auto &x : v) os << sep << x, sep = ", "; return os << ']'; }
// template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }

// #ifdef MY_DEBUG_FLAG
// void debug() { cerr << endl; }
// template<typename Ini, typename... Fim> void debug(Ini I, Fim... F) { cerr << I; if(sizeof...(F)) cerr << ", "; debug(F...);}
// #define db(...) cerr << "DEBUG (" << #__VA_ARGS__ << ") == ", debug(__VA_ARGS__)
// #else
// #define db(...) 1
// #endif

using ll = long long;

#define int ll

#define pb push_back
#define sz(a) (int)((a).size())
#define all(a) (a).begin(), (a).end()

constexpr int maxn = 2e5+10;

vector<pair<int,int>> g[maxn];

ll ans[maxn];

struct Centroid {
	bool mark[maxn]; int sz[maxn];
	void pre(int u, int p = 0) {
		sz[u] = 1;
		for(auto [v, w] : g[u]) if(!mark[v] && v != p)
			pre(v, u), sz[u] += sz[v];
	}
	int get(int u) {
		for(auto [v, w] : g[u]) if((sz[v] << 1) > sz[u] && !mark[v])
			return (sz[u] -= sz[v], sz[v] += sz[u], get(v));
		return u;
	}
	
	ll dfs(int u, int p, ll& cost, vector<pair<ll,int>>& guloso, int idx) {
		vector<ll> td;
		ll maior = 0;
		for(auto [v, w] : g[u]) {
			if(v == p) cost += w;
			else if(!mark[v]) {
				ll gld = dfs(v, u, cost, guloso, idx) + w;
				td.pb(gld);
				if(gld > maior) maior = gld;
			}
		}
		bool ok = 0;
		for(ll a : td) {
			if(a == maior && !ok) ok = 1;
			else guloso.pb({a, idx});
		}
		return maior;
	}

	void decompose(int u, ll add) {
		pre(u); u = get(u);

		mark[u] = 1;
		
		vector<ll> custo;
		
		vector<pair<ll,int>> guloso;
		
		int idx = 0;
		ll custo_tot = 0;
		
		guloso.pb({0, -1});
		for(auto [v, w] : g[u]) {
			if(mark[v]) continue;
			ll cost = 0;
			ll gld = dfs(v, u, cost, guloso, idx) + w;
			guloso.pb({gld, idx});
			custo.pb(cost); custo_tot += cost;
			++idx;
		}

		// db(u, add, guloso, custo, custo_tot);
		
		sort(all(guloso));
		reverse(all(guloso));

		// ans[1] = max(ans[1], custo_tot + add);

		if(sz(guloso) > 1) {
			idx = guloso.front().second;

			int primeiro = 0;
			for(int i = 0; i < sz(guloso); i++)
				if(guloso[i].second != idx) { primeiro = i; break; }
			assert(primeiro >= 1);
			
			ll bom = custo_tot, foi = guloso[primeiro].first, ok = 1;
			
			for(int i = 0; i < sz(guloso); i++) {
				bom += guloso[i].first;
				if(primeiro == i) foi = 0, ok = 0;
				ans[i + 1 + ok] = max(ans[i + 1 + ok], bom + foi + add);
			}
		}

		ll val = 0;

		vector<ll> suf;
		for(int i = sz(custo)-1; i >= 0; i--)
			suf.pb(val), val += custo[i];
		reverse(all(suf));

		val = 0;
		int i = 0;
		for(auto [v, w] : g[u]) {
			if(mark[v]) continue;
			decompose(v, val + suf[i] + w);
			val += custo[i];
			++i;
		}
	}
} centroid;

ll aq[maxn];

struct AAA
{
	int v, w, back;
};

vector<AAA> g_esp[maxn];

void pre_caso1(int u, int p) {
	for(auto [v, w, back] : g_esp[u]) {
		if(v == p) continue;
		pre_caso1(v, u);
		aq[u] += aq[v] + back;
	}
}

void caso1(int u, int p) {
	ans[1] = max(ans[1], aq[u]);
	for(auto [v, w, back] : g_esp[u]) {
		if(v == p) continue;
		aq[v] = w + aq[u] - back;
		caso1(v, u);
	}
}

int32_t main() {
	int n; scanf("%lld", &n);
	ll tot = 0;
	for(int i = 1; i < n; i++) {
		int a, b, c, d; scanf("%lld %lld %lld %lld", &a, &b, &c, &d);
		g[a].pb({b, c});
		g[b].pb({a, d});
		tot += c + d;

		g_esp[a].pb({b, c, d});
		g_esp[b].pb({a, d, c});
	}

	centroid.decompose(1, 0);

	for(int i = 2; i <= n; i++)
		ans[i] = max(ans[i], ans[i-1]);

	pre_caso1(1, 0);
	caso1(1, 0);

	int q; scanf("%lld", &q);
	while(q--) {
		int e; scanf("%lld", &e);
		printf("%lld\n", tot - ans[e]);
	}
}

Compilation message

designated_cities.cpp: In function 'int32_t main()':
designated_cities.cpp:163:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  163 |  int n; scanf("%lld", &n);
      |         ~~~~~^~~~~~~~~~~~
designated_cities.cpp:166:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  166 |   int a, b, c, d; scanf("%lld %lld %lld %lld", &a, &b, &c, &d);
      |                   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:183:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  183 |  int q; scanf("%lld", &q);
      |         ~~~~~^~~~~~~~~~~~
designated_cities.cpp:185:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  185 |   int e; scanf("%lld", &e);
      |          ~~~~~^~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 8 ms 9676 KB Output is correct
3 Correct 7 ms 9656 KB Output is correct
4 Correct 7 ms 9660 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 8 ms 9652 KB Output is correct
7 Correct 7 ms 9668 KB Output is correct
8 Correct 7 ms 9676 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 7 ms 9700 KB Output is correct
11 Correct 7 ms 9676 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 947 ms 38236 KB Output is correct
3 Correct 1280 ms 50360 KB Output is correct
4 Correct 972 ms 38456 KB Output is correct
5 Correct 516 ms 38972 KB Output is correct
6 Correct 1208 ms 40260 KB Output is correct
7 Correct 433 ms 38968 KB Output is correct
8 Correct 1346 ms 51252 KB Output is correct
9 Correct 329 ms 42068 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9616 KB Output is correct
2 Correct 1030 ms 38580 KB Output is correct
3 Correct 1329 ms 52592 KB Output is correct
4 Correct 1043 ms 38612 KB Output is correct
5 Correct 539 ms 39076 KB Output is correct
6 Correct 1282 ms 42360 KB Output is correct
7 Correct 332 ms 42796 KB Output is correct
8 Correct 1414 ms 47872 KB Output is correct
9 Correct 300 ms 42064 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 8 ms 9676 KB Output is correct
3 Correct 7 ms 9656 KB Output is correct
4 Correct 7 ms 9660 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 8 ms 9652 KB Output is correct
7 Correct 7 ms 9668 KB Output is correct
8 Correct 7 ms 9676 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 7 ms 9700 KB Output is correct
11 Correct 7 ms 9676 KB Output is correct
12 Correct 7 ms 9704 KB Output is correct
13 Correct 11 ms 10060 KB Output is correct
14 Correct 13 ms 10164 KB Output is correct
15 Correct 11 ms 9992 KB Output is correct
16 Correct 11 ms 10060 KB Output is correct
17 Incorrect 11 ms 10096 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 947 ms 38236 KB Output is correct
3 Correct 1280 ms 50360 KB Output is correct
4 Correct 972 ms 38456 KB Output is correct
5 Correct 516 ms 38972 KB Output is correct
6 Correct 1208 ms 40260 KB Output is correct
7 Correct 433 ms 38968 KB Output is correct
8 Correct 1346 ms 51252 KB Output is correct
9 Correct 329 ms 42068 KB Output is correct
10 Correct 7 ms 9616 KB Output is correct
11 Correct 1030 ms 38580 KB Output is correct
12 Correct 1329 ms 52592 KB Output is correct
13 Correct 1043 ms 38612 KB Output is correct
14 Correct 539 ms 39076 KB Output is correct
15 Correct 1282 ms 42360 KB Output is correct
16 Correct 332 ms 42796 KB Output is correct
17 Correct 1414 ms 47872 KB Output is correct
18 Correct 300 ms 42064 KB Output is correct
19 Correct 7 ms 9688 KB Output is correct
20 Correct 981 ms 44832 KB Output is correct
21 Correct 1332 ms 58992 KB Output is correct
22 Correct 1025 ms 43604 KB Output is correct
23 Correct 997 ms 45264 KB Output is correct
24 Incorrect 1008 ms 44424 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9676 KB Output is correct
2 Correct 8 ms 9676 KB Output is correct
3 Correct 7 ms 9656 KB Output is correct
4 Correct 7 ms 9660 KB Output is correct
5 Correct 7 ms 9676 KB Output is correct
6 Correct 8 ms 9652 KB Output is correct
7 Correct 7 ms 9668 KB Output is correct
8 Correct 7 ms 9676 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 7 ms 9700 KB Output is correct
11 Correct 7 ms 9676 KB Output is correct
12 Correct 7 ms 9676 KB Output is correct
13 Correct 947 ms 38236 KB Output is correct
14 Correct 1280 ms 50360 KB Output is correct
15 Correct 972 ms 38456 KB Output is correct
16 Correct 516 ms 38972 KB Output is correct
17 Correct 1208 ms 40260 KB Output is correct
18 Correct 433 ms 38968 KB Output is correct
19 Correct 1346 ms 51252 KB Output is correct
20 Correct 329 ms 42068 KB Output is correct
21 Correct 7 ms 9616 KB Output is correct
22 Correct 1030 ms 38580 KB Output is correct
23 Correct 1329 ms 52592 KB Output is correct
24 Correct 1043 ms 38612 KB Output is correct
25 Correct 539 ms 39076 KB Output is correct
26 Correct 1282 ms 42360 KB Output is correct
27 Correct 332 ms 42796 KB Output is correct
28 Correct 1414 ms 47872 KB Output is correct
29 Correct 300 ms 42064 KB Output is correct
30 Correct 7 ms 9704 KB Output is correct
31 Correct 11 ms 10060 KB Output is correct
32 Correct 13 ms 10164 KB Output is correct
33 Correct 11 ms 9992 KB Output is correct
34 Correct 11 ms 10060 KB Output is correct
35 Incorrect 11 ms 10096 KB Output isn't correct
36 Halted 0 ms 0 KB -