oj.uz

Submission #564356

# Submission time Handle Problem Language Result Execution time Memory
564356 2022-05-19T03:31:52 Z minhcool Road Closures (APIO21_roads) C++17
36 / 100
 2000 ms 25688 KB 
#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
 
#define ll 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;
 
ll n;
 
vector<ii> Adj[N];
 
ll k;
ll dp[N][2];

bool vis[N];
 
void dfs(int u, int p){
	vis[u] = 1;
	int we = 0;
	for(auto it : Adj[u]){
		int v = it.fi;
		if(v == p){
			we = it.se;
			continue;
		}
		if(Adj[v].size() <= k) continue;
		dfs(v, u);
	}
	vector<ll> vc;
	ll sum = 0;
	for(auto it : Adj[u]){
		int v = it.fi;
		if(v == p) continue;
		if(Adj[v].size() > k){
			sum += dp[v][0];
			vc.pb(dp[v][0] - dp[v][1]);
		}
		else{
			sum += it.se;
			vc.pb(it.se);
		}
	}
	sort(vc.begin(), vc.end());
	reverse(vc.begin(), vc.end());
	ll sum2 = 0;
	for(int i = 0; i < min((ll)vc.size(), (ll)k - 1); i++){
		sum2 += max(0LL, vc[i]);
	}
	dp[u][0] = sum - sum2 - (((ll)vc.size() < k || !k) ? 0 : max(0LL, vc[k - 1])) + we;
	dp[u][1] = sum - sum2;
	//cout << u << " " << dp[u][0] << " " << dp[u][1] << "\n";
}
 
bool ck_star(){
	int tol = 0;
	for(int i=  1; i <= n; i++) tol += (Adj[i].size() >= 2);
	return (tol == 1);
}
 
bool ck_line(){
	for(int i = 1; i <= n; i++) if(Adj[i].size() > 2) return 0;
	return 1;
}
 
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++){
		U[i]++, V[i]++;
		Adj[U[i]].pb({V[i], W[i]});
		Adj[V[i]].pb({U[i], W[i]});
	}
	if(ck_star()){
		sort(W.begin(), W.end(), greater<int>());
		vector<ll> ans(n);
		ll sum = 0;
		for(int i = n - 1; i >= 0; i--){
			ans[i] = sum;
			if(i) sum += W[i - 1];
		}
		return ans;
	}
	int mx_deg = 0;
	for(int i = 1; i <= n; i++) mx_deg = max(mx_deg, (int)Adj[i].size());
	vector<ll> ans;
	for(int i = 0; i < mx_deg; i++){
		k = i;
		for(int j = 1; j <= n; j++) vis[j] = 0;
		ll answ = 0;
		for(int j = 1; j <= n; j++){
			if(!vis[j] && Adj[j].size() > k){
				dfs(j, j);
				answ += dp[j][0];
			}
		}
		ans.pb(answ);
		/*
		k = i;
		dfs(1, 1);
		ans.pb(min(dp[1][0], dp[1][1]));*/
	}
	for(int i = mx_deg; i < n; i++) ans.pb(0);
	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);
	freopen("roads.inp", "r", stdin);
	freopen("roads.out", "w", stdout);
	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:34:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   34 |   if(Adj[v].size() <= k) continue;
      |      ~~~~~~~~~~~~~~^~~~
roads.cpp:42:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   42 |   if(Adj[v].size() > k){
      |      ~~~~~~~~~~~~~~^~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:100:32: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  100 |    if(!vis[j] && Adj[j].size() > k){
      |                  ~~~~~~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 4 ms 2796 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 2 ms 2656 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 29 ms 7408 KB Output is correct
13 Correct 48 ms 10556 KB Output is correct
14 Correct 58 ms 10688 KB Output is correct
15 Correct 78 ms 11532 KB Output is correct
16 Correct 63 ms 11672 KB Output is correct
17 Correct 55 ms 11844 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 46 ms 9840 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 62 ms 21804 KB Output is correct
3 Correct 68 ms 24076 KB Output is correct
4 Correct 68 ms 25488 KB Output is correct
5 Correct 72 ms 25688 KB Output is correct
6 Correct 3 ms 3028 KB Output is correct
7 Correct 4 ms 3048 KB Output is correct
8 Correct 3 ms 2964 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 37 ms 15804 KB Output is correct
13 Correct 61 ms 24760 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 60 ms 22624 KB Output is correct
16 Correct 60 ms 24808 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2660 KB Output is correct
4 Correct 3 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2656 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2612 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2656 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2660 KB Output is correct
4 Correct 3 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2656 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2612 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2656 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 3 ms 2792 KB Output is correct
24 Correct 3 ms 2792 KB Output is correct
25 Correct 3 ms 2772 KB Output is correct
26 Correct 4 ms 2772 KB Output is correct
27 Correct 23 ms 2880 KB Output is correct
28 Correct 11 ms 2864 KB Output is correct
29 Correct 3 ms 2772 KB Output is correct
30 Correct 6 ms 2900 KB Output is correct
31 Correct 8 ms 2800 KB Output is correct
32 Correct 20 ms 2880 KB Output is correct
33 Correct 3 ms 3028 KB Output is correct
34 Correct 4 ms 3028 KB Output is correct
35 Correct 3 ms 3028 KB Output is correct
36 Correct 3 ms 2792 KB Output is correct
37 Correct 3 ms 2772 KB Output is correct
38 Correct 3 ms 2772 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2652 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 2 ms 2644 KB Output is correct
48 Correct 2 ms 2644 KB Output is correct
49 Correct 2 ms 2652 KB Output is correct
50 Correct 2 ms 2656 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 2 ms 2652 KB Output is correct
53 Correct 3 ms 2772 KB Output is correct
54 Correct 3 ms 2772 KB Output is correct
55 Correct 16 ms 2864 KB Output is correct
56 Correct 3 ms 2796 KB Output is correct
57 Correct 3 ms 2816 KB Output is correct
58 Correct 2 ms 2644 KB Output is correct
59 Correct 2 ms 2644 KB Output is correct
60 Correct 2 ms 2644 KB Output is correct
61 Correct 2 ms 2644 KB Output is correct
62 Correct 2 ms 2664 KB Output is correct
63 Correct 3 ms 2644 KB Output is correct
64 Correct 4 ms 2792 KB Output is correct
65 Correct 3 ms 2772 KB Output is correct
66 Correct 6 ms 2772 KB Output is correct
67 Correct 20 ms 2860 KB Output is correct
68 Correct 4 ms 2772 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 12516 KB Output is correct
2 Correct 98 ms 12456 KB Output is correct
3 Correct 532 ms 13572 KB Output is correct
4 Correct 115 ms 12876 KB Output is correct
5 Correct 501 ms 13596 KB Output is correct
6 Execution timed out 2077 ms 12104 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 12516 KB Output is correct
2 Correct 98 ms 12456 KB Output is correct
3 Correct 532 ms 13572 KB Output is correct
4 Correct 115 ms 12876 KB Output is correct
5 Correct 501 ms 13596 KB Output is correct
6 Execution timed out 2077 ms 12104 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2772 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 4 ms 2796 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 2 ms 2656 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 29 ms 7408 KB Output is correct
13 Correct 48 ms 10556 KB Output is correct
14 Correct 58 ms 10688 KB Output is correct
15 Correct 78 ms 11532 KB Output is correct
16 Correct 63 ms 11672 KB Output is correct
17 Correct 55 ms 11844 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 46 ms 9840 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 62 ms 21804 KB Output is correct
22 Correct 68 ms 24076 KB Output is correct
23 Correct 68 ms 25488 KB Output is correct
24 Correct 72 ms 25688 KB Output is correct
25 Correct 3 ms 3028 KB Output is correct
26 Correct 4 ms 3048 KB Output is correct
27 Correct 3 ms 2964 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 37 ms 15804 KB Output is correct
32 Correct 61 ms 24760 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 60 ms 22624 KB Output is correct
35 Correct 60 ms 24808 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 2 ms 2660 KB Output is correct
39 Correct 3 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2656 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 2 ms 2612 KB Output is correct
48 Correct 2 ms 2644 KB Output is correct
49 Correct 2 ms 2644 KB Output is correct
50 Correct 2 ms 2644 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 2 ms 2644 KB Output is correct
53 Correct 2 ms 2644 KB Output is correct
54 Correct 2 ms 2644 KB Output is correct
55 Correct 2 ms 2656 KB Output is correct
56 Correct 2 ms 2644 KB Output is correct
57 Correct 2 ms 2644 KB Output is correct
58 Correct 3 ms 2792 KB Output is correct
59 Correct 3 ms 2792 KB Output is correct
60 Correct 3 ms 2772 KB Output is correct
61 Correct 4 ms 2772 KB Output is correct
62 Correct 23 ms 2880 KB Output is correct
63 Correct 11 ms 2864 KB Output is correct
64 Correct 3 ms 2772 KB Output is correct
65 Correct 6 ms 2900 KB Output is correct
66 Correct 8 ms 2800 KB Output is correct
67 Correct 20 ms 2880 KB Output is correct
68 Correct 3 ms 3028 KB Output is correct
69 Correct 4 ms 3028 KB Output is correct
70 Correct 3 ms 3028 KB Output is correct
71 Correct 3 ms 2792 KB Output is correct
72 Correct 3 ms 2772 KB Output is correct
73 Correct 3 ms 2772 KB Output is correct
74 Correct 2 ms 2644 KB Output is correct
75 Correct 2 ms 2644 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 2 ms 2652 KB Output is correct
78 Correct 2 ms 2644 KB Output is correct
79 Correct 2 ms 2644 KB Output is correct
80 Correct 2 ms 2644 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 2 ms 2644 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2652 KB Output is correct
85 Correct 2 ms 2656 KB Output is correct
86 Correct 2 ms 2644 KB Output is correct
87 Correct 2 ms 2652 KB Output is correct
88 Correct 3 ms 2772 KB Output is correct
89 Correct 3 ms 2772 KB Output is correct
90 Correct 16 ms 2864 KB Output is correct
91 Correct 3 ms 2796 KB Output is correct
92 Correct 3 ms 2816 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 2 ms 2644 KB Output is correct
95 Correct 2 ms 2644 KB Output is correct
96 Correct 2 ms 2644 KB Output is correct
97 Correct 2 ms 2664 KB Output is correct
98 Correct 3 ms 2644 KB Output is correct
99 Correct 4 ms 2792 KB Output is correct
100 Correct 3 ms 2772 KB Output is correct
101 Correct 6 ms 2772 KB Output is correct
102 Correct 20 ms 2860 KB Output is correct
103 Correct 4 ms 2772 KB Output is correct
104 Correct 89 ms 12516 KB Output is correct
105 Correct 98 ms 12456 KB Output is correct
106 Correct 532 ms 13572 KB Output is correct
107 Correct 115 ms 12876 KB Output is correct
108 Correct 501 ms 13596 KB Output is correct
109 Execution timed out 2077 ms 12104 KB Time limit exceeded
110 Halted 0 ms 0 KB -