oj.uz

Submission #424945

# Submission time Handle Problem Language Result Execution time Memory
424945 2021-06-12T11:54:23 Z amunduzbaev Designated Cities (JOI19_designated_cities) C++14
0 / 100
 465 ms 37472 KB 
/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
#define degub(x) cout<<#x<<" : "<<x<<"\n"
#define GG cout<<"here\n";
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update> ordered_set;
 
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, s, t, q, ans, res[N], a[N];
int par[N], cnt[N], cost[N];
vpii edges[N];
set<pii> ss;

void dfs(int u, int p = -1){
	if(sz(edges[u]) == 1){
		ss.insert({cost[u], u});
	}
	for(auto x : edges[u]) {
		if(x.ff == p) continue;
		par[x.ff] = u, cnt[u]++, cost[x.ff] = x.ss;
		dfs(x.ff, u);
	} 
}

int dfs1(int u, int p = -1, int dup = 0, int ddown = 0){
	int up = 0;
	for(auto x : edges[u]) if(x.ff == p) dup += x.ss, up = x.ss;
	cost[u] = ddown - dup;
	
	for(auto x : edges[u]){
		if(x.ff == p) continue; 
		up += dfs1(x.ff, u, dup, ddown + x.ss);
	} return up;
}

void solve(int t_case){
	cin>>n;
	int rr = 0;
	for(int i=1;i<n;i++){
		int a, b, c, d; cin>>a>>b>>c>>d;
		edges[a].pb({b, c}), edges[b].pb({a, d}); rr += c + d;
	}
	
	int root = -1;
	for(int i=1;i<=n;i++) if(sz(edges[i]) > 1) { root = i; break; }
	//~ assert(~root);
	if(root == -1) root = 1;
	
	dfs(root);
	int trr = 0;
	while(sz(ss) > 2){
		auto cur = *ss.begin(); 
		ss.erase(ss.begin());
		cnt[par[cur.ss]]--;
		if(cnt[par[cur.ss]] == 0) ss.insert({cost[par[cur.ss]] + cur.ff, par[cur.ss]});
		else trr += cur.ff, res[sz(ss)] = trr;
	} 
	
	int tot = dfs1(root, 1); res [1] = inf;
	for(int i=1;i<=n;i++) umin(res[1], rr - cost[i] - tot);
	//~ for(int i=1;i<=n;i++) cout<<cost[i]<<" ";
	//~ cout<<"\n";
	
	
	cin>>q;
	while(q--) { int x; cin>>x; cout<<res[x]<<"\n"; }
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

designated_cities.cpp: In function 'void usaco(std::string)':
designated_cities.cpp:34:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:35:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5020 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5024 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Incorrect 3 ms 4940 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 453 ms 26456 KB Output is correct
3 Correct 343 ms 36344 KB Output is correct
4 Correct 350 ms 26576 KB Output is correct
5 Correct 417 ms 27376 KB Output is correct
6 Correct 465 ms 28932 KB Output is correct
7 Correct 462 ms 29080 KB Output is correct
8 Correct 401 ms 37472 KB Output is correct
9 Incorrect 370 ms 32452 KB Output isn't correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5024 KB Output is correct
2 Incorrect 414 ms 26568 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5020 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5024 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Incorrect 3 ms 4940 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 453 ms 26456 KB Output is correct
3 Correct 343 ms 36344 KB Output is correct
4 Correct 350 ms 26576 KB Output is correct
5 Correct 417 ms 27376 KB Output is correct
6 Correct 465 ms 28932 KB Output is correct
7 Correct 462 ms 29080 KB Output is correct
8 Correct 401 ms 37472 KB Output is correct
9 Incorrect 370 ms 32452 KB Output isn't correct

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5020 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 5024 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Incorrect 3 ms 4940 KB Output isn't correct
7 Halted 0 ms 0 KB -