oj.uz

Submission #566719

# Submission time Handle Problem Language Result Execution time Memory
566719 2022-05-22T18:08:33 Z Ooops_sorry Road Closures (APIO21_roads) C++14
0 / 100
 2000 ms 19556 KB 
#include<bits/stdc++.h>
#ifndef LOCAL
    #include "roads.h"
#endif

#define ld long double
#define ll long long
#define pb push_back

using namespace std;

const int N = 1e5 + 10;
const ll INF = 1e18;
vector<pair<int,int>> g[N];
ll e[N], dp[N][2];
int k, n;

void dfs(int v, int p) {
    vector<int> arr;
    ll sum = 0;
    for (auto to : g[v]) {
        if (to.first != p) {
            e[to.first] = to.second;
            dfs(to.first, v);
            arr.pb(to.first);
            sum += dp[to.first][0];
        }
    }
    sort(arr.begin(), arr.end(), [&](int u, int v){return dp[u][1] + e[u] - dp[u][0] > dp[v][1] + e[v] - dp[v][0];});
    if (arr.size() < k) {
        for (auto to : arr) {
            sum += dp[to][1] + e[to] - dp[to][0];
        }
        dp[v][0] = dp[v][1] = sum;
    } else {
        if (k == 0) {
            dp[v][0] = sum;
        } else {
            for (int i = 1; i <= k; i++) {
                int to = arr[i - 1];
                sum += dp[to][1] + e[to] - dp[to][0];
                if (i < k) {
                    dp[v][1] = max(dp[v][1], sum);
                } else {
                    dp[v][0] = sum;
                }
            }
            dp[v][0] = max(dp[v][1], dp[v][0]);
        }
    }
}

vector<long long> minimum_closure_costs(int N, vector<int> u, vector<int> v, vector<int> w) {
    n = N;
    ll sum = 0;
    for (int i = 0; i < n - 1; i++) {
        g[u[i]].pb({v[i], w[i]});
        g[v[i]].pb({u[i], w[i]});
        sum += w[i];
    }
    vector<ll> ans;
    for (k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            dp[i][0] = dp[i][1] = -INF;
        }
        dfs(0, -1);
        ans.pb(sum - dp[0][0]);
    }
    return ans;
}

#ifdef LOCAL

int main() {
  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

roads.cpp: In function 'void dfs(int, int)':
roads.cpp:30:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |     if (arr.size() < k) {
      |         ~~~~~~~~~~~^~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 226 ms 2832 KB Output is correct
3 Correct 260 ms 2844 KB Output is correct
4 Correct 114 ms 2848 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 4 ms 2644 KB Output is correct
7 Correct 3 ms 2644 KB Output is correct
8 Correct 108 ms 2772 KB Output is correct
9 Correct 165 ms 2844 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Execution timed out 2089 ms 8452 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Execution timed out 2073 ms 19556 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Incorrect 3 ms 2644 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Incorrect 3 ms 2644 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2087 ms 10824 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2087 ms 10824 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 226 ms 2832 KB Output is correct
3 Correct 260 ms 2844 KB Output is correct
4 Correct 114 ms 2848 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 4 ms 2644 KB Output is correct
7 Correct 3 ms 2644 KB Output is correct
8 Correct 108 ms 2772 KB Output is correct
9 Correct 165 ms 2844 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 3 ms 2644 KB Output is correct
12 Execution timed out 2089 ms 8452 KB Time limit exceeded
13 Halted 0 ms 0 KB -