oj.uz

Submission #427151

# Submission time Handle Problem Language Result Execution time Memory
427151 2021-06-14T12:53:25 Z Hideo Designated Cities (JOI19_designated_cities) C++17
56 / 100
 2000 ms 100484 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define all(s) s.begin(), s.end()
#define int long long
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define pi pair < int, int >

const int N = 2e5 + 7;
const int INF = 1e9 + 7;

pi t[2 * N];
int lz[N];
int p[N][20], h[2][N], w[N];
int tin[N], tout[N], tim;
int ans[N];
int n, q, rt, sum, s_up;

vector < pair < int, pi > > g[N];

pi lr[N], lg[2][N];
int rv[N], del[N], cnt = -1;
vector < int > a;

int lc, x, y;

void dfs (int v, int pr = 0){
    lg[0][v] = lg[1][v] = {0, v};
    lr[v] = {INF, -INF};
    tin[v] = ++tim;
    p[v][0] = pr;
    for (int j = 1; j < 20; j++)
        p[v][j] = p[p[v][j - 1]][j - 1];
    for (auto to : g[v]){
        if (to.fr != pr){
            s_up += to.sc.sc;
            h[0][to.fr] = h[0][v] + to.sc.fr;
            h[1][to.fr] = h[1][v] + to.sc.sc;
            dfs(to.fr, v);
            lr[v].fr = min(lr[v].fr, lr[to.fr].fr);
            lr[v].sc = max(lr[v].sc, lr[to.fr].sc);
            if (lg[0][v].fr < lg[0][to.fr].fr + to.sc.fr){
                swap(lg[0][v], lg[1][v]);
                lg[0][v] = {lg[0][to.fr].fr + to.sc.fr, lg[0][to.fr].sc};
            }
            else if (lg[1][v].fr < lg[0][to.fr].fr + to.sc.fr)
                lg[1][v] = {lg[0][to.fr].fr + to.sc.fr, lg[0][to.fr].sc};
        }
    }
    tout[v] = tim;
    if (g[v].size() == 1){
        rv[v] = ++cnt;
        lr[v] = {rv[v], rv[v]};
        a.pb(v);
    }
}

inline bool check (int v, int u){
    return tin[v] <= tin[u] && tout[u] <= tout[v];
}

int lca (int v, int u){
    if (check(v, u))
        return v;
    if (check(u, v))
        return u;
    for (int j = 19; j >= 0; j--)
        if (p[v][j] && !check(p[v][j], u))
            v = p[v][j];
    return p[v][0];
}

inline int dis (int vv, int uu){
    int pp = lca(vv, uu);
    return h[1][vv] - h[1][pp] + h[0][uu] - h[0][pp];
}

int hg;

inline void apply(int p, int value) {
  t[p].fr += value;
  if (p < cnt) lz[p] += value;
}

void build(int p) {
  while (p > 1) {
    p >>= 1;
    if (t[p<<1].fr > t[p<<1|1].fr)
        t[p] = t[p<<1];
    else
        t[p] = t[p<<1|1];
    t[p].fr += lz[p];
  }
}

void push(int p) {
  for (int s = hg; s > 0; --s) {
    int i = p >> s;
    if (lz[i] != 0) {

      t[i<<1].fr += lz[i];
      if ((i << 1) < cnt)
        lz[i<<1] += lz[i];

      t[i<<1|1].fr += lz[i];
      if ((i<<1|1) < cnt)
        lz[i<<1|1] += lz[i];
      lz[i] = 0;
    }
  }
}

void upd(int l, int r, int value) {
  l += cnt, r += cnt;
  int l0 = l, r0 = r;
  for (; l < r; l >>= 1, r >>= 1) {
    if (l&1){
        t[l].fr += value;
        if (l < cnt)
            lz[l] += value;
        l++;
    }
    if (r&1){
        t[--r].fr += value;
        if (r < cnt)
            lz[r] += value;
    }
  }
  build(l0);
  build(r0 - 1);
}

pi query(int l, int r) {
  l += cnt, r += cnt;
  push(l);
  push(r - 1);
  pi res = {0, 0};
  for (; l < r; l >>= 1, r >>= 1){
    if (l&1 && res.fr < t[l++].fr){
        res = t[l - 1];
    }
    if (r&1 && res.fr < t[--r].fr){
        res = t[r];
    }
  }
  return res;
}

void prec (int v, int pr = 0){
    for (auto to : g[v]){
        if (to.fr != pr){
            prec(to.fr, v);
            if (check(to.fr, lc))
                w[to.fr] = to.sc.sc;
            else
                w[to.fr] = to.sc.fr;
        }
    }
}

int negr, negr2;

vector < pi > prs;

void reroot (int v, int pr = 0, pi up = {0, 0}){
    if (up.fr > lg[0][v].fr){
        prs.pb({v, up.sc});
        lg[0][v] = up;
    }
    else
        prs.pb({v, lg[0][v].sc});
    for (auto to : g[v]){
        if (to.fr != pr){
            if (lg[0][v].sc == lg[0][to.fr].sc){
                reroot(to.fr, v, {lg[1][v].fr + to.sc.sc, lg[1][v].sc});
            }
            else {
                reroot(to.fr, v, {lg[0][v].fr + to.sc.sc, lg[0][v].sc});
            }
        }
    }
}

main (){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i < n; i++){
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        negr = c;
        negr2 = d;
        g[a].pb({b, {c, d}});
        g[b].pb({a, {d, c}});
        sum += c + d;
    }
    if (n == 2){
        ans[1] = max(negr, negr2);
        ans[2] = sum;
        int q;
        cin >> q;
        for (int i = 1; i <= q; i++){
            int e;
            cin >> e;
            cout << sum - ans[e] << endl;
        }
        return 0;
    }
    for (int i = 1; i <= n; i++){
        if (g[i].size() > 1){
            rt = i;
            break;
        }
    }
    dfs(rt);
    for (int i = 1; i <= n; i++){
        ans[1] = max(ans[1], s_up - h[1][i] + h[0][i]);
    }
    reroot(rt);
    int mx = 0;
    for (pi it : prs){
        int v = it.fr, u = it.sc;
        int l = lca(v, u);
        if (mx < s_up - h[1][l] + h[0][l] + h[0][v] + h[0][u] - 2 * h[0][l]){
            mx = s_up - h[1][l] + h[0][l] + h[0][v] + h[0][u] - 2 * h[0][l];
            x = v, y = u;
        }
    }
    ans[2] = mx;
    lc = lca(x, y);
    cnt++;
    hg = sizeof(int) * 8 - __builtin_clz(cnt);
    prec(rt);
    for (int i = 0; i < cnt; i++){
        t[cnt + i].sc = i;
    }
    for (int i = 0; i < cnt; i++){
        upd(i, i + 1, dis(lc, a[i]));
    }
    del[0] = 1;
    del[lc] = 1;
    while (x != lc){
        del[x] = 1;
        upd(lr[x].fr, lr[x].sc + 1, -w[x]);
        w[x] = 0;
        x = p[x][0];
    }
    while (y != lc){
        del[y] = 1;
        upd(lr[y].fr, lr[y].sc + 1, -w[y]);
        w[y] = 0;
        y = p[y][0];
    }
    cin >> q;
    int NEGA = cnt;
    if (q == 1){
        cin >> NEGA;
        if (NEGA > cnt){
            cout << 0;
            return 0;
        }
    }
    for (int i = 3; i <= min(NEGA, cnt); i++){
        pi temp = t[1];
        int it = temp.sc, val = temp.fr;
        ans[i] = ans[i - 1] + val;
//        cout << a[it] << ' ' << val << endl;
        if (lr[lc].fr <= it && it <= lr[lc].sc){
            int v = a[it];
            while (!del[v]){
                del[v] = 1;
                upd(lr[v].fr, lr[v].sc + 1, -w[v]);
//                cout << v << ' ' << lr[v].fr << ' ' << lr[v].sc << ' ' << w[v] << endl;
                w[v] = 0;
                v = p[v][0];
            }
        }
        else {
            int nw = lca(lc, a[it]);
            int v = lc;
            while (v != nw){
                if (lr[v].fr > 0){
                    upd(0, lr[v].fr, -w[v]);
//                    cout << v << ' ' << 1 << ' ' << lr[v].fr << ' ' << w[v] << endl;
                }
                if (lr[v].sc < cnt - 1){
                    upd(lr[v].sc + 1, cnt, -w[v]);
//                    cout << v << ' ' << lr[v].sc + 2 << ' ' << cnt << ' ' << w[v] << endl;
                }
                w[v] = 0;
                v = p[v][0];
                del[v] = 1;
            }
            v = a[it];
            while (!del[v]){
                del[v] = 1;
                upd(lr[v].fr, lr[v].sc + 1, -w[v]);
//                cout << v << ' ' << lr[v].fr + 1 << ' ' << lr[v].sc + 1 << ' ' << w[v] << endl;
                w[v] = 0;
                v = p[v][0];
            }
        }
    }
    for (int i = cnt + 1; i <= n; i++)
        ans[i] = sum;
    if (q == 1){
        cout << sum - ans[NEGA];
        return 0;
    }
    for (int i = 1; i <= q; i++){
        int e;
        cin >> e;
        cout << sum - ans[e] << endl;
    }
}

Compilation message

designated_cities.cpp:190:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  190 | main (){
      | ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4988 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 4 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 5 ms 5068 KB Output is correct
6 Correct 4 ms 5024 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 4 ms 5088 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 5 ms 5068 KB Output is correct
11 Correct 5 ms 5028 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 585 ms 83468 KB Output is correct
3 Correct 735 ms 97208 KB Output is correct
4 Correct 601 ms 80624 KB Output is correct
5 Correct 557 ms 83228 KB Output is correct
6 Correct 673 ms 86788 KB Output is correct
7 Correct 484 ms 84212 KB Output is correct
8 Correct 807 ms 99880 KB Output is correct
9 Correct 441 ms 87644 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 558 ms 83336 KB Output is correct
3 Correct 785 ms 100264 KB Output is correct
4 Correct 544 ms 80680 KB Output is correct
5 Correct 563 ms 83148 KB Output is correct
6 Correct 676 ms 87184 KB Output is correct
7 Correct 465 ms 87012 KB Output is correct
8 Correct 811 ms 94804 KB Output is correct
9 Correct 461 ms 87160 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4988 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 4 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 5 ms 5068 KB Output is correct
6 Correct 4 ms 5024 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 4 ms 5088 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 5 ms 5068 KB Output is correct
11 Correct 5 ms 5028 KB Output is correct
12 Correct 4 ms 5020 KB Output is correct
13 Correct 13 ms 5884 KB Output is correct
14 Correct 12 ms 5964 KB Output is correct
15 Correct 12 ms 5856 KB Output is correct
16 Correct 12 ms 5948 KB Output is correct
17 Correct 12 ms 5928 KB Output is correct
18 Correct 13 ms 5836 KB Output is correct
19 Correct 14 ms 5840 KB Output is correct
20 Correct 12 ms 5964 KB Output is correct
21 Correct 11 ms 5936 KB Output is correct
22 Correct 12 ms 5872 KB Output is correct
23 Correct 12 ms 5836 KB Output is correct
24 Correct 11 ms 5964 KB Output is correct
25 Correct 12 ms 6100 KB Output is correct
26 Correct 10 ms 5928 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 585 ms 83468 KB Output is correct
3 Correct 735 ms 97208 KB Output is correct
4 Correct 601 ms 80624 KB Output is correct
5 Correct 557 ms 83228 KB Output is correct
6 Correct 673 ms 86788 KB Output is correct
7 Correct 484 ms 84212 KB Output is correct
8 Correct 807 ms 99880 KB Output is correct
9 Correct 441 ms 87644 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 558 ms 83336 KB Output is correct
12 Correct 785 ms 100264 KB Output is correct
13 Correct 544 ms 80680 KB Output is correct
14 Correct 563 ms 83148 KB Output is correct
15 Correct 676 ms 87184 KB Output is correct
16 Correct 465 ms 87012 KB Output is correct
17 Correct 811 ms 94804 KB Output is correct
18 Correct 461 ms 87160 KB Output is correct
19 Correct 5 ms 5024 KB Output is correct
20 Correct 730 ms 84600 KB Output is correct
21 Correct 758 ms 100484 KB Output is correct
22 Correct 735 ms 83360 KB Output is correct
23 Correct 655 ms 84368 KB Output is correct
24 Correct 635 ms 81720 KB Output is correct
25 Correct 583 ms 84312 KB Output is correct
26 Correct 559 ms 82288 KB Output is correct
27 Correct 630 ms 84460 KB Output is correct
28 Correct 777 ms 86920 KB Output is correct
29 Correct 596 ms 83872 KB Output is correct
30 Correct 531 ms 84000 KB Output is correct
31 Correct 521 ms 87104 KB Output is correct
32 Correct 779 ms 95704 KB Output is correct
33 Correct 447 ms 89456 KB Output is correct

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4988 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 4 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 5 ms 5068 KB Output is correct
6 Correct 4 ms 5024 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 4 ms 5088 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 5 ms 5068 KB Output is correct
11 Correct 5 ms 5028 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 585 ms 83468 KB Output is correct
14 Correct 735 ms 97208 KB Output is correct
15 Correct 601 ms 80624 KB Output is correct
16 Correct 557 ms 83228 KB Output is correct
17 Correct 673 ms 86788 KB Output is correct
18 Correct 484 ms 84212 KB Output is correct
19 Correct 807 ms 99880 KB Output is correct
20 Correct 441 ms 87644 KB Output is correct
21 Correct 4 ms 4940 KB Output is correct
22 Correct 558 ms 83336 KB Output is correct
23 Correct 785 ms 100264 KB Output is correct
24 Correct 544 ms 80680 KB Output is correct
25 Correct 563 ms 83148 KB Output is correct
26 Correct 676 ms 87184 KB Output is correct
27 Correct 465 ms 87012 KB Output is correct
28 Correct 811 ms 94804 KB Output is correct
29 Correct 461 ms 87160 KB Output is correct
30 Correct 4 ms 5020 KB Output is correct
31 Correct 13 ms 5884 KB Output is correct
32 Correct 12 ms 5964 KB Output is correct
33 Correct 12 ms 5856 KB Output is correct
34 Correct 12 ms 5948 KB Output is correct
35 Correct 12 ms 5928 KB Output is correct
36 Correct 13 ms 5836 KB Output is correct
37 Correct 14 ms 5840 KB Output is correct
38 Correct 12 ms 5964 KB Output is correct
39 Correct 11 ms 5936 KB Output is correct
40 Correct 12 ms 5872 KB Output is correct
41 Correct 12 ms 5836 KB Output is correct
42 Correct 11 ms 5964 KB Output is correct
43 Correct 12 ms 6100 KB Output is correct
44 Correct 10 ms 5928 KB Output is correct
45 Correct 5 ms 5024 KB Output is correct
46 Correct 730 ms 84600 KB Output is correct
47 Correct 758 ms 100484 KB Output is correct
48 Correct 735 ms 83360 KB Output is correct
49 Correct 655 ms 84368 KB Output is correct
50 Correct 635 ms 81720 KB Output is correct
51 Correct 583 ms 84312 KB Output is correct
52 Correct 559 ms 82288 KB Output is correct
53 Correct 630 ms 84460 KB Output is correct
54 Correct 777 ms 86920 KB Output is correct
55 Correct 596 ms 83872 KB Output is correct
56 Correct 531 ms 84000 KB Output is correct
57 Correct 521 ms 87104 KB Output is correct
58 Correct 779 ms 95704 KB Output is correct
59 Correct 447 ms 89456 KB Output is correct
60 Correct 4 ms 4940 KB Output is correct
61 Correct 1065 ms 87484 KB Output is correct
62 Correct 1057 ms 99032 KB Output is correct
63 Correct 1061 ms 86376 KB Output is correct
64 Correct 1054 ms 87732 KB Output is correct
65 Execution timed out 2044 ms 82852 KB Time limit exceeded
66 Halted 0 ms 0 KB -