oj.uz

Submission #409951

# Submission time Handle Problem Language Result Execution time Memory
409951 2021-05-21T19:43:50 Z LucaDantas Designated Cities (JOI19_designated_cities) C++17
22 / 100
 1528 ms 52844 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);
	pre_caso1(1, 0);
	caso1(1, 0);

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


	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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9712 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 6 ms 9696 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 7 ms 9696 KB Output is correct
9 Correct 6 ms 9700 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 915 ms 38200 KB Output is correct
3 Correct 1224 ms 50416 KB Output is correct
4 Correct 1000 ms 38784 KB Output is correct
5 Correct 499 ms 38936 KB Output is correct
6 Correct 1133 ms 40504 KB Output is correct
7 Correct 411 ms 39060 KB Output is correct
8 Correct 1241 ms 51440 KB Output is correct
9 Correct 305 ms 42280 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 982 ms 38580 KB Output is correct
3 Correct 1251 ms 52464 KB Output is correct
4 Correct 1016 ms 38580 KB Output is correct
5 Correct 534 ms 38980 KB Output is correct
6 Correct 1305 ms 42448 KB Output is correct
7 Correct 349 ms 42864 KB Output is correct
8 Correct 1528 ms 47920 KB Output is correct
9 Correct 319 ms 42236 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9712 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 6 ms 9696 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 7 ms 9696 KB Output is correct
9 Correct 6 ms 9700 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 7 ms 9692 KB Output is correct
13 Correct 12 ms 10060 KB Output is correct
14 Correct 11 ms 10188 KB Output is correct
15 Correct 12 ms 10060 KB Output is correct
16 Correct 11 ms 10060 KB Output is correct
17 Incorrect 11 ms 10060 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 915 ms 38200 KB Output is correct
3 Correct 1224 ms 50416 KB Output is correct
4 Correct 1000 ms 38784 KB Output is correct
5 Correct 499 ms 38936 KB Output is correct
6 Correct 1133 ms 40504 KB Output is correct
7 Correct 411 ms 39060 KB Output is correct
8 Correct 1241 ms 51440 KB Output is correct
9 Correct 305 ms 42280 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 982 ms 38580 KB Output is correct
12 Correct 1251 ms 52464 KB Output is correct
13 Correct 1016 ms 38580 KB Output is correct
14 Correct 534 ms 38980 KB Output is correct
15 Correct 1305 ms 42448 KB Output is correct
16 Correct 349 ms 42864 KB Output is correct
17 Correct 1528 ms 47920 KB Output is correct
18 Correct 319 ms 42236 KB Output is correct
19 Correct 7 ms 9692 KB Output is correct
20 Correct 991 ms 38756 KB Output is correct
21 Correct 1485 ms 52844 KB Output is correct
22 Correct 993 ms 38816 KB Output is correct
23 Correct 971 ms 39096 KB Output is correct
24 Incorrect 975 ms 39368 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9712 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 6 ms 9696 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 7 ms 9696 KB Output is correct
9 Correct 6 ms 9700 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 915 ms 38200 KB Output is correct
14 Correct 1224 ms 50416 KB Output is correct
15 Correct 1000 ms 38784 KB Output is correct
16 Correct 499 ms 38936 KB Output is correct
17 Correct 1133 ms 40504 KB Output is correct
18 Correct 411 ms 39060 KB Output is correct
19 Correct 1241 ms 51440 KB Output is correct
20 Correct 305 ms 42280 KB Output is correct
21 Correct 5 ms 9676 KB Output is correct
22 Correct 982 ms 38580 KB Output is correct
23 Correct 1251 ms 52464 KB Output is correct
24 Correct 1016 ms 38580 KB Output is correct
25 Correct 534 ms 38980 KB Output is correct
26 Correct 1305 ms 42448 KB Output is correct
27 Correct 349 ms 42864 KB Output is correct
28 Correct 1528 ms 47920 KB Output is correct
29 Correct 319 ms 42236 KB Output is correct
30 Correct 7 ms 9692 KB Output is correct
31 Correct 12 ms 10060 KB Output is correct
32 Correct 11 ms 10188 KB Output is correct
33 Correct 12 ms 10060 KB Output is correct
34 Correct 11 ms 10060 KB Output is correct
35 Incorrect 11 ms 10060 KB Output isn't correct
36 Halted 0 ms 0 KB -