oj.uz

답안 #600723

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
600723 2022-07-21T07:29:18 Z AA_Surely Construction of Highway (JOI18_construction) C++14
7 / 100
 2000 ms 8264 KB 
#include <bits/stdc++.h>

#define FOR(i, x, n) for(int i = x; i < n; i++)
#define F0R(i, n) FOR(i, 0, n)
#define ROF(i, x, n) for(int i = n - 1; i >= x; i--)
#define R0F(i, n) ROF(i, 0, n)

#define WTF cout << "WTF" << endl

#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define F first
#define S second
#define PB push_back

#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()

using namespace std;

typedef long long LL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;

#define lc now << 1
#define rc now << 1 | 1

const int N = 1e5 + 5;

int n;
int cs[N], sz[N], t[N], cnt;
int head[N], height[N], par[N];
int order[N];
PII eset[N];
VI adj[N], comp;

struct Fenwick {
    int fen[N];
    VI changed;

    void add(int id, int val) {
        for(; id < N; id += id & -id) {
            fen[id] += val;
            changed.PB(id);
        }
        return;
    }

    int get(int id) {
        int ret = 0;
        for(; id; id -= id & -id) ret += fen[id];
        return ret;
    }

    void clear() {
        for(const int &on : changed) fen[on] = 0;
        changed.clear();
    }
} sum;

struct Segment {
    bool tree[N << 2];
    int lz[N << 2], cnt = 0;

    void init() {
        memset(lz, -1, sizeof lz);
        return;
    }

    void shift(int now) {
        if (lz[now] == -1) return;
        
        tree[lc] = lz[lc] = lz[now];
        tree[rc] = lz[rc] = lz[now];

        lz[now] = -1;
        return;
    }

    void change(int lq, int rq, bool val, int now = 1, int ls = 0, int rs = n - 1) {
        if (rq < lq || rq < ls || rs < lq) return;
        if (lq <= ls && rs <= rq) {
            tree[now] = lz[now] = val;
            return;
        }

        int mid = (ls + rs) >> 1;
        shift(now);
        change(lq, rq, val, lc, ls, mid);
        change(lq, rq, val, rc, mid + 1, rs);
        
        tree[now] = tree[lc] | tree[rc];
        return;
    }

    int rightest1(int q, int now = 1, int ls = 0, int rs = n - 1) {
        if (ls >= q || !tree[now]) return -1;
        if (ls == rs) return ls;

        int mid = (ls + rs) >> 1;
        shift(now);
        int case1 = rightest1(q, rc, mid + 1, rs);
        return (case1 == -1 ? rightest1(q, lc, ls, mid) : case1);
    }
} hldq;

struct MaxSeg {
    PII tree[N << 2];
    int cnt = 0;

    void init() {
        fill(tree, tree + (N << 2), PII(-1, -1));
        return;
    }

    void cseg(int lq, int rq, PII val, int now = 1, int ls = 0, int rs = n - 1) {
        if (rq < lq || rq < ls || rs < lq) return;
        if (lq <= ls && rs <= rq) {
            tree[now] = val;
            return;
        }

        int mid = (ls + rs) >> 1;
        cseg(lq, rq, val, lc, ls, mid);
        cseg(lq, rq, val, rc, mid + 1, rs);

        return;
    }

    void change(int lq, int rq, int val) {
        cseg(lq, rq, PII(cnt, val));
        cnt++;
    }
    
    PII gseg(int id, int now = 1, int ls = 0, int rs = n - 1) {
        if (ls == rs) return tree[now];
        int mid = (ls + rs) >> 1;
        if (id <= mid) return max(tree[now], gseg(id, lc, ls, mid));
        return max(tree[now], gseg(id, rc, mid + 1, rs));
    }

    int get(int id) {
        return gseg(id).S;
    }
} color;

void init() {
    cin >> n;
    comp.resize(n);
    F0R(i, n) {
        cin >> cs[i];
        comp[i] = cs[i];
    }

    par[0] = -1;

    sort(ALL(comp)); 
    comp.resize(unique(ALL(comp)) - comp.begin());
    F0R(i, n) cs[i] = lower_bound(ALL(comp), cs[i]) - comp.begin() + 1;

    F0R(i, n - 1) {
        int u, v; cin >> u >> v;
        adj[--u].PB(--v);
        eset[i] = {u, v};

        par[v] = u;
    }

    return;
}

int preD(int now) {
    sz[now] = 1;
    for(int on : adj[now]) {
        height[on] = height[now] + 1;
        sz[now] += preD(on);
    }

    return sz[now];
}

void dfs(int now) {
    order[cnt] = now;
    t[now] = cnt++;

    sort(ALL(adj[now]), [](const int &a, const int &b) {return sz[a] > sz[b];});
    if (!adj[now].empty()) head[ adj[now][0] ] = head[now];

    for(int on : adj[now]) 
        dfs(on);

    return;
}

LL get(int v) {
    LL ret = 0;
    sum.clear();

    while(v != -1) {
        int pl = hldq.rightest1(t[v]);
        if (pl >= t[ head[v] ]) {
            pl = order[pl];

            LL us = height[v] - height[pl];
            int num = color.get(t[v]);

            ret += sum.get(num - 1) * us;
            sum.add(num, us);

            v = pl;
        }

        else {
            LL us = height[v] - height[ head[v] ] + 1;
            int num = color.get(t[v]);
            
            ret += sum.get(num - 1) * us;
            sum.add(num, us);

            v = par[ head[v] ];
        }
    }

    return ret;
}

void change(int v, int col) {
    while(v != -1) {
        hldq.change(t[v], t[v], 1);
        //cout << "changing " << t[head[v]] << ' ' << t[v] << " to " << x
        color.change(t[ head[v] ], t[v], col);

        if (v == head[v]) {
            v = par[v];
            continue;
        }

        v = par[v];
        hldq.change(t[ head[v] ], t[v], 0);
        v = par[ head[v] ];
    }

    return;
}

int main() {
    IOS;

    init();

    /*color.change(0, 0, 1);
    color.change(0, 0, 2);
    cout << color.get(0) << endl;*/

    preD(0);
    dfs(0);
    iota(head, head + n, 0);

    color.init();
    color.change(0, 0, cs[0]);
    hldq.init();

    //F0R(i, n) cout << order[i] + 1 << ' '; cout << endl;

    F0R(i, n - 1) {
        cout << get(eset[i].F) << endl;
        change(eset[i].S, cs[ eset[i].S ]);

        //cout << "after edge " << i + 1 << " colors are ";
        //F0R(i, n) cout << color.get(i) << ' '; cout << endl;
    }

    return 0;
}

Compilation message

construction.cpp: In member function 'void Segment::shift(int)':
construction.cpp:78:27: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   78 |         tree[lc] = lz[lc] = lz[now];
      |                    ~~~~~~~^~~~~~~~~
construction.cpp:79:27: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   79 |         tree[rc] = lz[rc] = lz[now];
      |                    ~~~~~~~^~~~~~~~~
construction.cpp: In member function 'void Segment::change(int, int, bool, int, int, int)':
construction.cpp:88:33: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   88 |             tree[now] = lz[now] = val;
      |                         ~~~~~~~~^~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 6 ms 7380 KB Output is correct
8 Correct 42 ms 7508 KB Output is correct
9 Correct 43 ms 7540 KB Output is correct
10 Correct 42 ms 7532 KB Output is correct
11 Correct 23 ms 7508 KB Output is correct
12 Correct 26 ms 7508 KB Output is correct
13 Correct 23 ms 7508 KB Output is correct
14 Correct 28 ms 7508 KB Output is correct
15 Correct 6 ms 7380 KB Output is correct
16 Correct 6 ms 7380 KB Output is correct
17 Correct 8 ms 7380 KB Output is correct
18 Correct 7 ms 7464 KB Output is correct
19 Correct 23 ms 7508 KB Output is correct
20 Correct 23 ms 7508 KB Output is correct
21 Correct 22 ms 7508 KB Output is correct
22 Correct 5 ms 7380 KB Output is correct
23 Correct 5 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 6 ms 7380 KB Output is correct
26 Correct 45 ms 7556 KB Output is correct
27 Correct 23 ms 7508 KB Output is correct
28 Correct 24 ms 7508 KB Output is correct
29 Correct 24 ms 7508 KB Output is correct
30 Correct 6 ms 7380 KB Output is correct
31 Correct 6 ms 7380 KB Output is correct
32 Correct 23 ms 7484 KB Output is correct
33 Correct 14 ms 7392 KB Output is correct
34 Correct 10 ms 7380 KB Output is correct
35 Correct 9 ms 7380 KB Output is correct
36 Correct 15 ms 7380 KB Output is correct
37 Correct 11 ms 7392 KB Output is correct
38 Correct 10 ms 7380 KB Output is correct
39 Correct 14 ms 7380 KB Output is correct
40 Correct 12 ms 7380 KB Output is correct
41 Correct 9 ms 7436 KB Output is correct
42 Correct 16 ms 7612 KB Output is correct
43 Correct 11 ms 7380 KB Output is correct
44 Correct 10 ms 7380 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 6 ms 7380 KB Output is correct
8 Correct 42 ms 7508 KB Output is correct
9 Correct 43 ms 7540 KB Output is correct
10 Correct 42 ms 7532 KB Output is correct
11 Correct 23 ms 7508 KB Output is correct
12 Correct 26 ms 7508 KB Output is correct
13 Correct 23 ms 7508 KB Output is correct
14 Correct 28 ms 7508 KB Output is correct
15 Correct 6 ms 7380 KB Output is correct
16 Correct 6 ms 7380 KB Output is correct
17 Correct 8 ms 7380 KB Output is correct
18 Correct 7 ms 7464 KB Output is correct
19 Correct 23 ms 7508 KB Output is correct
20 Correct 23 ms 7508 KB Output is correct
21 Correct 22 ms 7508 KB Output is correct
22 Correct 5 ms 7380 KB Output is correct
23 Correct 5 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 6 ms 7380 KB Output is correct
26 Correct 45 ms 7556 KB Output is correct
27 Correct 23 ms 7508 KB Output is correct
28 Correct 24 ms 7508 KB Output is correct
29 Correct 24 ms 7508 KB Output is correct
30 Correct 6 ms 7380 KB Output is correct
31 Correct 6 ms 7380 KB Output is correct
32 Correct 23 ms 7484 KB Output is correct
33 Correct 14 ms 7392 KB Output is correct
34 Correct 10 ms 7380 KB Output is correct
35 Correct 9 ms 7380 KB Output is correct
36 Correct 15 ms 7380 KB Output is correct
37 Correct 11 ms 7392 KB Output is correct
38 Correct 10 ms 7380 KB Output is correct
39 Correct 14 ms 7380 KB Output is correct
40 Correct 12 ms 7380 KB Output is correct
41 Correct 9 ms 7436 KB Output is correct
42 Correct 16 ms 7612 KB Output is correct
43 Correct 11 ms 7380 KB Output is correct
44 Correct 10 ms 7380 KB Output is correct
45 Correct 8 ms 7380 KB Output is correct
46 Correct 29 ms 7688 KB Output is correct
47 Correct 25 ms 7680 KB Output is correct
48 Correct 25 ms 7692 KB Output is correct
49 Execution timed out 2088 ms 8264 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7380 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 6 ms 7380 KB Output is correct
8 Correct 42 ms 7508 KB Output is correct
9 Correct 43 ms 7540 KB Output is correct
10 Correct 42 ms 7532 KB Output is correct
11 Correct 23 ms 7508 KB Output is correct
12 Correct 26 ms 7508 KB Output is correct
13 Correct 23 ms 7508 KB Output is correct
14 Correct 28 ms 7508 KB Output is correct
15 Correct 6 ms 7380 KB Output is correct
16 Correct 6 ms 7380 KB Output is correct
17 Correct 8 ms 7380 KB Output is correct
18 Correct 7 ms 7464 KB Output is correct
19 Correct 23 ms 7508 KB Output is correct
20 Correct 23 ms 7508 KB Output is correct
21 Correct 22 ms 7508 KB Output is correct
22 Correct 5 ms 7380 KB Output is correct
23 Correct 5 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 6 ms 7380 KB Output is correct
26 Correct 45 ms 7556 KB Output is correct
27 Correct 23 ms 7508 KB Output is correct
28 Correct 24 ms 7508 KB Output is correct
29 Correct 24 ms 7508 KB Output is correct
30 Correct 6 ms 7380 KB Output is correct
31 Correct 6 ms 7380 KB Output is correct
32 Correct 23 ms 7484 KB Output is correct
33 Correct 14 ms 7392 KB Output is correct
34 Correct 10 ms 7380 KB Output is correct
35 Correct 9 ms 7380 KB Output is correct
36 Correct 15 ms 7380 KB Output is correct
37 Correct 11 ms 7392 KB Output is correct
38 Correct 10 ms 7380 KB Output is correct
39 Correct 14 ms 7380 KB Output is correct
40 Correct 12 ms 7380 KB Output is correct
41 Correct 9 ms 7436 KB Output is correct
42 Correct 16 ms 7612 KB Output is correct
43 Correct 11 ms 7380 KB Output is correct
44 Correct 10 ms 7380 KB Output is correct
45 Correct 8 ms 7380 KB Output is correct
46 Correct 29 ms 7688 KB Output is correct
47 Correct 25 ms 7680 KB Output is correct
48 Correct 25 ms 7692 KB Output is correct
49 Execution timed out 2088 ms 8264 KB Time limit exceeded
50 Halted 0 ms 0 KB -