oj.uz

Submission #559175

# Submission time Handle Problem Language Result Execution time Memory
559175 2022-05-09T13:05:33 Z acm Road Closures (APIO21_roads) C++14
7 / 100
 2000 ms 25596 KB 
#include <bits/stdc++.h>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define REP(i, l, r) for (int i = (l); i < (r); ++i)
#define FORD(i, r, l) for (int i = (r); i >= (l); --i)
#define REPD(i, r, l) for (int i = (r)-1; i >= (l); --i)
#define pb(x) push_back(x)
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 1e5 + 5, Ns4 = 200005;
int n;
long long ans[N];
long long dpx[N], val[N];
int sz[Ns4];
long long dd[Ns4][2];
vector<pii> S[N];

void DFS(int u, int p, int max_sz) {
  int now_sz = min(sz[u], max_sz), w = 0;
  vector<int> Q;
  long long sum = 0, pre_sum = 0;
  for (auto [c, v] : S[u])
    if (v != p) {
      DFS(v, u, max_sz);
      long long xx = dd[v][1] + c;
      long long yy = dd[v][0];
      sum += xx;
      if (yy - xx < 0)
        Q.push_back(yy - xx);
      else
        w++;
    }
  for (int i = 0; i <= min(w, 1); i++) Q.pb(0);
  now_sz = min(now_sz, (int)Q.size());
  pre_sum = 1e15;
  if (now_sz && Q.size() > 2000) {
    nth_element(Q.begin(), Q.begin() + now_sz - 1, Q.end());
    int alta = Q[now_sz - 1];
    int x = now_sz;
    for (auto X : Q) {
      if (X < alta) {
        x--;
        pre_sum = sum;
        sum += min(0, X);
      }
    }
    for (auto X : Q) {
      if (X == alta && x) {
        x--;
        pre_sum = sum;
        sum += min(0, X);
      }
    }
    Q.clear();
  } else {
    sort(Q.begin(), Q.end());

    pre_sum = 1e15;
    REP(i, 0, now_sz) {
      pre_sum = sum;
      sum += min(0, Q[i]);
    }
    Q.clear();
  }
  if (now_sz < max_sz) pre_sum = sum;
  dd[u][0] = pre_sum;
  dd[u][1] = sum;
}
ll calc(int i) {
  DFS(0, 0, i);
  return ans[i] = dd[0][1];
}
void dnc(int l = 1, int r = n - 2, ll L = ans[n - 1], ll R = ans[0]) {
  if (l > r) return;
  if (L == R) {
    for (int i = l; i <= r; i++) ans[i] = L;
    return;
  }
  int tm = (l + r) / 2;
  calc(tm);
  dnc(l, tm - 1, ans[tm], R);
  dnc(tm + 1, r, L, ans[tm]);
}
void sub34() {
  REP(i, 0, n) {
    sz[i] = S[i].size() - 1;
    if (i == 0) ++sz[i];
  }
  int x = 0;
  for (int i = 0; i < __lg(n) + 1; i++) {
    dnc(x, min(x + (1 << i), n - 1), calc(min(x + (1 << i), n - 1)), calc(x));
    if (min(x + (1 << i), n - 1) == n - 1) break;
  }
}

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V,
                                        vector<int> W) {
  n = N;
  REP(i, 0, n - 1) {
    S[U[i]].emplace_back(W[i], V[i]);
    S[V[i]].emplace_back(W[i], U[i]);
  }
  sub34();
  vector<long long> ret(n);
  REP(i, 0, n) ret[i] = ans[i];
  return ret;
}

Compilation message

roads.cpp: In function 'void DFS(int, int, int)':
roads.cpp:22:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   22 |   for (auto [c, v] : S[u])
      |             ^

Subtask #1
0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1385 ms 21732 KB Output is correct
3 Correct 1524 ms 24024 KB Output is correct
4 Correct 1659 ms 25476 KB Output is correct
5 Correct 1686 ms 25596 KB Output is correct
6 Correct 11 ms 3028 KB Output is correct
7 Correct 15 ms 3100 KB Output is correct
8 Correct 12 ms 3060 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 2 ms 2632 KB Output is correct
12 Correct 842 ms 16216 KB Output is correct
13 Correct 1664 ms 25540 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1468 ms 23272 KB Output is correct
16 Correct 1670 ms 25468 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 3 ms 2644 KB Output is correct
5 Correct 3 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 3 ms 2644 KB Output is correct
8 Correct 3 ms 2696 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Incorrect 4 ms 2772 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 3 ms 2644 KB Output is correct
5 Correct 3 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 3 ms 2644 KB Output is correct
8 Correct 3 ms 2696 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Incorrect 4 ms 2772 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2069 ms 10476 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 2069 ms 10476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

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