oj.uz

Submission #677709

# Submission time Handle Problem Language Result Execution time Memory
677709 2023-01-04T08:09:37 Z YENGOYAN Road Closures (APIO21_roads) C++17
36 / 100
 371 ms 32156 KB 
#include "roads.h"
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>
using namespace std;
using ll = long long;

vector<vector<pair<int, int>>> gp;
vector<vector<ll>> dp;
vector<ll> linear_w;

void dfs(int u, int p, int k) {
	vector<ll> vec;
	dp[u][0] = 0;
	for (pair<int, int>& v : gp[u]) {
		if (v.first == p) continue;
		dfs(v.first, u, k);
		dp[u][0] += dp[v.first][k];
		vec.push_back(dp[v.first][k - 1] + v.second - dp[v.first][k]);
	}
	sort(vec.rbegin(), vec.rend());
	int lsti = 0;
	for (int i = 1, j = 0; i <= k && j < vec.size(); ++i, ++j) {
		dp[u][i] = dp[u][i - 1];
		dp[u][i] += max(0ll, vec[j]);
		lsti = i;
	}
	if (lsti < k) dp[u][k] = dp[u][lsti];
	if (lsti < k - 1) dp[u][k - 1] = dp[u][lsti];
}

void to_line(int u, int p) {
	for (pair<int, int>& v : gp[u]) {
		if (v.first == p) continue;
		linear_w.push_back(v.second);
		to_line(v.first, u);
	}
}

vector<ll> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) {
	gp = vector<vector<pair<int, int>>>(n);
	ll sm = 0;
	bool f = 1;
	for (int i = 0; i < U.size(); ++i) {
		gp[U[i]].push_back({ V[i], W[i] });
		gp[V[i]].push_back({ U[i], W[i] });
		if (U[i]) f = 0;
		sm += W[i];
	}
	vector<ll> vec(n);
	if (f) {
		sort(W.rbegin(), W.rend());
		ll cur = 0;
		for (int i = 0; i < n; ++i) {
			//cout << sm - cur << " ";
			vec[i] = sm - cur;
			if(i < n - 1) cur += W[i];
		}
		return vec;
	}
	if (n > 2000) {
		int node = 0;
		for (int i = 0; i < n; ++i) if (gp[i].size() == 1) node = i;
		to_line(node, node);
		vector<ll> DP(n - 1);
		DP[0] = linear_w[0];
		if (n > 2) DP[1] = linear_w[1];
		if (n > 3) DP[2] = linear_w[0] + linear_w[2];
		for(int i = 3; i < n - 1; ++i){
			DP[i] = max(DP[i - 3] + linear_w[i], DP[i - 2] + linear_w[i]);
		}
		for (int i = 0; i < n - 1; ++i) DP[n - 2] = max(DP[n - 2], DP[i]);
		vec[0] = sm;
		vec[1] = sm - DP[n - 2];
		return vec;
	}
	vec[0] = sm;
	dp = vector<vector<ll>>(n, vector<ll>(n));
	for (int i = 1; i < n; ++i) {
		dfs(0, 0, i);
		vec[i] = sm - dp[0][i];
	}
	return vec;
}

Compilation message

roads.cpp: In function 'void dfs(int, int, int)':
roads.cpp:41:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for (int i = 1, j = 0; i <= k && j < vec.size(); ++i, ++j) {
      |                                   ~~^~~~~~~~~~~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:62:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |  for (int i = 0; i < U.size(); ++i) {
      |                  ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 33 ms 5860 KB Output is correct
13 Correct 50 ms 9660 KB Output is correct
14 Correct 50 ms 8860 KB Output is correct
15 Correct 55 ms 9716 KB Output is correct
16 Correct 55 ms 9896 KB Output is correct
17 Correct 52 ms 9896 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 45 ms 8784 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 52 ms 14068 KB Output is correct
3 Correct 50 ms 17760 KB Output is correct
4 Correct 52 ms 18996 KB Output is correct
5 Correct 55 ms 19020 KB Output is correct
6 Correct 223 ms 24276 KB Output is correct
7 Correct 320 ms 32156 KB Output is correct
8 Correct 250 ms 26176 KB Output is correct
9 Correct 3 ms 556 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 36 ms 11016 KB Output is correct
13 Correct 54 ms 18120 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 44 ms 16416 KB Output is correct
16 Correct 48 ms 18096 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 3 ms 612 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 3 ms 612 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 126 ms 12196 KB Output is correct
24 Correct 369 ms 31884 KB Output is correct
25 Correct 258 ms 23360 KB Output is correct
26 Correct 284 ms 31872 KB Output is correct
27 Correct 256 ms 31828 KB Output is correct
28 Correct 184 ms 31800 KB Output is correct
29 Correct 290 ms 26964 KB Output is correct
30 Correct 264 ms 31880 KB Output is correct
31 Correct 242 ms 31880 KB Output is correct
32 Correct 202 ms 31868 KB Output is correct
33 Correct 204 ms 24148 KB Output is correct
34 Correct 285 ms 32148 KB Output is correct
35 Correct 229 ms 26144 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 3 ms 596 KB Output is correct
46 Correct 3 ms 596 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 3 ms 596 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 209 ms 19224 KB Output is correct
54 Correct 371 ms 31896 KB Output is correct
55 Correct 234 ms 31896 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 3 ms 596 KB Output is correct
60 Correct 3 ms 596 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 352 ms 30940 KB Output is correct
65 Correct 366 ms 31876 KB Output is correct
66 Correct 206 ms 31876 KB Output is correct
67 Correct 176 ms 31828 KB Output is correct
68 Correct 222 ms 31880 KB Output is correct

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

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

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 33 ms 5860 KB Output is correct
13 Correct 50 ms 9660 KB Output is correct
14 Correct 50 ms 8860 KB Output is correct
15 Correct 55 ms 9716 KB Output is correct
16 Correct 55 ms 9896 KB Output is correct
17 Correct 52 ms 9896 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 45 ms 8784 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 52 ms 14068 KB Output is correct
22 Correct 50 ms 17760 KB Output is correct
23 Correct 52 ms 18996 KB Output is correct
24 Correct 55 ms 19020 KB Output is correct
25 Correct 223 ms 24276 KB Output is correct
26 Correct 320 ms 32156 KB Output is correct
27 Correct 250 ms 26176 KB Output is correct
28 Correct 3 ms 556 KB Output is correct
29 Correct 4 ms 596 KB Output is correct
30 Correct 3 ms 596 KB Output is correct
31 Correct 36 ms 11016 KB Output is correct
32 Correct 54 ms 18120 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 44 ms 16416 KB Output is correct
35 Correct 48 ms 18096 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 3 ms 468 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 4 ms 640 KB Output is correct
47 Correct 3 ms 612 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 3 ms 596 KB Output is correct
53 Correct 3 ms 596 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 126 ms 12196 KB Output is correct
59 Correct 369 ms 31884 KB Output is correct
60 Correct 258 ms 23360 KB Output is correct
61 Correct 284 ms 31872 KB Output is correct
62 Correct 256 ms 31828 KB Output is correct
63 Correct 184 ms 31800 KB Output is correct
64 Correct 290 ms 26964 KB Output is correct
65 Correct 264 ms 31880 KB Output is correct
66 Correct 242 ms 31880 KB Output is correct
67 Correct 202 ms 31868 KB Output is correct
68 Correct 204 ms 24148 KB Output is correct
69 Correct 285 ms 32148 KB Output is correct
70 Correct 229 ms 26144 KB Output is correct
71 Correct 1 ms 468 KB Output is correct
72 Correct 1 ms 468 KB Output is correct
73 Correct 2 ms 468 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 2 ms 468 KB Output is correct
77 Correct 3 ms 596 KB Output is correct
78 Correct 2 ms 596 KB Output is correct
79 Correct 3 ms 468 KB Output is correct
80 Correct 3 ms 596 KB Output is correct
81 Correct 3 ms 596 KB Output is correct
82 Correct 2 ms 468 KB Output is correct
83 Correct 2 ms 596 KB Output is correct
84 Correct 3 ms 596 KB Output is correct
85 Correct 0 ms 212 KB Output is correct
86 Correct 0 ms 212 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 209 ms 19224 KB Output is correct
89 Correct 371 ms 31896 KB Output is correct
90 Correct 234 ms 31896 KB Output is correct
91 Correct 1 ms 468 KB Output is correct
92 Correct 1 ms 468 KB Output is correct
93 Correct 1 ms 340 KB Output is correct
94 Correct 3 ms 596 KB Output is correct
95 Correct 3 ms 596 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 0 ms 212 KB Output is correct
98 Correct 0 ms 212 KB Output is correct
99 Correct 352 ms 30940 KB Output is correct
100 Correct 366 ms 31876 KB Output is correct
101 Correct 206 ms 31876 KB Output is correct
102 Correct 176 ms 31828 KB Output is correct
103 Correct 222 ms 31880 KB Output is correct
104 Incorrect 75 ms 10716 KB Output isn't correct
105 Halted 0 ms 0 KB -