oj.uz

Submission #563970

# Submission time Handle Problem Language Result Execution time Memory
563970 2022-05-18T10:08:03 Z minhcool Road Closures (APIO21_roads) C++17
0 / 100
 2000 ms 9392 KB 
#include "roads.h"
#include<bits/stdc++.h>
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 1e5 + 5, oo = 1e18 + 7, mod = 1e9 + 7;

int n;

vector<ii> Adj[N];

int k;
int dp[N][2];

void dfs(int u, int p){
	int we;
	for(auto it : Adj[u]){
		int v = it.fi;
		if(v == p){
			we = it.se;
			continue;
		}
		dfs(v, u);
	}
	vector<int> vc;
	int sum = 0;
	for(auto it : Adj[u]){
		int v = it.fi;
		if(v == p) continue;
		sum += dp[v][0];
		vc.pb(dp[v][0] - dp[v][1]);
	}
	sort(vc.begin(), vc.end());
	reverse(vc.begin(), vc.end());
	int sum2 = 0;
	for(int i = 0; i < min((int)vc.size(), k - 1); i++){
		sum2 += max(0, vc[i]);
	}
	dp[u][0] = sum - sum2 - ((vc.size() < k || !k) ? 0 : max(0, vc[k - 1])) + we;
	dp[u][1] = sum - sum2;
	//cout << u << " " << dp[u][0] << " " << dp[u][1] << "\n";
}

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W){
	n = N;
	//cout << U.size() << " " << V.size() << " " << W.size() << "\n";
	//exit(0);
	for(int i = 0; i < (n - 1); i++){
		Adj[U[i]].pb({V[i], W[i]});
		Adj[V[i]].pb({U[i], W[i]});
	}
	vector<long long> ans;
	for(int i = 0; i < n; i++){
		k = i;
		dfs(1, 1);
		ans.pb(min(dp[1][0], dp[1][1]));		
	}
	return ans;
}

/*
void process(){
	int n;
	vector<int> a, b, c;
	cin >> n;
	for(int i = 1; i <= 3 * n - 3; i++){
		int x;
		cin >> x;
		if(i <= (n - 1)) a.pb(x);
		else if(i <= 2 * (n - 1)) b.pb(x);
		else c.pb(x);
	}
	vector<long long> temp = minimum_closure_costs(n, a, b, c);
	for(auto it : temp) cout << it << " ";
}

signed main(){
	ios_base::sync_with_stdio(0);
	process();
}*/

Compilation message

roads.cpp:14:34: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   14 | const int N = 1e5 + 5, oo = 1e18 + 7, mod = 1e9 + 7;
      |                             ~~~~~^~~
roads.cpp: In function 'void dfs(int, int)':
roads.cpp:47:38: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |  dp[u][0] = sum - sum2 - ((vc.size() < k || !k) ? 0 : max(0, vc[k - 1])) + we;
      |                            ~~~~~~~~~~^~~
roads.cpp:47:74: warning: 'we' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |  dp[u][0] = sum - sum2 - ((vc.size() < k || !k) ? 0 : max(0, vc[k - 1])) + we;
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 9392 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 9392 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -