oj.uz

Submission #114011

# Submission time Handle Problem Language Result Execution time Memory
114011 2019-05-29T14:34:52 Z shayan_p Construction of Highway (JOI18_construction) C++14
100 / 100
 1611 ms 31080 KB 
// 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=500;

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][2*maxn],h[maxn],start[maxn];
vector<int>vec;

void dfs(int u){
    if(par[u]!=-1) h[u]=h[par[u]]+1;  
    start[u]=sz(vec), vec.PB(u);
    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);
    }
    if(par[u]!=-1) vec.PB(par[u]);
}
void prep(){
    for(int i=0;i<sz(vec);i++){
	sp[0][i]=h[vec[i]];
    }
    for(int i=1;i<20;i++){
	for(int j=0;j<sz(vec);j++){
	    sp[i][j]=sp[i-1][j];
	    if(j+(1<<(i-1))<sz(vec)) sp[i][j]=min(sp[i][j],sp[i-1][j+(1<<(i-1))]);
	}
    }
}
int lca(int a,int b){
    a=start[a], b=start[b];
    if(a>b) swap(a,b);
    int id=31-__builtin_clz(b-a+1);
    return min(sp[id][a],sp[id][b+1-(1<<id)]);
}

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);
    prep();
    
    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=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 2944 KB Output is correct
2 Correct 4 ms 2944 KB Output is correct
3 Correct 4 ms 2944 KB Output is correct
4 Correct 4 ms 2944 KB Output is correct
5 Correct 5 ms 2944 KB Output is correct
6 Correct 5 ms 2944 KB Output is correct
7 Correct 5 ms 2944 KB Output is correct
8 Correct 8 ms 2944 KB Output is correct
9 Correct 5 ms 3072 KB Output is correct
10 Correct 13 ms 3072 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 5 ms 2944 KB Output is correct
15 Correct 6 ms 2944 KB Output is correct
16 Correct 5 ms 2944 KB Output is correct
17 Correct 5 ms 2944 KB Output is correct
18 Correct 5 ms 2944 KB Output is correct
19 Correct 5 ms 3072 KB Output is correct
20 Correct 5 ms 3072 KB Output is correct
21 Correct 5 ms 3072 KB Output is correct
22 Correct 5 ms 2944 KB Output is correct
23 Correct 5 ms 2944 KB Output is correct
24 Correct 5 ms 2944 KB Output is correct
25 Correct 5 ms 2944 KB Output is correct
26 Correct 5 ms 2944 KB Output is correct
27 Correct 4 ms 2944 KB Output is correct
28 Correct 5 ms 2944 KB Output is correct
29 Correct 5 ms 3072 KB Output is correct
30 Correct 5 ms 2944 KB Output is correct
31 Correct 6 ms 2944 KB Output is correct
32 Correct 6 ms 2944 KB Output is correct
33 Correct 5 ms 2944 KB Output is correct
34 Correct 5 ms 2944 KB Output is correct
35 Correct 5 ms 2944 KB Output is correct
36 Correct 4 ms 2944 KB Output is correct
37 Correct 4 ms 2944 KB Output is correct
38 Correct 5 ms 2944 KB Output is correct
39 Correct 5 ms 2944 KB Output is correct
40 Correct 5 ms 2944 KB Output is correct
41 Correct 5 ms 2944 KB Output is correct
42 Correct 4 ms 2944 KB Output is correct
43 Correct 4 ms 2944 KB Output is correct
44 Correct 5 ms 2944 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2944 KB Output is correct
2 Correct 4 ms 2944 KB Output is correct
3 Correct 4 ms 2944 KB Output is correct
4 Correct 4 ms 2944 KB Output is correct
5 Correct 5 ms 2944 KB Output is correct
6 Correct 5 ms 2944 KB Output is correct
7 Correct 5 ms 2944 KB Output is correct
8 Correct 8 ms 2944 KB Output is correct
9 Correct 5 ms 3072 KB Output is correct
10 Correct 13 ms 3072 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 5 ms 2944 KB Output is correct
15 Correct 6 ms 2944 KB Output is correct
16 Correct 5 ms 2944 KB Output is correct
17 Correct 5 ms 2944 KB Output is correct
18 Correct 5 ms 2944 KB Output is correct
19 Correct 5 ms 3072 KB Output is correct
20 Correct 5 ms 3072 KB Output is correct
21 Correct 5 ms 3072 KB Output is correct
22 Correct 5 ms 2944 KB Output is correct
23 Correct 5 ms 2944 KB Output is correct
24 Correct 5 ms 2944 KB Output is correct
25 Correct 5 ms 2944 KB Output is correct
26 Correct 5 ms 2944 KB Output is correct
27 Correct 4 ms 2944 KB Output is correct
28 Correct 5 ms 2944 KB Output is correct
29 Correct 5 ms 3072 KB Output is correct
30 Correct 5 ms 2944 KB Output is correct
31 Correct 6 ms 2944 KB Output is correct
32 Correct 6 ms 2944 KB Output is correct
33 Correct 5 ms 2944 KB Output is correct
34 Correct 5 ms 2944 KB Output is correct
35 Correct 5 ms 2944 KB Output is correct
36 Correct 4 ms 2944 KB Output is correct
37 Correct 4 ms 2944 KB Output is correct
38 Correct 5 ms 2944 KB Output is correct
39 Correct 5 ms 2944 KB Output is correct
40 Correct 5 ms 2944 KB Output is correct
41 Correct 5 ms 2944 KB Output is correct
42 Correct 4 ms 2944 KB Output is correct
43 Correct 4 ms 2944 KB Output is correct
44 Correct 5 ms 2944 KB Output is correct
45 Correct 6 ms 3072 KB Output is correct
46 Correct 14 ms 3712 KB Output is correct
47 Correct 15 ms 3840 KB Output is correct
48 Correct 15 ms 3712 KB Output is correct
49 Correct 13 ms 3968 KB Output is correct
50 Correct 12 ms 3968 KB Output is correct
51 Correct 11 ms 3968 KB Output is correct
52 Correct 12 ms 3840 KB Output is correct
53 Correct 12 ms 3840 KB Output is correct
54 Correct 12 ms 3840 KB Output is correct
55 Correct 12 ms 3840 KB Output is correct
56 Correct 11 ms 3840 KB Output is correct
57 Correct 14 ms 3840 KB Output is correct
58 Correct 15 ms 3712 KB Output is correct
59 Correct 15 ms 3712 KB Output is correct
60 Correct 15 ms 3840 KB Output is correct
61 Correct 12 ms 3884 KB Output is correct
62 Correct 12 ms 3840 KB Output is correct
63 Correct 12 ms 3840 KB Output is correct
64 Correct 14 ms 3712 KB Output is correct
65 Correct 16 ms 3712 KB Output is correct
66 Correct 15 ms 3840 KB Output is correct
67 Correct 15 ms 3832 KB Output is correct
68 Correct 11 ms 3968 KB Output is correct
69 Correct 12 ms 3840 KB Output is correct
70 Correct 11 ms 3840 KB Output is correct
71 Correct 12 ms 3840 KB Output is correct
72 Correct 14 ms 3712 KB Output is correct
73 Correct 14 ms 3712 KB Output is correct
74 Correct 12 ms 3840 KB Output is correct
75 Correct 11 ms 3840 KB Output is correct
76 Correct 11 ms 3840 KB Output is correct
77 Correct 11 ms 3840 KB Output is correct
78 Correct 11 ms 3840 KB Output is correct
79 Correct 11 ms 3840 KB Output is correct
80 Correct 11 ms 3712 KB Output is correct
81 Correct 12 ms 3840 KB Output is correct
82 Correct 13 ms 3840 KB Output is correct
83 Correct 12 ms 3712 KB Output is correct
84 Correct 12 ms 3840 KB Output is correct
85 Correct 13 ms 3712 KB Output is correct
86 Correct 12 ms 3712 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2944 KB Output is correct
2 Correct 4 ms 2944 KB Output is correct
3 Correct 4 ms 2944 KB Output is correct
4 Correct 4 ms 2944 KB Output is correct
5 Correct 5 ms 2944 KB Output is correct
6 Correct 5 ms 2944 KB Output is correct
7 Correct 5 ms 2944 KB Output is correct
8 Correct 8 ms 2944 KB Output is correct
9 Correct 5 ms 3072 KB Output is correct
10 Correct 13 ms 3072 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 5 ms 2944 KB Output is correct
15 Correct 6 ms 2944 KB Output is correct
16 Correct 5 ms 2944 KB Output is correct
17 Correct 5 ms 2944 KB Output is correct
18 Correct 5 ms 2944 KB Output is correct
19 Correct 5 ms 3072 KB Output is correct
20 Correct 5 ms 3072 KB Output is correct
21 Correct 5 ms 3072 KB Output is correct
22 Correct 5 ms 2944 KB Output is correct
23 Correct 5 ms 2944 KB Output is correct
24 Correct 5 ms 2944 KB Output is correct
25 Correct 5 ms 2944 KB Output is correct
26 Correct 5 ms 2944 KB Output is correct
27 Correct 4 ms 2944 KB Output is correct
28 Correct 5 ms 2944 KB Output is correct
29 Correct 5 ms 3072 KB Output is correct
30 Correct 5 ms 2944 KB Output is correct
31 Correct 6 ms 2944 KB Output is correct
32 Correct 6 ms 2944 KB Output is correct
33 Correct 5 ms 2944 KB Output is correct
34 Correct 5 ms 2944 KB Output is correct
35 Correct 5 ms 2944 KB Output is correct
36 Correct 4 ms 2944 KB Output is correct
37 Correct 4 ms 2944 KB Output is correct
38 Correct 5 ms 2944 KB Output is correct
39 Correct 5 ms 2944 KB Output is correct
40 Correct 5 ms 2944 KB Output is correct
41 Correct 5 ms 2944 KB Output is correct
42 Correct 4 ms 2944 KB Output is correct
43 Correct 4 ms 2944 KB Output is correct
44 Correct 5 ms 2944 KB Output is correct
45 Correct 6 ms 3072 KB Output is correct
46 Correct 14 ms 3712 KB Output is correct
47 Correct 15 ms 3840 KB Output is correct
48 Correct 15 ms 3712 KB Output is correct
49 Correct 13 ms 3968 KB Output is correct
50 Correct 12 ms 3968 KB Output is correct
51 Correct 11 ms 3968 KB Output is correct
52 Correct 12 ms 3840 KB Output is correct
53 Correct 12 ms 3840 KB Output is correct
54 Correct 12 ms 3840 KB Output is correct
55 Correct 12 ms 3840 KB Output is correct
56 Correct 11 ms 3840 KB Output is correct
57 Correct 14 ms 3840 KB Output is correct
58 Correct 15 ms 3712 KB Output is correct
59 Correct 15 ms 3712 KB Output is correct
60 Correct 15 ms 3840 KB Output is correct
61 Correct 12 ms 3884 KB Output is correct
62 Correct 12 ms 3840 KB Output is correct
63 Correct 12 ms 3840 KB Output is correct
64 Correct 14 ms 3712 KB Output is correct
65 Correct 16 ms 3712 KB Output is correct
66 Correct 15 ms 3840 KB Output is correct
67 Correct 15 ms 3832 KB Output is correct
68 Correct 11 ms 3968 KB Output is correct
69 Correct 12 ms 3840 KB Output is correct
70 Correct 11 ms 3840 KB Output is correct
71 Correct 12 ms 3840 KB Output is correct
72 Correct 14 ms 3712 KB Output is correct
73 Correct 14 ms 3712 KB Output is correct
74 Correct 12 ms 3840 KB Output is correct
75 Correct 11 ms 3840 KB Output is correct
76 Correct 11 ms 3840 KB Output is correct
77 Correct 11 ms 3840 KB Output is correct
78 Correct 11 ms 3840 KB Output is correct
79 Correct 11 ms 3840 KB Output is correct
80 Correct 11 ms 3712 KB Output is correct
81 Correct 12 ms 3840 KB Output is correct
82 Correct 13 ms 3840 KB Output is correct
83 Correct 12 ms 3712 KB Output is correct
84 Correct 12 ms 3840 KB Output is correct
85 Correct 13 ms 3712 KB Output is correct
86 Correct 12 ms 3712 KB Output is correct
87 Correct 36 ms 5248 KB Output is correct
88 Correct 134 ms 9704 KB Output is correct
89 Correct 590 ms 24820 KB Output is correct
90 Correct 598 ms 24880 KB Output is correct
91 Correct 586 ms 24816 KB Output is correct
92 Correct 1378 ms 30952 KB Output is correct
93 Correct 1360 ms 31080 KB Output is correct
94 Correct 1392 ms 31080 KB Output is correct
95 Correct 813 ms 27060 KB Output is correct
96 Correct 836 ms 26992 KB Output is correct
97 Correct 847 ms 26992 KB Output is correct
98 Correct 826 ms 26964 KB Output is correct
99 Correct 844 ms 27244 KB Output is correct
100 Correct 606 ms 25356 KB Output is correct
101 Correct 642 ms 25320 KB Output is correct
102 Correct 637 ms 25212 KB Output is correct
103 Correct 624 ms 25160 KB Output is correct
104 Correct 1142 ms 27116 KB Output is correct
105 Correct 1193 ms 27124 KB Output is correct
106 Correct 1157 ms 27120 KB Output is correct
107 Correct 586 ms 24428 KB Output is correct
108 Correct 583 ms 24396 KB Output is correct
109 Correct 596 ms 24556 KB Output is correct
110 Correct 1611 ms 30780 KB Output is correct
111 Correct 820 ms 26992 KB Output is correct
112 Correct 895 ms 26624 KB Output is correct
113 Correct 851 ms 26860 KB Output is correct
114 Correct 594 ms 25260 KB Output is correct
115 Correct 612 ms 24848 KB Output is correct
116 Correct 1200 ms 26900 KB Output is correct
117 Correct 534 ms 25836 KB Output is correct
118 Correct 448 ms 25544 KB Output is correct
119 Correct 400 ms 25228 KB Output is correct
120 Correct 528 ms 25468 KB Output is correct
121 Correct 444 ms 25200 KB Output is correct
122 Correct 396 ms 24944 KB Output is correct
123 Correct 1046 ms 25960 KB Output is correct
124 Correct 1028 ms 25828 KB Output is correct
125 Correct 1024 ms 25452 KB Output is correct
126 Correct 1122 ms 25712 KB Output is correct
127 Correct 1125 ms 25324 KB Output is correct
128 Correct 1050 ms 25068 KB Output is correct