oj.uz

Submission #50589

# Submission time Handle Problem Language Result Execution time Memory
50589 2018-06-11T16:58:23 Z top34051 Construction of Highway (JOI18_construction) C++17
16 / 100
 745 ms 75088 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 2e5 + 5;
const int maxv = 2e5;
const int inf = 1e9;

struct node {
    int l,r,val;
    node(int _l = 0, int _r = 0, int _val = 0) {
        l = _l; r = _r; val = _val;
    }
    bool operator < (node a) const {
        if(a.l!=l) return l<a.l;
        if(a.r!=r) return r<a.r;
        return val<a.val;
    }
};

int n;
int a[maxn];
vector<int> way[maxn];
pii e[maxn];

map<int,int> mp;

int par[maxn];
int sz[maxn], bigc[maxn];
int m, cid[maxn], cpos[maxn];
int csz[maxn], chead[maxn];
set<node> itv[maxn];

int tree[maxv+5];
ll res;
vector<pii> all;
vector<node> sad;

void dfs(int u, int last) {
    sz[u] = 1;
    for(auto v : way[u]) {
        if(v==last) continue;
        par[v] = u;
        dfs(v, u);
        sz[u] += sz[v];
        if(sz[v] > sz[bigc[u]]) bigc[u] = v;
    }
}

void init(int u, int last) {
    cid[u] = m; cpos[u] = ++csz[m];
    if(cpos[u]==1) chead[m] = u;
    if(bigc[u]) init(bigc[u],u);
    for(auto v : way[u]) {
        if(v==last || v==bigc[u]) continue;
        m++; init(v, u);
    }
}

void update(int x, int val) {
    all.push_back({x,val});
    while(x<=maxv) {
        tree[x] += val;
        x += x&-x;
    }
}

int query(int x) {
    int res = 0;
    while(x) {
        res += tree[x];
        x -= x&-x;
    }
    return res;
}

void calc(int x, int val) {
    if(val==-1) return ;
    res += (ll)query(x-1)*val;
    update(x,val);
}

ll solve(int u) {
//    printf("---- solve %d\n",u);
    int x = cid[u];
//    for(auto t : itv[x]) printf("\t\t(%d, %d, %d)\n",t.l,t.r,t.val);
    auto it = (--itv[x].upper_bound(node(cpos[u],inf,inf)));
    while(it!=itv[x].end()) {
//        printf("\t\tcalc %d : [%d, %d]\n",it->val,it->l,min(cpos[u],it->r));
        calc(it->val,min(cpos[u],it->r)-it->l+1);
        if(it==itv[x].begin()) break;
        it--;
    }
    if(chead[x]!=1) solve(par[chead[x]]);
}

void go(int u, int val) {
//    printf("---- go %d : %d\n",u,val);
    int x = cid[u];
//    for(auto t : itv[x]) printf("\t\t(%d, %d, %d)\n",t.l,t.r,t.val);
    node tmp;
    for(auto it : itv[x]) {
        if(it.l>cpos[u]) break;
        tmp = it;
        sad.push_back(tmp);
    }
    for(auto t : sad) itv[x].erase(t);
    sad.clear();
    itv[x].insert(node(1,cpos[u],val));
    if(tmp.l!=0 && cpos[u]<tmp.r) itv[x].insert(node(cpos[u]+1,tmp.r,tmp.val));
    if(chead[x]!=1) go(par[chead[x]],val);
}

void cpidx() {
    int cur = 0;
    for(int i=1;i<=n;i++) mp[a[i]];
    for(auto &t : mp) t.second = ++cur;
    for(int i=1;i<=n;i++) a[i] = mp[a[i]];
}

int main() {
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    cpidx();
    for(int i=1;i<=n-1;i++) {
        int u,v; scanf("%d%d",&u,&v);
        way[u].push_back(v); way[v].push_back(u);
        e[i] = {u,v};
    }
    dfs(1,0);
    m = 1; init(1,0);
    for(int i=1;i<=m;i++) itv[i].insert(node(1,csz[i],-1));
//    for(int i=1;i<=n;i++) printf("%d : id = %d pos = %d (%d)\n",i,cid[i],cpos[i],chead[cid[i]]);
    go(1,a[1]);
    for(int i=1;i<=n-1;i++) {
        res = 0;
        solve(e[i].X);
        go(e[i].Y, a[e[i].Y]);
        for(auto t : all) update(t.X,-t.Y);
        all.clear();
        printf("%lld\n",res);
    }
}

Compilation message

construction.cpp: In function 'long long int solve(int)':
construction.cpp:98:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
construction.cpp: In function 'int main()':
construction.cpp:125:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
construction.cpp:126:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) scanf("%d",&a[i]);
                           ~~~~~^~~~~~~~~~~~
construction.cpp:129:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int u,v; scanf("%d%d",&u,&v);
                  ~~~~~^~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 14456 KB Output is correct
2 Correct 17 ms 14608 KB Output is correct
3 Correct 17 ms 14684 KB Output is correct
4 Correct 16 ms 14724 KB Output is correct
5 Correct 16 ms 14724 KB Output is correct
6 Correct 18 ms 14776 KB Output is correct
7 Correct 17 ms 14776 KB Output is correct
8 Correct 16 ms 14808 KB Output is correct
9 Correct 18 ms 14808 KB Output is correct
10 Correct 18 ms 14808 KB Output is correct
11 Correct 16 ms 14808 KB Output is correct
12 Correct 16 ms 14856 KB Output is correct
13 Correct 16 ms 14856 KB Output is correct
14 Correct 19 ms 14856 KB Output is correct
15 Correct 20 ms 14856 KB Output is correct
16 Correct 17 ms 14856 KB Output is correct
17 Correct 19 ms 14856 KB Output is correct
18 Correct 19 ms 14936 KB Output is correct
19 Correct 20 ms 14952 KB Output is correct
20 Correct 18 ms 14952 KB Output is correct
21 Correct 16 ms 14952 KB Output is correct
22 Correct 17 ms 14952 KB Output is correct
23 Correct 15 ms 14952 KB Output is correct
24 Correct 17 ms 14952 KB Output is correct
25 Correct 15 ms 14952 KB Output is correct
26 Correct 16 ms 14952 KB Output is correct
27 Correct 17 ms 14952 KB Output is correct
28 Correct 17 ms 14952 KB Output is correct
29 Correct 16 ms 14952 KB Output is correct
30 Correct 17 ms 14952 KB Output is correct
31 Correct 17 ms 14952 KB Output is correct
32 Correct 16 ms 14952 KB Output is correct
33 Correct 16 ms 14952 KB Output is correct
34 Correct 16 ms 14952 KB Output is correct
35 Correct 17 ms 14952 KB Output is correct
36 Correct 15 ms 14952 KB Output is correct
37 Correct 16 ms 14952 KB Output is correct
38 Correct 16 ms 14952 KB Output is correct
39 Correct 18 ms 14952 KB Output is correct
40 Correct 16 ms 14952 KB Output is correct
41 Correct 17 ms 14952 KB Output is correct
42 Correct 17 ms 14952 KB Output is correct
43 Correct 15 ms 14952 KB Output is correct
44 Correct 17 ms 14952 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 14456 KB Output is correct
2 Correct 17 ms 14608 KB Output is correct
3 Correct 17 ms 14684 KB Output is correct
4 Correct 16 ms 14724 KB Output is correct
5 Correct 16 ms 14724 KB Output is correct
6 Correct 18 ms 14776 KB Output is correct
7 Correct 17 ms 14776 KB Output is correct
8 Correct 16 ms 14808 KB Output is correct
9 Correct 18 ms 14808 KB Output is correct
10 Correct 18 ms 14808 KB Output is correct
11 Correct 16 ms 14808 KB Output is correct
12 Correct 16 ms 14856 KB Output is correct
13 Correct 16 ms 14856 KB Output is correct
14 Correct 19 ms 14856 KB Output is correct
15 Correct 20 ms 14856 KB Output is correct
16 Correct 17 ms 14856 KB Output is correct
17 Correct 19 ms 14856 KB Output is correct
18 Correct 19 ms 14936 KB Output is correct
19 Correct 20 ms 14952 KB Output is correct
20 Correct 18 ms 14952 KB Output is correct
21 Correct 16 ms 14952 KB Output is correct
22 Correct 17 ms 14952 KB Output is correct
23 Correct 15 ms 14952 KB Output is correct
24 Correct 17 ms 14952 KB Output is correct
25 Correct 15 ms 14952 KB Output is correct
26 Correct 16 ms 14952 KB Output is correct
27 Correct 17 ms 14952 KB Output is correct
28 Correct 17 ms 14952 KB Output is correct
29 Correct 16 ms 14952 KB Output is correct
30 Correct 17 ms 14952 KB Output is correct
31 Correct 17 ms 14952 KB Output is correct
32 Correct 16 ms 14952 KB Output is correct
33 Correct 16 ms 14952 KB Output is correct
34 Correct 16 ms 14952 KB Output is correct
35 Correct 17 ms 14952 KB Output is correct
36 Correct 15 ms 14952 KB Output is correct
37 Correct 16 ms 14952 KB Output is correct
38 Correct 16 ms 14952 KB Output is correct
39 Correct 18 ms 14952 KB Output is correct
40 Correct 16 ms 14952 KB Output is correct
41 Correct 17 ms 14952 KB Output is correct
42 Correct 17 ms 14952 KB Output is correct
43 Correct 15 ms 14952 KB Output is correct
44 Correct 17 ms 14952 KB Output is correct
45 Correct 17 ms 14952 KB Output is correct
46 Correct 35 ms 15468 KB Output is correct
47 Correct 29 ms 15468 KB Output is correct
48 Correct 28 ms 15468 KB Output is correct
49 Correct 23 ms 15484 KB Output is correct
50 Correct 22 ms 15500 KB Output is correct
51 Correct 24 ms 15516 KB Output is correct
52 Correct 28 ms 15700 KB Output is correct
53 Correct 24 ms 15700 KB Output is correct
54 Correct 24 ms 15700 KB Output is correct
55 Correct 25 ms 15772 KB Output is correct
56 Correct 23 ms 15772 KB Output is correct
57 Correct 39 ms 15772 KB Output is correct
58 Correct 38 ms 15772 KB Output is correct
59 Correct 32 ms 15772 KB Output is correct
60 Correct 34 ms 15772 KB Output is correct
61 Correct 22 ms 15772 KB Output is correct
62 Correct 25 ms 15772 KB Output is correct
63 Correct 24 ms 15772 KB Output is correct
64 Correct 29 ms 15772 KB Output is correct
65 Correct 27 ms 15772 KB Output is correct
66 Correct 25 ms 15772 KB Output is correct
67 Correct 28 ms 15772 KB Output is correct
68 Correct 21 ms 15772 KB Output is correct
69 Correct 26 ms 15772 KB Output is correct
70 Correct 23 ms 15772 KB Output is correct
71 Correct 26 ms 15772 KB Output is correct
72 Correct 32 ms 15772 KB Output is correct
73 Correct 43 ms 15772 KB Output is correct
74 Correct 21 ms 15772 KB Output is correct
75 Correct 25 ms 15772 KB Output is correct
76 Correct 22 ms 15772 KB Output is correct
77 Correct 25 ms 15772 KB Output is correct
78 Correct 22 ms 15772 KB Output is correct
79 Correct 21 ms 15772 KB Output is correct
80 Correct 29 ms 15772 KB Output is correct
81 Correct 24 ms 15772 KB Output is correct
82 Correct 25 ms 15772 KB Output is correct
83 Correct 22 ms 15772 KB Output is correct
84 Correct 27 ms 15772 KB Output is correct
85 Correct 21 ms 15772 KB Output is correct
86 Correct 22 ms 15772 KB Output is correct

Subtask #3
0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 14456 KB Output is correct
2 Correct 17 ms 14608 KB Output is correct
3 Correct 17 ms 14684 KB Output is correct
4 Correct 16 ms 14724 KB Output is correct
5 Correct 16 ms 14724 KB Output is correct
6 Correct 18 ms 14776 KB Output is correct
7 Correct 17 ms 14776 KB Output is correct
8 Correct 16 ms 14808 KB Output is correct
9 Correct 18 ms 14808 KB Output is correct
10 Correct 18 ms 14808 KB Output is correct
11 Correct 16 ms 14808 KB Output is correct
12 Correct 16 ms 14856 KB Output is correct
13 Correct 16 ms 14856 KB Output is correct
14 Correct 19 ms 14856 KB Output is correct
15 Correct 20 ms 14856 KB Output is correct
16 Correct 17 ms 14856 KB Output is correct
17 Correct 19 ms 14856 KB Output is correct
18 Correct 19 ms 14936 KB Output is correct
19 Correct 20 ms 14952 KB Output is correct
20 Correct 18 ms 14952 KB Output is correct
21 Correct 16 ms 14952 KB Output is correct
22 Correct 17 ms 14952 KB Output is correct
23 Correct 15 ms 14952 KB Output is correct
24 Correct 17 ms 14952 KB Output is correct
25 Correct 15 ms 14952 KB Output is correct
26 Correct 16 ms 14952 KB Output is correct
27 Correct 17 ms 14952 KB Output is correct
28 Correct 17 ms 14952 KB Output is correct
29 Correct 16 ms 14952 KB Output is correct
30 Correct 17 ms 14952 KB Output is correct
31 Correct 17 ms 14952 KB Output is correct
32 Correct 16 ms 14952 KB Output is correct
33 Correct 16 ms 14952 KB Output is correct
34 Correct 16 ms 14952 KB Output is correct
35 Correct 17 ms 14952 KB Output is correct
36 Correct 15 ms 14952 KB Output is correct
37 Correct 16 ms 14952 KB Output is correct
38 Correct 16 ms 14952 KB Output is correct
39 Correct 18 ms 14952 KB Output is correct
40 Correct 16 ms 14952 KB Output is correct
41 Correct 17 ms 14952 KB Output is correct
42 Correct 17 ms 14952 KB Output is correct
43 Correct 15 ms 14952 KB Output is correct
44 Correct 17 ms 14952 KB Output is correct
45 Correct 17 ms 14952 KB Output is correct
46 Correct 35 ms 15468 KB Output is correct
47 Correct 29 ms 15468 KB Output is correct
48 Correct 28 ms 15468 KB Output is correct
49 Correct 23 ms 15484 KB Output is correct
50 Correct 22 ms 15500 KB Output is correct
51 Correct 24 ms 15516 KB Output is correct
52 Correct 28 ms 15700 KB Output is correct
53 Correct 24 ms 15700 KB Output is correct
54 Correct 24 ms 15700 KB Output is correct
55 Correct 25 ms 15772 KB Output is correct
56 Correct 23 ms 15772 KB Output is correct
57 Correct 39 ms 15772 KB Output is correct
58 Correct 38 ms 15772 KB Output is correct
59 Correct 32 ms 15772 KB Output is correct
60 Correct 34 ms 15772 KB Output is correct
61 Correct 22 ms 15772 KB Output is correct
62 Correct 25 ms 15772 KB Output is correct
63 Correct 24 ms 15772 KB Output is correct
64 Correct 29 ms 15772 KB Output is correct
65 Correct 27 ms 15772 KB Output is correct
66 Correct 25 ms 15772 KB Output is correct
67 Correct 28 ms 15772 KB Output is correct
68 Correct 21 ms 15772 KB Output is correct
69 Correct 26 ms 15772 KB Output is correct
70 Correct 23 ms 15772 KB Output is correct
71 Correct 26 ms 15772 KB Output is correct
72 Correct 32 ms 15772 KB Output is correct
73 Correct 43 ms 15772 KB Output is correct
74 Correct 21 ms 15772 KB Output is correct
75 Correct 25 ms 15772 KB Output is correct
76 Correct 22 ms 15772 KB Output is correct
77 Correct 25 ms 15772 KB Output is correct
78 Correct 22 ms 15772 KB Output is correct
79 Correct 21 ms 15772 KB Output is correct
80 Correct 29 ms 15772 KB Output is correct
81 Correct 24 ms 15772 KB Output is correct
82 Correct 25 ms 15772 KB Output is correct
83 Correct 22 ms 15772 KB Output is correct
84 Correct 27 ms 15772 KB Output is correct
85 Correct 21 ms 15772 KB Output is correct
86 Correct 22 ms 15772 KB Output is correct
87 Correct 54 ms 16444 KB Output is correct
88 Correct 148 ms 19776 KB Output is correct
89 Correct 687 ms 31404 KB Output is correct
90 Correct 745 ms 31420 KB Output is correct
91 Correct 685 ms 31420 KB Output is correct
92 Correct 307 ms 34200 KB Output is correct
93 Correct 340 ms 34200 KB Output is correct
94 Correct 344 ms 34212 KB Output is correct
95 Runtime error 442 ms 75088 KB Execution killed with signal 11 (could be triggered by violating memory limits)
96 Halted 0 ms 0 KB -