oj.uz

Submission #124295

# Submission time Handle Problem Language Result Execution time Memory
124295 2019-07-03T00:44:26 Z duality Unique Cities (JOI19_ho_t5) C++11
68 / 100
 2000 ms 116432 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 {
            int m = query(0,N-1,fin[v],N-1,0);
            if (m >= -mm[queries[u][i].second]) mm[queries[u][i].second] = 0;
            else mm[queries[u][i].second] += max(m,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:170: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:197:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < tree2[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:202:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < tree2[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:210:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (j = 0; j < tree2[i].size(); j++) {
                 ~~^~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:215: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:248: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:251:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < cand.size(); i++) {
                 ~~^~~~~~~~~~~~~
joi2019_ho_t5.cpp:224: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:226: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:231: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 20 ms 22084 KB Output is correct
2 Correct 26 ms 22520 KB Output is correct
3 Correct 25 ms 22392 KB Output is correct
4 Correct 27 ms 22648 KB Output is correct
5 Correct 27 ms 22520 KB Output is correct
6 Correct 28 ms 22776 KB Output is correct
7 Correct 28 ms 22648 KB Output is correct
8 Correct 27 ms 22520 KB Output is correct
9 Correct 28 ms 22520 KB Output is correct
10 Correct 27 ms 22620 KB Output is correct
11 Correct 27 ms 22520 KB Output is correct
12 Correct 27 ms 22648 KB Output is correct
13 Correct 30 ms 22776 KB Output is correct
14 Correct 27 ms 22776 KB Output is correct
15 Correct 33 ms 22612 KB Output is correct
16 Correct 30 ms 22648 KB Output is correct
17 Correct 36 ms 22776 KB Output is correct
18 Correct 28 ms 22620 KB Output is correct
19 Correct 27 ms 22520 KB Output is correct
20 Correct 29 ms 22776 KB Output is correct
21 Correct 28 ms 22648 KB Output is correct
22 Correct 27 ms 22624 KB Output is correct
23 Correct 27 ms 22520 KB Output is correct
24 Correct 27 ms 22520 KB Output is correct
25 Correct 28 ms 22520 KB Output is correct
26 Correct 27 ms 22520 KB Output is correct
27 Correct 29 ms 22776 KB Output is correct
28 Correct 29 ms 22776 KB Output is correct
29 Correct 29 ms 22612 KB Output is correct
30 Correct 26 ms 22568 KB Output is correct
31 Correct 29 ms 22748 KB Output is correct
32 Correct 28 ms 22748 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 658 ms 48880 KB Output is correct
2 Correct 1144 ms 72360 KB Output is correct
3 Correct 149 ms 30580 KB Output is correct
4 Correct 1045 ms 69144 KB Output is correct
5 Correct 1905 ms 102880 KB Output is correct
6 Correct 1540 ms 85760 KB Output is correct
7 Correct 1030 ms 69072 KB Output is correct
8 Correct 1236 ms 71184 KB Output is correct
9 Correct 1139 ms 70632 KB Output is correct
10 Correct 1125 ms 70724 KB Output is correct
11 Correct 932 ms 73500 KB Output is correct
12 Correct 1872 ms 95364 KB Output is correct
13 Correct 1493 ms 86476 KB Output is correct
14 Correct 1399 ms 85448 KB Output is correct
15 Correct 903 ms 74272 KB Output is correct
16 Correct 1559 ms 98744 KB Output is correct
17 Correct 1374 ms 85120 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 794 ms 60624 KB Output is correct
2 Correct 1776 ms 104424 KB Output is correct
3 Correct 174 ms 31888 KB Output is correct
4 Correct 1055 ms 69784 KB Output is correct
5 Correct 1820 ms 104124 KB Output is correct
6 Correct 1421 ms 82860 KB Output is correct
7 Correct 1032 ms 69728 KB Output is correct
8 Correct 1201 ms 73828 KB Output is correct
9 Correct 1263 ms 72848 KB Output is correct
10 Correct 1117 ms 71628 KB Output is correct
11 Correct 1010 ms 71124 KB Output is correct
12 Correct 1885 ms 102604 KB Output is correct
13 Correct 1426 ms 84044 KB Output is correct
14 Correct 1579 ms 85760 KB Output is correct
15 Correct 936 ms 74440 KB Output is correct
16 Correct 1583 ms 101600 KB Output is correct
17 Correct 1390 ms 83088 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 22084 KB Output is correct
2 Correct 26 ms 22520 KB Output is correct
3 Correct 25 ms 22392 KB Output is correct
4 Correct 27 ms 22648 KB Output is correct
5 Correct 27 ms 22520 KB Output is correct
6 Correct 28 ms 22776 KB Output is correct
7 Correct 28 ms 22648 KB Output is correct
8 Correct 27 ms 22520 KB Output is correct
9 Correct 28 ms 22520 KB Output is correct
10 Correct 27 ms 22620 KB Output is correct
11 Correct 27 ms 22520 KB Output is correct
12 Correct 27 ms 22648 KB Output is correct
13 Correct 30 ms 22776 KB Output is correct
14 Correct 27 ms 22776 KB Output is correct
15 Correct 33 ms 22612 KB Output is correct
16 Correct 30 ms 22648 KB Output is correct
17 Correct 36 ms 22776 KB Output is correct
18 Correct 28 ms 22620 KB Output is correct
19 Correct 27 ms 22520 KB Output is correct
20 Correct 29 ms 22776 KB Output is correct
21 Correct 28 ms 22648 KB Output is correct
22 Correct 27 ms 22624 KB Output is correct
23 Correct 27 ms 22520 KB Output is correct
24 Correct 27 ms 22520 KB Output is correct
25 Correct 28 ms 22520 KB Output is correct
26 Correct 27 ms 22520 KB Output is correct
27 Correct 29 ms 22776 KB Output is correct
28 Correct 29 ms 22776 KB Output is correct
29 Correct 29 ms 22612 KB Output is correct
30 Correct 26 ms 22568 KB Output is correct
31 Correct 29 ms 22748 KB Output is correct
32 Correct 28 ms 22748 KB Output is correct
33 Correct 658 ms 48880 KB Output is correct
34 Correct 1144 ms 72360 KB Output is correct
35 Correct 149 ms 30580 KB Output is correct
36 Correct 1045 ms 69144 KB Output is correct
37 Correct 1905 ms 102880 KB Output is correct
38 Correct 1540 ms 85760 KB Output is correct
39 Correct 1030 ms 69072 KB Output is correct
40 Correct 1236 ms 71184 KB Output is correct
41 Correct 1139 ms 70632 KB Output is correct
42 Correct 1125 ms 70724 KB Output is correct
43 Correct 932 ms 73500 KB Output is correct
44 Correct 1872 ms 95364 KB Output is correct
45 Correct 1493 ms 86476 KB Output is correct
46 Correct 1399 ms 85448 KB Output is correct
47 Correct 903 ms 74272 KB Output is correct
48 Correct 1559 ms 98744 KB Output is correct
49 Correct 1374 ms 85120 KB Output is correct
50 Correct 794 ms 60624 KB Output is correct
51 Correct 1776 ms 104424 KB Output is correct
52 Correct 174 ms 31888 KB Output is correct
53 Correct 1055 ms 69784 KB Output is correct
54 Correct 1820 ms 104124 KB Output is correct
55 Correct 1421 ms 82860 KB Output is correct
56 Correct 1032 ms 69728 KB Output is correct
57 Correct 1201 ms 73828 KB Output is correct
58 Correct 1263 ms 72848 KB Output is correct
59 Correct 1117 ms 71628 KB Output is correct
60 Correct 1010 ms 71124 KB Output is correct
61 Correct 1885 ms 102604 KB Output is correct
62 Correct 1426 ms 84044 KB Output is correct
63 Correct 1579 ms 85760 KB Output is correct
64 Correct 936 ms 74440 KB Output is correct
65 Correct 1583 ms 101600 KB Output is correct
66 Correct 1390 ms 83088 KB Output is correct
67 Correct 119 ms 28524 KB Output is correct
68 Correct 876 ms 65752 KB Output is correct
69 Correct 863 ms 58992 KB Output is correct
70 Correct 1067 ms 68996 KB Output is correct
71 Correct 1944 ms 107520 KB Output is correct
72 Correct 1456 ms 84876 KB Output is correct
73 Correct 1027 ms 68916 KB Output is correct
74 Correct 1232 ms 74284 KB Output is correct
75 Correct 1101 ms 70776 KB Output is correct
76 Correct 1082 ms 70292 KB Output is correct
77 Correct 1057 ms 70856 KB Output is correct
78 Correct 1788 ms 94896 KB Output is correct
79 Correct 1712 ms 97844 KB Output is correct
80 Correct 1422 ms 84712 KB Output is correct
81 Correct 917 ms 74396 KB Output is correct
82 Correct 1846 ms 105700 KB Output is correct
83 Correct 1331 ms 86908 KB Output is correct
84 Correct 1022 ms 72284 KB Output is correct
85 Correct 1925 ms 108944 KB Output is correct
86 Correct 1443 ms 85060 KB Output is correct
87 Correct 1016 ms 72104 KB Output is correct
88 Correct 1197 ms 77696 KB Output is correct
89 Correct 1155 ms 74492 KB Output is correct
90 Correct 1180 ms 73976 KB Output is correct
91 Correct 986 ms 73956 KB Output is correct
92 Execution timed out 2067 ms 116432 KB Time limit exceeded
93 Halted 0 ms 0 KB -