oj.uz

답안 #427044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427044 2021-06-14T11:59:35 Z Hideo Designated Cities (JOI19_designated_cities) C++17
39 / 100
 2000 ms 94120 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 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) {
      apply(i<<1, lz[i]);
      apply(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) apply(l++, value);
    if (r&1) apply(--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];
    }
    for (int i = 3; i <= cnt; i++){
        pi temp = query(0, cnt);
        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;
    int q;
    cin >> q;
    for (int i = 1; i <= q; i++){
        int e;
        cin >> e;
        cout << sum - ans[e] << endl;
    }
}

Compilation message

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 3 ms 5052 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 3 ms 4996 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 720 ms 78476 KB Output is correct
3 Correct 607 ms 90916 KB Output is correct
4 Correct 682 ms 78520 KB Output is correct
5 Correct 747 ms 79744 KB Output is correct
6 Correct 845 ms 81048 KB Output is correct
7 Correct 588 ms 81016 KB Output is correct
8 Correct 760 ms 93632 KB Output is correct
9 Correct 610 ms 84212 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 775 ms 78424 KB Output is correct
3 Correct 632 ms 93864 KB Output is correct
4 Correct 653 ms 78384 KB Output is correct
5 Correct 620 ms 79596 KB Output is correct
6 Correct 815 ms 81468 KB Output is correct
7 Correct 658 ms 84348 KB Output is correct
8 Correct 799 ms 88896 KB Output is correct
9 Correct 697 ms 84196 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 3 ms 5052 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 3 ms 4996 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 10 ms 5836 KB Output is correct
14 Correct 9 ms 5964 KB Output is correct
15 Correct 10 ms 5836 KB Output is correct
16 Correct 13 ms 5776 KB Output is correct
17 Correct 14 ms 5836 KB Output is correct
18 Correct 12 ms 5888 KB Output is correct
19 Correct 13 ms 5836 KB Output is correct
20 Correct 9 ms 5768 KB Output is correct
21 Correct 9 ms 5836 KB Output is correct
22 Correct 11 ms 5836 KB Output is correct
23 Correct 10 ms 5896 KB Output is correct
24 Correct 9 ms 5836 KB Output is correct
25 Correct 9 ms 6012 KB Output is correct
26 Correct 10 ms 5836 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 720 ms 78476 KB Output is correct
3 Correct 607 ms 90916 KB Output is correct
4 Correct 682 ms 78520 KB Output is correct
5 Correct 747 ms 79744 KB Output is correct
6 Correct 845 ms 81048 KB Output is correct
7 Correct 588 ms 81016 KB Output is correct
8 Correct 760 ms 93632 KB Output is correct
9 Correct 610 ms 84212 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 775 ms 78424 KB Output is correct
12 Correct 632 ms 93864 KB Output is correct
13 Correct 653 ms 78384 KB Output is correct
14 Correct 620 ms 79596 KB Output is correct
15 Correct 815 ms 81468 KB Output is correct
16 Correct 658 ms 84348 KB Output is correct
17 Correct 799 ms 88896 KB Output is correct
18 Correct 697 ms 84196 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 781 ms 78360 KB Output is correct
21 Correct 649 ms 94120 KB Output is correct
22 Correct 718 ms 78480 KB Output is correct
23 Correct 656 ms 78712 KB Output is correct
24 Execution timed out 2071 ms 77708 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct
5 Correct 3 ms 5052 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 3 ms 4996 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 720 ms 78476 KB Output is correct
14 Correct 607 ms 90916 KB Output is correct
15 Correct 682 ms 78520 KB Output is correct
16 Correct 747 ms 79744 KB Output is correct
17 Correct 845 ms 81048 KB Output is correct
18 Correct 588 ms 81016 KB Output is correct
19 Correct 760 ms 93632 KB Output is correct
20 Correct 610 ms 84212 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 775 ms 78424 KB Output is correct
23 Correct 632 ms 93864 KB Output is correct
24 Correct 653 ms 78384 KB Output is correct
25 Correct 620 ms 79596 KB Output is correct
26 Correct 815 ms 81468 KB Output is correct
27 Correct 658 ms 84348 KB Output is correct
28 Correct 799 ms 88896 KB Output is correct
29 Correct 697 ms 84196 KB Output is correct
30 Correct 3 ms 4940 KB Output is correct
31 Correct 10 ms 5836 KB Output is correct
32 Correct 9 ms 5964 KB Output is correct
33 Correct 10 ms 5836 KB Output is correct
34 Correct 13 ms 5776 KB Output is correct
35 Correct 14 ms 5836 KB Output is correct
36 Correct 12 ms 5888 KB Output is correct
37 Correct 13 ms 5836 KB Output is correct
38 Correct 9 ms 5768 KB Output is correct
39 Correct 9 ms 5836 KB Output is correct
40 Correct 11 ms 5836 KB Output is correct
41 Correct 10 ms 5896 KB Output is correct
42 Correct 9 ms 5836 KB Output is correct
43 Correct 9 ms 6012 KB Output is correct
44 Correct 10 ms 5836 KB Output is correct
45 Correct 4 ms 4940 KB Output is correct
46 Correct 781 ms 78360 KB Output is correct
47 Correct 649 ms 94120 KB Output is correct
48 Correct 718 ms 78480 KB Output is correct
49 Correct 656 ms 78712 KB Output is correct
50 Execution timed out 2071 ms 77708 KB Time limit exceeded
51 Halted 0 ms 0 KB -