Submission #114005

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
114005	2019-05-29T14:22:32 Z	shayan_p	Construction of Highway (JOI18_construction)	C++14	16 / 100	2000 ms	20164 KB

construction

// High above the clouds there is a rainbow...

#include<bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int maxn=1e5+10,SQ=100;

int a[maxn],fn[maxn],par[maxn],state[maxn],arr[maxn],A[maxn],B[maxn],C;
vector<int>v[maxn];

pii p[SQ+10];

void add(int pos,int x){
    for(pos=pos+3;pos<maxn;pos+=(pos & -pos))
	fn[pos]+=x;
}
int ask(int pos){
    int ans=0;
    for(pos=pos+3;pos>0;pos-=(pos & -pos))
	ans+=fn[pos];
    return ans;
}

int sp[20][maxn],h[maxn];

void dfs(int u){
    sp[0][u]=par[u];
    if(par[u]!=-1) h[u]=h[par[u]]+1;
    
    for(int i=1;i<20;i++){
	sp[i][u]=sp[i-1][u];
	if(sp[i][u]!=-1) sp[i][u]=sp[i-1][sp[i-1][u]];
    }
    for(int y:v[u]){
	dfs(y);
    }
}
int lca(int a,int b){
    if(h[a]<h[b]) swap(a,b);
    for(int i=19;i>=0;i--){
	if(sp[i][a]!=-1 && h[sp[i][a]]>=h[b])
	    a=sp[i][a];
    }
    if(a==b) return a;
    for(int i=19;i>=0;i--){
	if(sp[i][a]!=sp[i][b]) a=sp[i][a],b=sp[i][b];
    }
    return par[a];
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int n;cin>>n;
    for(int i=0;i<n;i++){
	cin>>a[i];
	arr[i]=a[i];
    }
    sort(arr,arr+n);
    C=unique(arr,arr+n)-arr;
    for(int i=0;i<n;i++){
	a[i]=lower_bound(arr,arr+C,a[i])-arr;
    }

    par[0]=-1;
    for(int i=0;i<n-1;i++){
	cin>>A[i]>>B[i];
	par[--B[i]]=--A[i];
	v[A[i]].PB(B[i]);
    }
    
    dfs(0);
    
    for(int l=0;l<n-1;l+=SQ){
	int r=min(n-1,l+SQ);
	++C;
	for(int i=l;i<r;i++){
	    ll ans=0;
	    int x=A[i],lst=x;
	    state[B[i]]=C;
	    while(x>=0 && state[x]!=C){
		state[x]=C;
		ans+=ask(a[x]-1);
		add(a[x],1);
		lst=x=par[x];
	    }
	    int bh=-1,SZ=0;
	    for(int j=i-1;j>=l;j--){
		int hh=h[lca(A[i],B[j])];
		if(bh<hh) p[SZ++]={hh-bh,a[B[j]]}, bh=hh;
	    }
	    for(int j=SZ-1;j>=0;j--){
		ans+= 1ll*p[j].F * ask(p[j].S-1);
		add(p[j].S,p[j].F);
	    }
	    x=A[i];
	    while(x!=lst){
		add(a[x],-1);
		x=par[x];
	    }
	    for(int j=0;j<SZ;j++){
		add(p[j].S,-p[j].F);
	    }
	    cout<<ans<<"\n";
	}
	++C;
	for(int i=r-1;i>=l;i--){
	    int x=B[i];
	    while(x>=0 && state[x]!=C){
		state[x]=C;
		a[x]=a[B[i]];
		x=par[x];
	    }
	}
    }
    return 0;
}
// Deathly mistakes:
//  * Read the problem curfully.
//  * Check maxn.
//  * Overflows.

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2816 KB	Output is correct
2	Correct	5 ms	2816 KB	Output is correct
3	Correct	5 ms	2816 KB	Output is correct
4	Correct	6 ms	2944 KB	Output is correct
5	Correct	7 ms	2944 KB	Output is correct
6	Correct	7 ms	2944 KB	Output is correct
7	Correct	6 ms	2944 KB	Output is correct
8	Correct	6 ms	2916 KB	Output is correct
9	Correct	6 ms	2944 KB	Output is correct
10	Correct	6 ms	2944 KB	Output is correct
11	Correct	5 ms	2944 KB	Output is correct
12	Correct	5 ms	2944 KB	Output is correct
13	Correct	5 ms	2944 KB	Output is correct
14	Correct	7 ms	2944 KB	Output is correct
15	Correct	7 ms	2996 KB	Output is correct
16	Correct	7 ms	2944 KB	Output is correct
17	Correct	6 ms	2944 KB	Output is correct
18	Correct	7 ms	2944 KB	Output is correct
19	Correct	6 ms	2944 KB	Output is correct
20	Correct	6 ms	2944 KB	Output is correct
21	Correct	6 ms	2860 KB	Output is correct
22	Correct	7 ms	2944 KB	Output is correct
23	Correct	7 ms	2944 KB	Output is correct
24	Correct	7 ms	2944 KB	Output is correct
25	Correct	6 ms	2944 KB	Output is correct
26	Correct	8 ms	2944 KB	Output is correct
27	Correct	5 ms	2944 KB	Output is correct
28	Correct	6 ms	2944 KB	Output is correct
29	Correct	6 ms	2944 KB	Output is correct
30	Correct	7 ms	2944 KB	Output is correct
31	Correct	7 ms	2944 KB	Output is correct
32	Correct	6 ms	2944 KB	Output is correct
33	Correct	6 ms	2944 KB	Output is correct
34	Correct	6 ms	2944 KB	Output is correct
35	Correct	20 ms	2936 KB	Output is correct
36	Correct	6 ms	2944 KB	Output is correct
37	Correct	6 ms	2944 KB	Output is correct
38	Correct	6 ms	2816 KB	Output is correct
39	Correct	6 ms	2944 KB	Output is correct
40	Correct	8 ms	2944 KB	Output is correct
41	Correct	6 ms	2944 KB	Output is correct
42	Correct	6 ms	2816 KB	Output is correct
43	Correct	7 ms	2944 KB	Output is correct
44	Correct	6 ms	2944 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2816 KB	Output is correct
2	Correct	5 ms	2816 KB	Output is correct
3	Correct	5 ms	2816 KB	Output is correct
4	Correct	6 ms	2944 KB	Output is correct
5	Correct	7 ms	2944 KB	Output is correct
6	Correct	7 ms	2944 KB	Output is correct
7	Correct	6 ms	2944 KB	Output is correct
8	Correct	6 ms	2916 KB	Output is correct
9	Correct	6 ms	2944 KB	Output is correct
10	Correct	6 ms	2944 KB	Output is correct
11	Correct	5 ms	2944 KB	Output is correct
12	Correct	5 ms	2944 KB	Output is correct
13	Correct	5 ms	2944 KB	Output is correct
14	Correct	7 ms	2944 KB	Output is correct
15	Correct	7 ms	2996 KB	Output is correct
16	Correct	7 ms	2944 KB	Output is correct
17	Correct	6 ms	2944 KB	Output is correct
18	Correct	7 ms	2944 KB	Output is correct
19	Correct	6 ms	2944 KB	Output is correct
20	Correct	6 ms	2944 KB	Output is correct
21	Correct	6 ms	2860 KB	Output is correct
22	Correct	7 ms	2944 KB	Output is correct
23	Correct	7 ms	2944 KB	Output is correct
24	Correct	7 ms	2944 KB	Output is correct
25	Correct	6 ms	2944 KB	Output is correct
26	Correct	8 ms	2944 KB	Output is correct
27	Correct	5 ms	2944 KB	Output is correct
28	Correct	6 ms	2944 KB	Output is correct
29	Correct	6 ms	2944 KB	Output is correct
30	Correct	7 ms	2944 KB	Output is correct
31	Correct	7 ms	2944 KB	Output is correct
32	Correct	6 ms	2944 KB	Output is correct
33	Correct	6 ms	2944 KB	Output is correct
34	Correct	6 ms	2944 KB	Output is correct
35	Correct	20 ms	2936 KB	Output is correct
36	Correct	6 ms	2944 KB	Output is correct
37	Correct	6 ms	2944 KB	Output is correct
38	Correct	6 ms	2816 KB	Output is correct
39	Correct	6 ms	2944 KB	Output is correct
40	Correct	8 ms	2944 KB	Output is correct
41	Correct	6 ms	2944 KB	Output is correct
42	Correct	6 ms	2816 KB	Output is correct
43	Correct	7 ms	2944 KB	Output is correct
44	Correct	6 ms	2944 KB	Output is correct
45	Correct	9 ms	2944 KB	Output is correct
46	Correct	33 ms	3328 KB	Output is correct
47	Correct	34 ms	3328 KB	Output is correct
48	Correct	33 ms	3328 KB	Output is correct
49	Correct	21 ms	3584 KB	Output is correct
50	Correct	21 ms	3456 KB	Output is correct
51	Correct	22 ms	3676 KB	Output is correct
52	Correct	21 ms	3448 KB	Output is correct
53	Correct	22 ms	3444 KB	Output is correct
54	Correct	22 ms	3476 KB	Output is correct
55	Correct	22 ms	3448 KB	Output is correct
56	Correct	26 ms	3456 KB	Output is correct
57	Correct	36 ms	3328 KB	Output is correct
58	Correct	35 ms	3392 KB	Output is correct
59	Correct	33 ms	3448 KB	Output is correct
60	Correct	35 ms	3392 KB	Output is correct
61	Correct	29 ms	3456 KB	Output is correct
62	Correct	30 ms	3456 KB	Output is correct
63	Correct	30 ms	3456 KB	Output is correct
64	Correct	33 ms	3328 KB	Output is correct
65	Correct	34 ms	3384 KB	Output is correct
66	Correct	33 ms	3328 KB	Output is correct
67	Correct	32 ms	3328 KB	Output is correct
68	Correct	24 ms	3584 KB	Output is correct
69	Correct	24 ms	3456 KB	Output is correct
70	Correct	23 ms	3456 KB	Output is correct
71	Correct	26 ms	3456 KB	Output is correct
72	Correct	33 ms	3328 KB	Output is correct
73	Correct	31 ms	3328 KB	Output is correct
74	Correct	28 ms	3456 KB	Output is correct
75	Correct	25 ms	3328 KB	Output is correct
76	Correct	30 ms	3328 KB	Output is correct
77	Correct	24 ms	3328 KB	Output is correct
78	Correct	24 ms	3328 KB	Output is correct
79	Correct	24 ms	3328 KB	Output is correct
80	Correct	23 ms	3328 KB	Output is correct
81	Correct	33 ms	3328 KB	Output is correct
82	Correct	35 ms	3456 KB	Output is correct
83	Correct	34 ms	3436 KB	Output is correct
84	Correct	35 ms	3412 KB	Output is correct
85	Correct	35 ms	3328 KB	Output is correct
86	Correct	33 ms	3328 KB	Output is correct

Subtask #3
0 / 84.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2816 KB	Output is correct
2	Correct	5 ms	2816 KB	Output is correct
3	Correct	5 ms	2816 KB	Output is correct
4	Correct	6 ms	2944 KB	Output is correct
5	Correct	7 ms	2944 KB	Output is correct
6	Correct	7 ms	2944 KB	Output is correct
7	Correct	6 ms	2944 KB	Output is correct
8	Correct	6 ms	2916 KB	Output is correct
9	Correct	6 ms	2944 KB	Output is correct
10	Correct	6 ms	2944 KB	Output is correct
11	Correct	5 ms	2944 KB	Output is correct
12	Correct	5 ms	2944 KB	Output is correct
13	Correct	5 ms	2944 KB	Output is correct
14	Correct	7 ms	2944 KB	Output is correct
15	Correct	7 ms	2996 KB	Output is correct
16	Correct	7 ms	2944 KB	Output is correct
17	Correct	6 ms	2944 KB	Output is correct
18	Correct	7 ms	2944 KB	Output is correct
19	Correct	6 ms	2944 KB	Output is correct
20	Correct	6 ms	2944 KB	Output is correct
21	Correct	6 ms	2860 KB	Output is correct
22	Correct	7 ms	2944 KB	Output is correct
23	Correct	7 ms	2944 KB	Output is correct
24	Correct	7 ms	2944 KB	Output is correct
25	Correct	6 ms	2944 KB	Output is correct
26	Correct	8 ms	2944 KB	Output is correct
27	Correct	5 ms	2944 KB	Output is correct
28	Correct	6 ms	2944 KB	Output is correct
29	Correct	6 ms	2944 KB	Output is correct
30	Correct	7 ms	2944 KB	Output is correct
31	Correct	7 ms	2944 KB	Output is correct
32	Correct	6 ms	2944 KB	Output is correct
33	Correct	6 ms	2944 KB	Output is correct
34	Correct	6 ms	2944 KB	Output is correct
35	Correct	20 ms	2936 KB	Output is correct
36	Correct	6 ms	2944 KB	Output is correct
37	Correct	6 ms	2944 KB	Output is correct
38	Correct	6 ms	2816 KB	Output is correct
39	Correct	6 ms	2944 KB	Output is correct
40	Correct	8 ms	2944 KB	Output is correct
41	Correct	6 ms	2944 KB	Output is correct
42	Correct	6 ms	2816 KB	Output is correct
43	Correct	7 ms	2944 KB	Output is correct
44	Correct	6 ms	2944 KB	Output is correct
45	Correct	9 ms	2944 KB	Output is correct
46	Correct	33 ms	3328 KB	Output is correct
47	Correct	34 ms	3328 KB	Output is correct
48	Correct	33 ms	3328 KB	Output is correct
49	Correct	21 ms	3584 KB	Output is correct
50	Correct	21 ms	3456 KB	Output is correct
51	Correct	22 ms	3676 KB	Output is correct
52	Correct	21 ms	3448 KB	Output is correct
53	Correct	22 ms	3444 KB	Output is correct
54	Correct	22 ms	3476 KB	Output is correct
55	Correct	22 ms	3448 KB	Output is correct
56	Correct	26 ms	3456 KB	Output is correct
57	Correct	36 ms	3328 KB	Output is correct
58	Correct	35 ms	3392 KB	Output is correct
59	Correct	33 ms	3448 KB	Output is correct
60	Correct	35 ms	3392 KB	Output is correct
61	Correct	29 ms	3456 KB	Output is correct
62	Correct	30 ms	3456 KB	Output is correct
63	Correct	30 ms	3456 KB	Output is correct
64	Correct	33 ms	3328 KB	Output is correct
65	Correct	34 ms	3384 KB	Output is correct
66	Correct	33 ms	3328 KB	Output is correct
67	Correct	32 ms	3328 KB	Output is correct
68	Correct	24 ms	3584 KB	Output is correct
69	Correct	24 ms	3456 KB	Output is correct
70	Correct	23 ms	3456 KB	Output is correct
71	Correct	26 ms	3456 KB	Output is correct
72	Correct	33 ms	3328 KB	Output is correct
73	Correct	31 ms	3328 KB	Output is correct
74	Correct	28 ms	3456 KB	Output is correct
75	Correct	25 ms	3328 KB	Output is correct
76	Correct	30 ms	3328 KB	Output is correct
77	Correct	24 ms	3328 KB	Output is correct
78	Correct	24 ms	3328 KB	Output is correct
79	Correct	24 ms	3328 KB	Output is correct
80	Correct	23 ms	3328 KB	Output is correct
81	Correct	33 ms	3328 KB	Output is correct
82	Correct	35 ms	3456 KB	Output is correct
83	Correct	34 ms	3436 KB	Output is correct
84	Correct	35 ms	3412 KB	Output is correct
85	Correct	35 ms	3328 KB	Output is correct
86	Correct	33 ms	3328 KB	Output is correct
87	Correct	94 ms	4164 KB	Output is correct
88	Correct	350 ms	6768 KB	Output is correct
89	Correct	1792 ms	15660 KB	Output is correct
90	Correct	1696 ms	15608 KB	Output is correct
91	Correct	1597 ms	15640 KB	Output is correct
92	Execution timed out	2019 ms	20164 KB	Time limit exceeded
93	Halted	0 ms	0 KB	-

Submission #114005

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