Submission #727623

#	Time	Username	Problem	Language	Result	Execution time	Memory
727623		marvinthang	Road Closures (APIO21_roads)	C++17	0 / 100	2078 ms	23332 KiB

roads

/*************************************
*    author: marvinthang             *
*    created: 21.04.2023 10:12:13    *
*************************************/

#include "roads.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const int MAX = 1e5 + 5;
const long long INF = 1e18;

int N, K, visited[MAX];
long long dp[MAX][2];
vector <pair <int, int>> adj[MAX];
bool used[MAX];

void dfs(int u) {
    dp[u][0] = dp[u][1] = 0;
    visited[u] = K;
    vector <long long> change;
    for (auto [w, v]: adj[u]) if (visited[v] != K) {
        if (used[v]) change.push_back(w);
        else {
            dfs(v);
            dp[u][0] += dp[v][0];
            change.push_back(dp[v][1] + w - dp[v][0]);
        }
    }
    sort(ALL(change));
    int f = (int) adj[u].size() - K;
    if (!K) {
        for (long long x: change) dp[u][0] += x;
        dp[u][1] = dp[u][0];
    } else {
        REP(i, f) dp[u][0] += change[i];
        dp[u][1] = dp[u][0] - change[f - 1];
    }
    // 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;
    REP(i, N - 1) {
        adj[U[i]].emplace_back(W[i], V[i]);
        adj[V[i]].emplace_back(W[i], U[i]);
    }
    vector <int> pos(N);
    iota(ALL(pos), 0);
    sort(ALL(pos), [&] (int a, int b) { return adj[a].size() < adj[b].size(); });
    vector <long long> res(N);
    int ptr = 0;
    memset(visited, -1, N * sizeof(int));
    REP(k, N) {
        K = k;
        while (ptr < N && adj[pos[ptr]].size() <= K) used[pos[ptr++]] = true;
        FOR(i, ptr, N) {
            int u = pos[i];
            if (visited[u] == K) continue;
            dfs(u);
            res[K] += dp[u][0];
        }
    }
    return res;
}

#ifdef LOCAL
#include "roads.h"

#include <cassert>
#include <cstdio>

#include <vector>

int main() {
    file("roads");
  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;
}
#endif

Compilation message (stderr)

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:92:48: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   92 |         while (ptr < N && adj[pos[ptr]].size() <= K) used[pos[ptr++]] = true;
      |                           ~~~~~~~~~~~~~~~~~~~~~^~~~

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