Submission #226271

#	Time	Username	Problem	Language	Result	Execution time	Memory
226271		_7_7_	Designated Cities (JOI19_designated_cities)	C++14	100 / 100	496 ms	46500 KiB

designated_cities

#include <bits/stdc++.h>                                           
 
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 3e5 + 11;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;


int n, q, a, b, c, d, e, sum, sumc, dp[N], res[N], cnt[N];
set < pii > Q;
bool was[N];


struct edge {
	int to, c, d;
	edge () {}
	edge (int _to, int _c, int _d) {
		to = _to;
		c = _c;
		d = _d;
	}
};
              

vector < edge > g[N];

void dfs (int v, int p = 0) {
	for (auto x : g[v]) 
		if (x.to != p) {
			dp[x.to] = dp[v] + x.c - x.d;
			dfs(x.to, v); 
			sumc += x.d;
		}
}

pii Find (int v) {
	for (auto x : g[v])
		if (!was[x.to]) 
			return {x.to, x.d};		
}

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

	dfs(1);
	res[1] = sum - (sumc + *max_element(dp + 1, dp + 1 + n));

	for (int i = 1; i <= n; ++i)
		if (cnt[i] == 1)
			Q.insert({Find(i).s, i});

	while (sz(Q) > 2) {
		int v = Q.begin()->s, u = Q.begin()->f;
		was[v] = 1;
		Q.erase(Q.begin());		
		int p = Find(v).f;
		--cnt[p];
		if (cnt[p] == 1) {
			int x = Find(p).s;
			Q.insert({x + u, p});
		} else
			res[sz(Q)] = res[sz(Q) + 1] + u;
	}


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

Compilation message (stderr)

designated_cities.cpp:74:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
designated_cities.cpp: In function 'pii Find(long long int)':
designated_cities.cpp:72:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
designated_cities.cpp: In function 'int main()':
designated_cities.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
designated_cities.cpp:77:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:106:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &q);
  ~~~~~^~~~~~~~~~~~
designated_cities.cpp:108:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &e);
   ~~~~~^~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 17 / 17
• Subtask 5: 17 / 17
• Subtask 6: 44 / 44