oj.uz

답안 #427345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427345 2021-06-14T14:26:05 Z Hideo Designated Cities (JOI19_designated_cities) C++17
56 / 100
 2000 ms 100620 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, 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;

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});
            }
        }
    }
}

int e[N];

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];
    }
    int q, mxq = 0;
    cin >> q;
    for (int i = 1; i <= q; i++){
        cin >> e[i];
        mxq = max(mxq, e[i]);
    }
    for (int i = 3; i <= min(mxq, cnt - 1); 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; i <= n; i++)
        ans[i] = sum;
    for (int i = 1; i <= q; i++)
        cout << sum - ans[e[i]] << endl;
}

Compilation message

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 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 4 ms 5068 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 539 ms 76932 KB Output is correct
3 Correct 668 ms 90940 KB Output is correct
4 Correct 565 ms 75688 KB Output is correct
5 Correct 471 ms 76840 KB Output is correct
6 Correct 581 ms 80444 KB Output is correct
7 Correct 497 ms 77784 KB Output is correct
8 Correct 711 ms 93512 KB Output is correct
9 Correct 359 ms 81176 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 544 ms 76996 KB Output is correct
3 Correct 691 ms 93852 KB Output is correct
4 Correct 521 ms 75628 KB Output is correct
5 Correct 511 ms 76856 KB Output is correct
6 Correct 594 ms 80828 KB Output is correct
7 Correct 433 ms 80728 KB Output is correct
8 Correct 685 ms 88444 KB Output is correct
9 Correct 369 ms 81092 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 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 4 ms 5068 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 12 ms 5920 KB Output is correct
14 Correct 11 ms 5964 KB Output is correct
15 Correct 11 ms 5836 KB Output is correct
16 Correct 10 ms 5836 KB Output is correct
17 Correct 15 ms 5860 KB Output is correct
18 Correct 10 ms 5836 KB Output is correct
19 Correct 12 ms 5904 KB Output is correct
20 Correct 10 ms 5836 KB Output is correct
21 Correct 10 ms 5932 KB Output is correct
22 Correct 10 ms 5816 KB Output is correct
23 Correct 10 ms 5940 KB Output is correct
24 Correct 9 ms 5836 KB Output is correct
25 Correct 10 ms 5964 KB Output is correct
26 Correct 10 ms 5836 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 539 ms 76932 KB Output is correct
3 Correct 668 ms 90940 KB Output is correct
4 Correct 565 ms 75688 KB Output is correct
5 Correct 471 ms 76840 KB Output is correct
6 Correct 581 ms 80444 KB Output is correct
7 Correct 497 ms 77784 KB Output is correct
8 Correct 711 ms 93512 KB Output is correct
9 Correct 359 ms 81176 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 544 ms 76996 KB Output is correct
12 Correct 691 ms 93852 KB Output is correct
13 Correct 521 ms 75628 KB Output is correct
14 Correct 511 ms 76856 KB Output is correct
15 Correct 594 ms 80828 KB Output is correct
16 Correct 433 ms 80728 KB Output is correct
17 Correct 685 ms 88444 KB Output is correct
18 Correct 369 ms 81092 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 613 ms 78188 KB Output is correct
21 Correct 639 ms 94112 KB Output is correct
22 Correct 631 ms 78416 KB Output is correct
23 Correct 513 ms 78036 KB Output is correct
24 Correct 504 ms 76576 KB Output is correct
25 Correct 495 ms 77872 KB Output is correct
26 Correct 520 ms 77120 KB Output is correct
27 Correct 534 ms 78276 KB Output is correct
28 Correct 645 ms 80564 KB Output is correct
29 Correct 557 ms 77384 KB Output is correct
30 Correct 543 ms 78464 KB Output is correct
31 Correct 511 ms 80768 KB Output is correct
32 Correct 691 ms 89292 KB Output is correct
33 Correct 423 ms 83032 KB Output is correct

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 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 4 ms 5068 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 539 ms 76932 KB Output is correct
14 Correct 668 ms 90940 KB Output is correct
15 Correct 565 ms 75688 KB Output is correct
16 Correct 471 ms 76840 KB Output is correct
17 Correct 581 ms 80444 KB Output is correct
18 Correct 497 ms 77784 KB Output is correct
19 Correct 711 ms 93512 KB Output is correct
20 Correct 359 ms 81176 KB Output is correct
21 Correct 4 ms 4940 KB Output is correct
22 Correct 544 ms 76996 KB Output is correct
23 Correct 691 ms 93852 KB Output is correct
24 Correct 521 ms 75628 KB Output is correct
25 Correct 511 ms 76856 KB Output is correct
26 Correct 594 ms 80828 KB Output is correct
27 Correct 433 ms 80728 KB Output is correct
28 Correct 685 ms 88444 KB Output is correct
29 Correct 369 ms 81092 KB Output is correct
30 Correct 4 ms 4940 KB Output is correct
31 Correct 12 ms 5920 KB Output is correct
32 Correct 11 ms 5964 KB Output is correct
33 Correct 11 ms 5836 KB Output is correct
34 Correct 10 ms 5836 KB Output is correct
35 Correct 15 ms 5860 KB Output is correct
36 Correct 10 ms 5836 KB Output is correct
37 Correct 12 ms 5904 KB Output is correct
38 Correct 10 ms 5836 KB Output is correct
39 Correct 10 ms 5932 KB Output is correct
40 Correct 10 ms 5816 KB Output is correct
41 Correct 10 ms 5940 KB Output is correct
42 Correct 9 ms 5836 KB Output is correct
43 Correct 10 ms 5964 KB Output is correct
44 Correct 10 ms 5836 KB Output is correct
45 Correct 4 ms 4940 KB Output is correct
46 Correct 613 ms 78188 KB Output is correct
47 Correct 639 ms 94112 KB Output is correct
48 Correct 631 ms 78416 KB Output is correct
49 Correct 513 ms 78036 KB Output is correct
50 Correct 504 ms 76576 KB Output is correct
51 Correct 495 ms 77872 KB Output is correct
52 Correct 520 ms 77120 KB Output is correct
53 Correct 534 ms 78276 KB Output is correct
54 Correct 645 ms 80564 KB Output is correct
55 Correct 557 ms 77384 KB Output is correct
56 Correct 543 ms 78464 KB Output is correct
57 Correct 511 ms 80768 KB Output is correct
58 Correct 691 ms 89292 KB Output is correct
59 Correct 423 ms 83032 KB Output is correct
60 Correct 4 ms 4940 KB Output is correct
61 Correct 1032 ms 89016 KB Output is correct
62 Correct 940 ms 100620 KB Output is correct
63 Correct 963 ms 87692 KB Output is correct
64 Correct 999 ms 89388 KB Output is correct
65 Execution timed out 2093 ms 85584 KB Time limit exceeded
66 Halted 0 ms 0 KB -