Submission #558780

#	Time	Username	Problem	Language	Result	Execution time	Memory
558780		hoanghq2004	Road Closures (APIO21_roads)	C++14	24 / 100	1680 ms	63724 KiB

roads

#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "roads.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 2010;

int n;
long long f[N][N][2];
vector <long long> tmp[N];
vector <pair <int, int> > g[N];

void dfs(int u, int p) {
    for (auto [v, w]: g[u])
        if (v != p) dfs(v, u);
    for (auto [v, w]: g[u]) {
        if (v == p) continue;
        for (int i = 0; i < n; ++i) {
            f[u][i][0] += f[v][i][0] + w;
            f[u][i][1] += f[v][i][0] + w;
        }
        for (int i = 1; i < n; ++i)
            tmp[i].push_back(- f[v][i][1] + f[v][i][0] + w);
    }
    for (int i = 1; i < n; ++i) {
        sort(tmp[i].begin(), tmp[i].end(), greater<>());
        for (int j = 0; j < i && j < tmp[i].size() && tmp[i][j] > 0; ++j)
            f[u][i][0] -= tmp[i][j];
        for (int j = 0; j < i - 1 && j < tmp[i].size() && tmp[i][j] > 0; ++j)
            f[u][i][1] -= tmp[i][j];
        tmp[i].clear();
    }
}

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
    n = N;
    for (int i = 0; i < N - 1; ++i) {
        int u = U[i], v = V[i], w = W[i];
        ++u, ++v;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    dfs(1, 0);
    vector <long long> ans;
    for (int i = 0; i < n; ++i) ans.push_back(f[1][i][0]);
    return ans;
}


//int main() {
////    freopen("test.inp", "r", stdin);
//  int N;
//  assert(1 == scanf("%d", &N));
//
//  std::vector<int> U(N - 1), V(N - 1), W(N - 1);
//  for (int i = 0; i < N - 1; ++i) {
//    assert(3 == scanf("%d %d %d", &U[i], &V[i], &W[i]));
//  }
//
//  std::vector<long long> closure_costs = minimum_closure_costs(N, U, V, W);
//  for (int i = 0; i < static_cast<int>(closure_costs.size()); ++i) {
//    if (i > 0) {
//      printf(" ");
//    }
//    printf("%lld",closure_costs[i]);
//  }
//  printf("\n");
//  return 0;
//}

Compilation message (stderr)

roads.cpp: In function 'void dfs(int, int)':
roads.cpp:22:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   22 |     for (auto [v, w]: g[u])
      |               ^
roads.cpp:24:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |     for (auto [v, w]: g[u]) {
      |               ^
roads.cpp:35:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for (int j = 0; j < i && j < tmp[i].size() && tmp[i][j] > 0; ++j)
      |                                  ~~^~~~~~~~~~~~~~~
roads.cpp:37:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for (int j = 0; j < i - 1 && j < tmp[i].size() && tmp[i][j] > 0; ++j)
      |                                      ~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22