oj.uz

Submission #124291

# Submission time Handle Problem Language Result Execution time Memory
124291 2019-07-03T00:40:21 Z duality Unique Cities (JOI19_ho_t5) C++11
68 / 100
 2000 ms 107400 KB 
#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")

int N,logn;
vi adjList[200000];
int C[200000];
int parent[200000][18],height[200000],node[200000];
int depth[200000],disc[200000],fin[200000],inv[200000],num = 0;
int doDFS(int u,int p,int d) {
    int i;
    parent[u][0] = p,height[u] = 0,node[u] = u;
    depth[u] = d,disc[u] = num++,inv[num-1] = u;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            doDFS(v,u,d+1);
            if (height[v]+1 > height[u]) {
                height[u] = height[v]+1,node[u] = node[v];
                if (!(height[u] & 1)) node[u] = parent[node[u]][0];
            }
        }
    }
    fin[u] = num;
    return 0;
}
int moveToward(int u,int v) {
    if (u == -1) return 0;
    if ((disc[v] >= disc[u]) && (disc[v] < fin[u])) {
        int i;
        for (i = logn-1; i >= 0; i--) {
            if ((parent[v][i] != -1) && (depth[parent[v][i]] > depth[u])) v = parent[v][i];
        }
        return v;
    }
    else return parent[u][0];
}
int height2[200000],node2[200000];
int doDFS2(int u,int p) {
    int i;
    int m1 = height2[u],m2 = height2[u],p1 = u,p2 = u;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            if (height[v]+1 >= m1) m2 = m1,p2 = p1,m1 = height[v]+1,p1 = v;
            else if (height[v]+1 >= m2) m2 = height[v]+1,p2 = v;
        }
    }
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            if (v == p1) height2[v] = m2+1,node2[v] = (p2 == u) ? node2[p2]:node[p2];
            else height2[v] = m1+1,node2[v] = (p1 == u) ? node2[p1]:node[p1];
            if (height2[v] & 1) node2[v] = moveToward(node2[v],v);
            doDFS2(v,u);
        }
    }
    return 0;
}
vpii cand,queries[200000];
int mm[400000];
int tree[1 << 19],lazy[1 << 19];
int prop(int s,int e,int i) {
    tree[i] += lazy[i];
    if (s != e) lazy[2*i+1] += lazy[i],lazy[2*i+2] += lazy[i];
    lazy[i] = 0;
    return 0;
}
int build(int s,int e,int i) {
    if (s == e) {
        tree[i] = depth[inv[s]];
        return tree[i];
    }

    int mid = (s+e) / 2;
    tree[i] = max(build(s,mid,2*i+1),build(mid+1,e,2*i+2));
    return tree[i];
}
int update(int s,int e,int as,int ae,int i,int num) {
    prop(s,e,i);
    if ((s > ae) || (e < as)) return tree[i];
    else if ((s >= as) && (e <= ae)) {
        lazy[i] += num;
        prop(s,e,i);
        return tree[i];
    }

    int mid = (s+e) / 2;
    tree[i] = max(update(s,mid,as,ae,2*i+1,num),update(mid+1,e,as,ae,2*i+2,num));
    return tree[i];
}
int query(int s,int e,int qs,int qe,int i) {
    prop(s,e,i);
    if ((s > qe) || (e < qs)) return 0;
    else if ((s >= qs) && (e <= qe)) return tree[i];

    int mid = (s+e) / 2;
    return max(query(s,mid,qs,qe,2*i+1),query(mid+1,e,qs,qe,2*i+2));
}
int doDFS3(int u,int p) {
    int i;
    for (i = 0; i < queries[u].size(); i++) {
        int v = queries[u][i].first;
        mm[queries[u][i].second] -= query(0,N-1,disc[v],disc[v],0);
        if ((disc[u] >= disc[v]) && (disc[u] < fin[v])) {
            v = moveToward(v,u);
            mm[queries[u][i].second] += query(0,N-1,disc[v],fin[v]-1,0);
        }
        else mm[queries[u][i].second] += max(query(0,N-1,fin[v],N-1,0),query(0,N-1,0,disc[v]-1,0));
    }
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            update(0,N-1,0,N-1,0,1),update(0,N-1,disc[v],fin[v]-1,0,-2);
            doDFS3(v,u);
            update(0,N-1,0,N-1,0,-1),update(0,N-1,disc[v],fin[v]-1,0,2);
        }
    }
    return 0;
}
int c[200000],n = 0;
vi tree2[1 << 19];
int ans[200000];
int add(int s,int e,int as,int ae,int i,int num) {
    if ((s > ae) || (e < as)) return 0;
    else if ((s >= as) && (e <= ae)) {
        tree2[i].pb(num);
        return 0;
    }

    int mid = (s+e) / 2;
    add(s,mid,as,ae,2*i+1,num),add(mid+1,e,as,ae,2*i+2,num);
    return 0;
}
int process(int s,int e,int i) {
    if (s == e) {
        int j;
        for (j = 0; j < tree2[i].size(); j++) {
            if (c[tree2[i][j]] == 0) n++;
            c[tree2[i][j]]++;
        }
        ans[inv[s]] = n;
        for (j = 0; j < tree2[i].size(); j++) {
            if (c[tree2[i][j]] == 1) n--;
            c[tree2[i][j]]--;
        }
        return 0;
    }

    int j,mid = (s+e) / 2;
    for (j = 0; j < tree2[i].size(); j++) {
        if (c[tree2[i][j]] == 0) n++;
        c[tree2[i][j]]++;
    }
    process(s,mid,2*i+1),process(mid+1,e,2*i+2);
    for (j = 0; j < tree2[i].size(); j++) {
        if (c[tree2[i][j]] == 1) n--;
        c[tree2[i][j]]--;
    }
    return 0;
}
int main() {
    int i;
    int M,A,B;
    scanf("%d %d",&N,&M);
    for (i = 0; i < N-1; i++) {
        scanf("%d %d",&A,&B);
        A--,B--;
        adjList[A].pb(B);
        adjList[B].pb(A);
    }
    for (i = 0; i < N; i++) scanf("%d",&C[i]),C[i]--;

    int j;
    doDFS(0,-1,0);
    for (i = 1; (1 << i) < N; i++) {
        for (j = 0; j < N; j++) {
            if (parent[j][i-1] != -1) parent[j][i] = parent[parent[j][i-1]][i-1];
            else parent[j][i] = -1;
        }
    }
    logn = i;
    height2[0] = 0,node2[0] = -1;
    doDFS2(0,-1);
    for (i = 1; i < N; i++) {
        cand.pb(mp(parent[i][0],node[i]));
        cand.pb(mp(i,node2[i]));
    }
    for (i = 0; i < cand.size(); i++) queries[cand[i].second].pb(mp(cand[i].first,i));
    build(0,N-1,0);
    doDFS3(0,-1);
    for (i = 0; i < cand.size(); i++) {
        if (mm[i] < 0) {
            int u = cand[i].first,v = cand[i].second;
            if ((disc[u] >= disc[v]) && (disc[u] < fin[v])) {
                v = moveToward(v,u);
                add(0,N-1,fin[v],N-1,0,C[u]),add(0,N-1,0,disc[v]-1,0,C[u]);
            }
            else add(0,N-1,disc[v],fin[v]-1,0,C[u]);
        }
    }
    process(0,N-1,0);
    for (i = 0; i < N; i++) printf("%d\n",ans[i]);

    return 0;
}

Compilation message

joi2019_ho_t5.cpp: In function 'int doDFS(int, int, int)':
joi2019_ho_t5.cpp:69:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int doDFS2(int, int)':
joi2019_ho_t5.cpp:97:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:104:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int doDFS3(int, int)':
joi2019_ho_t5.cpp:157:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < queries[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:166:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int process(int, int, int)':
joi2019_ho_t5.cpp:193:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < tree2[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:198:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < tree2[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:206:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (j = 0; j < tree2[i].size(); j++) {
                 ~~^~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:211:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (j = 0; j < tree2[i].size(); j++) {
                 ~~^~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:244:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < cand.size(); i++) queries[cand[i].second].pb(mp(cand[i].first,i));
                 ~~^~~~~~~~~~~~~
joi2019_ho_t5.cpp:247:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < cand.size(); i++) {
                 ~~^~~~~~~~~~~~~
joi2019_ho_t5.cpp:220:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:222:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&A,&B);
         ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:227:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&C[i]),C[i]--;
                             ~~~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 22136 KB Output is correct
2 Correct 26 ms 22520 KB Output is correct
3 Correct 24 ms 22392 KB Output is correct
4 Correct 33 ms 22648 KB Output is correct
5 Correct 27 ms 22520 KB Output is correct
6 Correct 29 ms 22776 KB Output is correct
7 Correct 28 ms 22648 KB Output is correct
8 Correct 27 ms 22564 KB Output is correct
9 Correct 27 ms 22648 KB Output is correct
10 Correct 31 ms 22620 KB Output is correct
11 Correct 26 ms 22520 KB Output is correct
12 Correct 27 ms 22648 KB Output is correct
13 Correct 29 ms 22776 KB Output is correct
14 Correct 27 ms 22648 KB Output is correct
15 Correct 33 ms 22648 KB Output is correct
16 Correct 28 ms 22632 KB Output is correct
17 Correct 29 ms 22904 KB Output is correct
18 Correct 28 ms 22648 KB Output is correct
19 Correct 27 ms 22520 KB Output is correct
20 Correct 29 ms 22900 KB Output is correct
21 Correct 28 ms 22648 KB Output is correct
22 Correct 28 ms 22520 KB Output is correct
23 Correct 27 ms 22648 KB Output is correct
24 Correct 27 ms 22520 KB Output is correct
25 Correct 27 ms 22648 KB Output is correct
26 Correct 26 ms 22648 KB Output is correct
27 Correct 29 ms 22776 KB Output is correct
28 Correct 29 ms 22776 KB Output is correct
29 Correct 27 ms 22648 KB Output is correct
30 Correct 26 ms 22648 KB Output is correct
31 Correct 29 ms 22904 KB Output is correct
32 Correct 28 ms 22648 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 584 ms 48888 KB Output is correct
2 Correct 1016 ms 72356 KB Output is correct
3 Correct 153 ms 30584 KB Output is correct
4 Correct 1098 ms 68964 KB Output is correct
5 Correct 1747 ms 102864 KB Output is correct
6 Correct 1636 ms 85848 KB Output is correct
7 Correct 1116 ms 69136 KB Output is correct
8 Correct 1200 ms 71140 KB Output is correct
9 Correct 1201 ms 70708 KB Output is correct
10 Correct 1229 ms 70828 KB Output is correct
11 Correct 998 ms 73540 KB Output is correct
12 Correct 1828 ms 95444 KB Output is correct
13 Correct 1535 ms 86504 KB Output is correct
14 Correct 1470 ms 85580 KB Output is correct
15 Correct 1002 ms 74428 KB Output is correct
16 Correct 1629 ms 98828 KB Output is correct
17 Correct 1388 ms 85084 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 993 ms 60636 KB Output is correct
2 Correct 1865 ms 104468 KB Output is correct
3 Correct 176 ms 31956 KB Output is correct
4 Correct 1139 ms 69692 KB Output is correct
5 Correct 1789 ms 104024 KB Output is correct
6 Correct 1476 ms 82916 KB Output is correct
7 Correct 1104 ms 69736 KB Output is correct
8 Correct 1254 ms 73916 KB Output is correct
9 Correct 1244 ms 72680 KB Output is correct
10 Correct 1214 ms 71616 KB Output is correct
11 Correct 1104 ms 71132 KB Output is correct
12 Correct 1864 ms 102624 KB Output is correct
13 Correct 1460 ms 84044 KB Output is correct
14 Correct 1554 ms 85908 KB Output is correct
15 Correct 979 ms 74336 KB Output is correct
16 Correct 1657 ms 101604 KB Output is correct
17 Correct 1532 ms 83152 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 22136 KB Output is correct
2 Correct 26 ms 22520 KB Output is correct
3 Correct 24 ms 22392 KB Output is correct
4 Correct 33 ms 22648 KB Output is correct
5 Correct 27 ms 22520 KB Output is correct
6 Correct 29 ms 22776 KB Output is correct
7 Correct 28 ms 22648 KB Output is correct
8 Correct 27 ms 22564 KB Output is correct
9 Correct 27 ms 22648 KB Output is correct
10 Correct 31 ms 22620 KB Output is correct
11 Correct 26 ms 22520 KB Output is correct
12 Correct 27 ms 22648 KB Output is correct
13 Correct 29 ms 22776 KB Output is correct
14 Correct 27 ms 22648 KB Output is correct
15 Correct 33 ms 22648 KB Output is correct
16 Correct 28 ms 22632 KB Output is correct
17 Correct 29 ms 22904 KB Output is correct
18 Correct 28 ms 22648 KB Output is correct
19 Correct 27 ms 22520 KB Output is correct
20 Correct 29 ms 22900 KB Output is correct
21 Correct 28 ms 22648 KB Output is correct
22 Correct 28 ms 22520 KB Output is correct
23 Correct 27 ms 22648 KB Output is correct
24 Correct 27 ms 22520 KB Output is correct
25 Correct 27 ms 22648 KB Output is correct
26 Correct 26 ms 22648 KB Output is correct
27 Correct 29 ms 22776 KB Output is correct
28 Correct 29 ms 22776 KB Output is correct
29 Correct 27 ms 22648 KB Output is correct
30 Correct 26 ms 22648 KB Output is correct
31 Correct 29 ms 22904 KB Output is correct
32 Correct 28 ms 22648 KB Output is correct
33 Correct 584 ms 48888 KB Output is correct
34 Correct 1016 ms 72356 KB Output is correct
35 Correct 153 ms 30584 KB Output is correct
36 Correct 1098 ms 68964 KB Output is correct
37 Correct 1747 ms 102864 KB Output is correct
38 Correct 1636 ms 85848 KB Output is correct
39 Correct 1116 ms 69136 KB Output is correct
40 Correct 1200 ms 71140 KB Output is correct
41 Correct 1201 ms 70708 KB Output is correct
42 Correct 1229 ms 70828 KB Output is correct
43 Correct 998 ms 73540 KB Output is correct
44 Correct 1828 ms 95444 KB Output is correct
45 Correct 1535 ms 86504 KB Output is correct
46 Correct 1470 ms 85580 KB Output is correct
47 Correct 1002 ms 74428 KB Output is correct
48 Correct 1629 ms 98828 KB Output is correct
49 Correct 1388 ms 85084 KB Output is correct
50 Correct 993 ms 60636 KB Output is correct
51 Correct 1865 ms 104468 KB Output is correct
52 Correct 176 ms 31956 KB Output is correct
53 Correct 1139 ms 69692 KB Output is correct
54 Correct 1789 ms 104024 KB Output is correct
55 Correct 1476 ms 82916 KB Output is correct
56 Correct 1104 ms 69736 KB Output is correct
57 Correct 1254 ms 73916 KB Output is correct
58 Correct 1244 ms 72680 KB Output is correct
59 Correct 1214 ms 71616 KB Output is correct
60 Correct 1104 ms 71132 KB Output is correct
61 Correct 1864 ms 102624 KB Output is correct
62 Correct 1460 ms 84044 KB Output is correct
63 Correct 1554 ms 85908 KB Output is correct
64 Correct 979 ms 74336 KB Output is correct
65 Correct 1657 ms 101604 KB Output is correct
66 Correct 1532 ms 83152 KB Output is correct
67 Correct 150 ms 28520 KB Output is correct
68 Correct 973 ms 65872 KB Output is correct
69 Correct 885 ms 58952 KB Output is correct
70 Correct 1172 ms 69132 KB Output is correct
71 Execution timed out 2031 ms 107400 KB Time limit exceeded
72 Halted 0 ms 0 KB -