Submission #677583

#	Time	Username	Problem	Language	Result	Execution time	Memory
677583		YENGOYAN	Road Closures (APIO21_roads)	C++17	Compilation error	0 ms	0 KiB

roads

#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 ll = long long;

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

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


vector<ll> minimum_closure_costs(int n, vector<int> U,vector<int> V,vector<int> W) {
	gp = vector<vector<pair<int, int>>>(n);
	dp = vector<vector<ll>>(n, vector<ll>(n));
	ll sm = 0;
	for (int i = 0; i < n - 1; ++i) {
		gp[U[i]].push_back({ V[i], W[i] });
		gp[V[i]].push_back({ U[i], W[i] });
		sm += W[i];
	}
	vector<ll> vec(n);
	vec[0] = sm;
	for (int i = 1; i < n; ++i) {
		dfs(0, -1, i);
		vec[i] = sm - dp[0][i];
	}
	return vec;
}

Compilation message (stderr)

roads.cpp:26:1: error: 'vector' does not name a type
   26 | vector<vector<pair<int, int>>> gp;
      | ^~~~~~
roads.cpp:27:1: error: 'vector' does not name a type
   27 | vector<vector<ll>> dp;
      | ^~~~~~
roads.cpp: In function 'void dfs(int, int, int)':
roads.cpp:30:2: error: 'vector' was not declared in this scope
   30 |  vector<ll> vec;
      |  ^~~~~~
roads.cpp:30:2: note: suggested alternatives:
In file included from /usr/include/c++/10/vector:67,
                 from roads.h:1,
                 from roads.cpp:1:
/usr/include/c++/10/bits/stl_vector.h:389:11: note:   'std::vector'
  389 |     class vector : protected _Vector_base<_Tp, _Alloc>
      |           ^~~~~~
In file included from roads.h:1,
                 from roads.cpp:1:
/usr/include/c++/10/vector:86:13: note:   'std::pmr::vector'
   86 |       using vector = std::vector<_Tp, polymorphic_allocator<_Tp>>;
      |             ^~~~~~
roads.cpp:30:11: error: expected primary-expression before '>' token
   30 |  vector<ll> vec;
      |           ^
roads.cpp:30:13: error: 'vec' was not declared in this scope
   30 |  vector<ll> vec;
      |             ^~~
roads.cpp:31:7: error: 'pair' was not declared in this scope; did you mean 'std::pair'?
   31 |  for (pair<int, int>& v : gp[u]) {
      |       ^~~~
      |       std::pair
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/vector:60,
                 from roads.h:1,
                 from roads.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'std::pair' declared here
  211 |     struct pair
      |            ^~~~
roads.cpp:31:12: error: expected primary-expression before 'int'
   31 |  for (pair<int, int>& v : gp[u]) {
      |            ^~~
roads.cpp:38:2: error: expected primary-expression before 'for'
   38 |  for (int i = 0; i < min(int(vec.size()), k); ++i) dp[u][k] += vec[i];
      |  ^~~
roads.cpp:36:3: error: expected ';' before 'for'
   36 |  }
      |   ^
      |   ;
   37 |  //dp[u][0] =
   38 |  for (int i = 0; i < min(int(vec.size()), k); ++i) dp[u][k] += vec[i];
      |  ~~~
roads.cpp:38:2: error: expected primary-expression before 'for'
   38 |  for (int i = 0; i < min(int(vec.size()), k); ++i) dp[u][k] += vec[i];
      |  ^~~
roads.cpp:36:3: error: expected ')' before 'for'
   36 |  }
      |   ^
      |   )
   37 |  //dp[u][0] =
   38 |  for (int i = 0; i < min(int(vec.size()), k); ++i) dp[u][k] += vec[i];
      |  ~~~
roads.cpp:31:6: note: to match this '('
   31 |  for (pair<int, int>& v : gp[u]) {
      |      ^
roads.cpp:38:22: error: 'min' was not declared in this scope; did you mean 'std::min'?
   38 |  for (int i = 0; i < min(int(vec.size()), k); ++i) dp[u][k] += vec[i];
      |                      ^~~
      |                      std::min
In file included from /usr/include/c++/10/algorithm:62,
                 from roads.cpp:11:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: 'std::min' declared here
 3474 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
roads.cpp:38:52: error: 'dp' was not declared in this scope; did you mean 'p'?
   38 |  for (int i = 0; i < min(int(vec.size()), k); ++i) dp[u][k] += vec[i];
      |                                                    ^~
      |                                                    p
roads.cpp: At global scope:
roads.cpp:42:1: error: 'vector' does not name a type
   42 | vector<ll> minimum_closure_costs(int n, vector<int> U,vector<int> V,vector<int> W) {
      | ^~~~~~