답안 #50554 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
50554	2018-06-11T13:33:34 Z	top34051	Construction of Highway (JOI18_construction)	C++17	16 / 100	710 ms	77856 KB

construction

#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 = 1e5 + 5;
const int maxv = 1e5;
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;

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(1) {
//        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;
    while(!itv[x].empty() && itv[x].begin()->l <= cpos[u]) {
        tmp = *itv[x].begin();
        itv[x].erase(itv[x].begin());
    }
    itv[x].insert(node(1,cpos[u],val));
    if(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:97:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
construction.cpp: In function 'int main()':
construction.cpp:121:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
construction.cpp:122: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:125: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

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7416 KB	Output is correct
2	Correct	10 ms	7528 KB	Output is correct
3	Correct	10 ms	7528 KB	Output is correct
4	Correct	11 ms	7680 KB	Output is correct
5	Correct	11 ms	7768 KB	Output is correct
6	Correct	12 ms	7768 KB	Output is correct
7	Correct	11 ms	7792 KB	Output is correct
8	Correct	10 ms	7804 KB	Output is correct
9	Correct	10 ms	8012 KB	Output is correct
10	Correct	10 ms	8012 KB	Output is correct
11	Correct	10 ms	8012 KB	Output is correct
12	Correct	11 ms	8136 KB	Output is correct
13	Correct	10 ms	8164 KB	Output is correct
14	Correct	10 ms	8164 KB	Output is correct
15	Correct	11 ms	8164 KB	Output is correct
16	Correct	10 ms	8180 KB	Output is correct
17	Correct	12 ms	8192 KB	Output is correct
18	Correct	11 ms	8204 KB	Output is correct
19	Correct	12 ms	8220 KB	Output is correct
20	Correct	11 ms	8232 KB	Output is correct
21	Correct	9 ms	8244 KB	Output is correct
22	Correct	10 ms	8244 KB	Output is correct
23	Correct	11 ms	8244 KB	Output is correct
24	Correct	10 ms	8272 KB	Output is correct
25	Correct	10 ms	8320 KB	Output is correct
26	Correct	10 ms	8328 KB	Output is correct
27	Correct	9 ms	8336 KB	Output is correct
28	Correct	10 ms	8360 KB	Output is correct
29	Correct	11 ms	8368 KB	Output is correct
30	Correct	11 ms	8492 KB	Output is correct
31	Correct	12 ms	8492 KB	Output is correct
32	Correct	10 ms	8492 KB	Output is correct
33	Correct	11 ms	8492 KB	Output is correct
34	Correct	11 ms	8504 KB	Output is correct
35	Correct	12 ms	8504 KB	Output is correct
36	Correct	10 ms	8520 KB	Output is correct
37	Correct	9 ms	8520 KB	Output is correct
38	Correct	11 ms	8520 KB	Output is correct
39	Correct	11 ms	8520 KB	Output is correct
40	Correct	10 ms	8520 KB	Output is correct
41	Correct	12 ms	8576 KB	Output is correct
42	Correct	11 ms	8576 KB	Output is correct
43	Correct	11 ms	8584 KB	Output is correct
44	Correct	10 ms	8584 KB	Output is correct

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7416 KB	Output is correct
2	Correct	10 ms	7528 KB	Output is correct
3	Correct	10 ms	7528 KB	Output is correct
4	Correct	11 ms	7680 KB	Output is correct
5	Correct	11 ms	7768 KB	Output is correct
6	Correct	12 ms	7768 KB	Output is correct
7	Correct	11 ms	7792 KB	Output is correct
8	Correct	10 ms	7804 KB	Output is correct
9	Correct	10 ms	8012 KB	Output is correct
10	Correct	10 ms	8012 KB	Output is correct
11	Correct	10 ms	8012 KB	Output is correct
12	Correct	11 ms	8136 KB	Output is correct
13	Correct	10 ms	8164 KB	Output is correct
14	Correct	10 ms	8164 KB	Output is correct
15	Correct	11 ms	8164 KB	Output is correct
16	Correct	10 ms	8180 KB	Output is correct
17	Correct	12 ms	8192 KB	Output is correct
18	Correct	11 ms	8204 KB	Output is correct
19	Correct	12 ms	8220 KB	Output is correct
20	Correct	11 ms	8232 KB	Output is correct
21	Correct	9 ms	8244 KB	Output is correct
22	Correct	10 ms	8244 KB	Output is correct
23	Correct	11 ms	8244 KB	Output is correct
24	Correct	10 ms	8272 KB	Output is correct
25	Correct	10 ms	8320 KB	Output is correct
26	Correct	10 ms	8328 KB	Output is correct
27	Correct	9 ms	8336 KB	Output is correct
28	Correct	10 ms	8360 KB	Output is correct
29	Correct	11 ms	8368 KB	Output is correct
30	Correct	11 ms	8492 KB	Output is correct
31	Correct	12 ms	8492 KB	Output is correct
32	Correct	10 ms	8492 KB	Output is correct
33	Correct	11 ms	8492 KB	Output is correct
34	Correct	11 ms	8504 KB	Output is correct
35	Correct	12 ms	8504 KB	Output is correct
36	Correct	10 ms	8520 KB	Output is correct
37	Correct	9 ms	8520 KB	Output is correct
38	Correct	11 ms	8520 KB	Output is correct
39	Correct	11 ms	8520 KB	Output is correct
40	Correct	10 ms	8520 KB	Output is correct
41	Correct	12 ms	8576 KB	Output is correct
42	Correct	11 ms	8576 KB	Output is correct
43	Correct	11 ms	8584 KB	Output is correct
44	Correct	10 ms	8584 KB	Output is correct
45	Correct	12 ms	8600 KB	Output is correct
46	Correct	21 ms	9260 KB	Output is correct
47	Correct	21 ms	9336 KB	Output is correct
48	Correct	22 ms	9412 KB	Output is correct
49	Correct	17 ms	9488 KB	Output is correct
50	Correct	16 ms	9564 KB	Output is correct
51	Correct	14 ms	9768 KB	Output is correct
52	Correct	17 ms	9844 KB	Output is correct
53	Correct	20 ms	10028 KB	Output is correct
54	Correct	23 ms	10104 KB	Output is correct
55	Correct	19 ms	10104 KB	Output is correct
56	Correct	18 ms	10104 KB	Output is correct
57	Correct	32 ms	10144 KB	Output is correct
58	Correct	27 ms	10164 KB	Output is correct
59	Correct	25 ms	10208 KB	Output is correct
60	Correct	26 ms	10284 KB	Output is correct
61	Correct	19 ms	10360 KB	Output is correct
62	Correct	22 ms	10548 KB	Output is correct
63	Correct	18 ms	10556 KB	Output is correct
64	Correct	21 ms	10556 KB	Output is correct
65	Correct	17 ms	10556 KB	Output is correct
66	Correct	22 ms	10556 KB	Output is correct
67	Correct	21 ms	10608 KB	Output is correct
68	Correct	16 ms	10668 KB	Output is correct
69	Correct	20 ms	10972 KB	Output is correct
70	Correct	16 ms	10972 KB	Output is correct
71	Correct	17 ms	10972 KB	Output is correct
72	Correct	24 ms	10996 KB	Output is correct
73	Correct	25 ms	10996 KB	Output is correct
74	Correct	16 ms	10996 KB	Output is correct
75	Correct	20 ms	11148 KB	Output is correct
76	Correct	17 ms	11256 KB	Output is correct
77	Correct	19 ms	11256 KB	Output is correct
78	Correct	16 ms	11256 KB	Output is correct
79	Correct	18 ms	11256 KB	Output is correct
80	Correct	21 ms	11256 KB	Output is correct
81	Correct	18 ms	11472 KB	Output is correct
82	Correct	16 ms	11504 KB	Output is correct
83	Correct	19 ms	11660 KB	Output is correct
84	Correct	17 ms	11660 KB	Output is correct
85	Correct	17 ms	11660 KB	Output is correct
86	Correct	17 ms	11660 KB	Output is correct

Subtask #3
0 / 84.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7416 KB	Output is correct
2	Correct	10 ms	7528 KB	Output is correct
3	Correct	10 ms	7528 KB	Output is correct
4	Correct	11 ms	7680 KB	Output is correct
5	Correct	11 ms	7768 KB	Output is correct
6	Correct	12 ms	7768 KB	Output is correct
7	Correct	11 ms	7792 KB	Output is correct
8	Correct	10 ms	7804 KB	Output is correct
9	Correct	10 ms	8012 KB	Output is correct
10	Correct	10 ms	8012 KB	Output is correct
11	Correct	10 ms	8012 KB	Output is correct
12	Correct	11 ms	8136 KB	Output is correct
13	Correct	10 ms	8164 KB	Output is correct
14	Correct	10 ms	8164 KB	Output is correct
15	Correct	11 ms	8164 KB	Output is correct
16	Correct	10 ms	8180 KB	Output is correct
17	Correct	12 ms	8192 KB	Output is correct
18	Correct	11 ms	8204 KB	Output is correct
19	Correct	12 ms	8220 KB	Output is correct
20	Correct	11 ms	8232 KB	Output is correct
21	Correct	9 ms	8244 KB	Output is correct
22	Correct	10 ms	8244 KB	Output is correct
23	Correct	11 ms	8244 KB	Output is correct
24	Correct	10 ms	8272 KB	Output is correct
25	Correct	10 ms	8320 KB	Output is correct
26	Correct	10 ms	8328 KB	Output is correct
27	Correct	9 ms	8336 KB	Output is correct
28	Correct	10 ms	8360 KB	Output is correct
29	Correct	11 ms	8368 KB	Output is correct
30	Correct	11 ms	8492 KB	Output is correct
31	Correct	12 ms	8492 KB	Output is correct
32	Correct	10 ms	8492 KB	Output is correct
33	Correct	11 ms	8492 KB	Output is correct
34	Correct	11 ms	8504 KB	Output is correct
35	Correct	12 ms	8504 KB	Output is correct
36	Correct	10 ms	8520 KB	Output is correct
37	Correct	9 ms	8520 KB	Output is correct
38	Correct	11 ms	8520 KB	Output is correct
39	Correct	11 ms	8520 KB	Output is correct
40	Correct	10 ms	8520 KB	Output is correct
41	Correct	12 ms	8576 KB	Output is correct
42	Correct	11 ms	8576 KB	Output is correct
43	Correct	11 ms	8584 KB	Output is correct
44	Correct	10 ms	8584 KB	Output is correct
45	Correct	12 ms	8600 KB	Output is correct
46	Correct	21 ms	9260 KB	Output is correct
47	Correct	21 ms	9336 KB	Output is correct
48	Correct	22 ms	9412 KB	Output is correct
49	Correct	17 ms	9488 KB	Output is correct
50	Correct	16 ms	9564 KB	Output is correct
51	Correct	14 ms	9768 KB	Output is correct
52	Correct	17 ms	9844 KB	Output is correct
53	Correct	20 ms	10028 KB	Output is correct
54	Correct	23 ms	10104 KB	Output is correct
55	Correct	19 ms	10104 KB	Output is correct
56	Correct	18 ms	10104 KB	Output is correct
57	Correct	32 ms	10144 KB	Output is correct
58	Correct	27 ms	10164 KB	Output is correct
59	Correct	25 ms	10208 KB	Output is correct
60	Correct	26 ms	10284 KB	Output is correct
61	Correct	19 ms	10360 KB	Output is correct
62	Correct	22 ms	10548 KB	Output is correct
63	Correct	18 ms	10556 KB	Output is correct
64	Correct	21 ms	10556 KB	Output is correct
65	Correct	17 ms	10556 KB	Output is correct
66	Correct	22 ms	10556 KB	Output is correct
67	Correct	21 ms	10608 KB	Output is correct
68	Correct	16 ms	10668 KB	Output is correct
69	Correct	20 ms	10972 KB	Output is correct
70	Correct	16 ms	10972 KB	Output is correct
71	Correct	17 ms	10972 KB	Output is correct
72	Correct	24 ms	10996 KB	Output is correct
73	Correct	25 ms	10996 KB	Output is correct
74	Correct	16 ms	10996 KB	Output is correct
75	Correct	20 ms	11148 KB	Output is correct
76	Correct	17 ms	11256 KB	Output is correct
77	Correct	19 ms	11256 KB	Output is correct
78	Correct	16 ms	11256 KB	Output is correct
79	Correct	18 ms	11256 KB	Output is correct
80	Correct	21 ms	11256 KB	Output is correct
81	Correct	18 ms	11472 KB	Output is correct
82	Correct	16 ms	11504 KB	Output is correct
83	Correct	19 ms	11660 KB	Output is correct
84	Correct	17 ms	11660 KB	Output is correct
85	Correct	17 ms	11660 KB	Output is correct
86	Correct	17 ms	11660 KB	Output is correct
87	Correct	43 ms	12892 KB	Output is correct
88	Correct	136 ms	16924 KB	Output is correct
89	Correct	710 ms	30600 KB	Output is correct
90	Correct	620 ms	32748 KB	Output is correct
91	Correct	636 ms	34824 KB	Output is correct
92	Correct	332 ms	39668 KB	Output is correct
93	Correct	341 ms	41960 KB	Output is correct
94	Correct	327 ms	44120 KB	Output is correct
95	Runtime error	375 ms	77856 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
96	Halted	0 ms	0 KB	-

답안 #50554

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 9.0 / 9.0

Subtask #3 0 / 84.0

Subtask #1
7.0 / 7.0

Subtask #2
9.0 / 9.0

Subtask #3
0 / 84.0