답안 #49231 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49231	2018-05-24T00:36:29 Z	spencercompton	Construction of Highway (JOI18_construction)	C++17	100 / 100	942 ms	26772 KB

construction

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int l[200000];
int r[200000];
int p[200000];
int sub[200000];
int pri[200000];
int val[200000];
int par[200000];
void pull(int t){
	sub[t] = 1;
	if(l[t]!=-1){
		sub[t] += sub[l[t]];
		p[l[t]] = t;
	}
	if(r[t]!=-1){
		sub[t] += sub[r[t]];
		p[r[t]] = t;
	}
}
void push(int t){
	if(l[t]!=-1){
		val[l[t]] = val[t];
	}
	if(r[t]!=-1){
		val[r[t]] = val[t];
	}
}
int merge(int le, int ri){
	if(le==-1 && ri==-1){
		return -1;
	}
	if(le==-1){
		return ri;
	}
	if(ri==-1){
		return le;
	}
	push(le);
	push(ri);
	if(pri[le]>pri[ri]){
		r[le] = merge(r[le],ri);
		pull(le);
		return le;
	}
	else{
		l[ri] = merge(le,l[ri]);
		pull(ri);
		return ri;
	}
}
pair<int, int> split(int t, int k){
	if(t==-1){
		return make_pair(-1,-1);
	}
	push(t);
	int lsum = 0;
	if(l[t]!=-1){
		lsum = sub[l[t]];
	}
	if(lsum>=k){
		pair<int, int> ret = split(l[t],k);
		l[t] = ret.second;
		ret.second = t;
		pull(t);
		return ret;
	}
	else{
		pair<int, int> ret = split(r[t],k-lsum-1);
		r[t] = ret.first;
		ret.first = t;
		pull(t);
		return ret;
	}
}
pair<int, int> dfs(int now, int from){
	int ret = 0;
	if(from==-1 && l[now]!=-1){
		ret += sub[l[now]];
	}
	if(from!=-1 && r[now]==from){
		ret++;
		if(l[now]!=-1){
			ret += sub[l[now]];
		}
	}
	if(p[now]==-1){
		return make_pair(now,ret);
	}
	pair<int, int> get = dfs(p[now],now);
	get.second += ret;
	return get;
}
int first(int now){
	if(l[now]==-1){
		return now;
	}
	return first(l[now]);
}
void dfs2(int now){
	cout << "NOW " << now << endl;
	if(l[now]!=-1){
		cout << "LEFT " << now << " -> " << l[now] << endl;
		dfs2(l[now]);
	}
	if(r[now]!=-1){
		cout << "RIGHT " << now << " -> " << r[now] << endl;
		dfs2(r[now]);
	}
}
vector<pair<int, int> > compress(vector<pair<int, int> > a){
	vector<int> all;
	for(int i = 0; i<a.size(); i++){
		all.push_back(a[i].first);
	}
	sort(all.begin(),all.end());
	int p =1;
	map<int, int> m;
	for(int i = 0; i<a.size(); i++){
		if(i==0 || all[i]!=all[i-1]){
			m[all[i]] = p++;
		}
	}
	for(int i = 0; i<a.size(); i++){
		a[i].first = m[a[i].first];
	}
	return a;
}
class Fenwick{
	public:
		vector<ll> li;
		int n;
		Fenwick(int a){
			n = a;
			li.resize(n+5);
		}
		void add(int ind, ll val){
			for(;ind<n; ind+=(ind&(-ind))){
				li[ind] += val;
			}
		}
		ll get(int ind){
			ll ret = 0LL;
			for(;ind>0; ind-=(ind&(-ind))){
				ret += li[ind];
			}
			return ret;
		}

};
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	srand(11);
	int n;
	cin >> n;
	assert(n<=100000);
	for(int i = 0; i<n; i++){
		l[i] = -1;
		r[i] = -1;
		p[i] = -1;
		sub[i] = 1;
		pri[i] = rand();
		cin >> val[i];
		par[i] = -1;
	}
	for(int i = 0; i+1<n; i++){
		int a, b;
		cin >> a >> b;
		a--;
		b--;
		assert(a<100000 && b<100000);
		vector<pair<int, int> > li;
		//not including now
		int now = a;
		int set = val[b];
		pair<int, int> got = dfs(now,-1);
		int ind = got.second;
		int root = got.first;
		pair<int, int> both = split(root,ind+1);
		p[both.first] = -1;
		p[both.second] = -1;
		got = dfs(now,-1);
		ind = got.second;
		root = got.first;
		li.push_back(make_pair(val[got.first],1));
		while(true){
			got = dfs(now,-1);
			ind = got.second;
			root = got.first;
			int f = first(root);
			int all = val[root];
			if(par[f]==-1){
				//started from the bottom, now we here
				li.push_back(make_pair(all,ind));
				val[root] = set;
				now = f;
				break;
			}
			else{
				li.push_back(make_pair(all,ind));
				int nex = par[f];
				pair<int, int> got2 = dfs(nex,-1);
				int ind2 = got2.second;
				int root2 = got2.first;
				pair<int, int> both2 = split(root2,ind2+1);
				p[both2.first] = -1;
				p[both2.second] = -1;
				now = f;
				int nval = val[both2.first];
				val[merge(both2.first,root)] = nval;
			}
		}
		got = dfs(now,-1);
		root = got.first;
		par[b] = a;
		val[merge(root,b)] = set;
		li =compress(li);
		Fenwick fen = Fenwick(li.size());
		ll all = 0LL;
		ll ans = 0LL;
		for(int i = li.size()-1; i>=0; i--){
			ans += (all-fen.get(li[i].first))*(ll)li[i].second;
			fen.add(li[i].first,li[i].second);
			all += li[i].second;
		}
		assert(ans>=0LL);
		cout << ans << "\n";
	}
}

Compilation message

construction.cpp: In function 'std::vector<std::pair<int, int> > compress(std::vector<std::pair<int, int> >)':
construction.cpp:114:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i<a.size(); i++){
                 ~^~~~~~~~~
construction.cpp:120:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i<a.size(); i++){
                 ~^~~~~~~~~
construction.cpp:125:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i<a.size(); i++){
                 ~^~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	392 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	3 ms	672 KB	Output is correct
6	Correct	3 ms	672 KB	Output is correct
7	Correct	5 ms	672 KB	Output is correct
8	Correct	3 ms	672 KB	Output is correct
9	Correct	3 ms	672 KB	Output is correct
10	Correct	4 ms	672 KB	Output is correct
11	Correct	3 ms	672 KB	Output is correct
12	Correct	3 ms	672 KB	Output is correct
13	Correct	3 ms	672 KB	Output is correct
14	Correct	3 ms	672 KB	Output is correct
15	Correct	5 ms	672 KB	Output is correct
16	Correct	4 ms	672 KB	Output is correct
17	Correct	4 ms	672 KB	Output is correct
18	Correct	4 ms	672 KB	Output is correct
19	Correct	3 ms	672 KB	Output is correct
20	Correct	3 ms	672 KB	Output is correct
21	Correct	3 ms	672 KB	Output is correct
22	Correct	4 ms	672 KB	Output is correct
23	Correct	13 ms	672 KB	Output is correct
24	Correct	4 ms	672 KB	Output is correct
25	Correct	3 ms	672 KB	Output is correct
26	Correct	3 ms	672 KB	Output is correct
27	Correct	3 ms	672 KB	Output is correct
28	Correct	3 ms	672 KB	Output is correct
29	Correct	3 ms	672 KB	Output is correct
30	Correct	3 ms	672 KB	Output is correct
31	Correct	4 ms	672 KB	Output is correct
32	Correct	2 ms	672 KB	Output is correct
33	Correct	3 ms	672 KB	Output is correct
34	Correct	3 ms	672 KB	Output is correct
35	Correct	5 ms	672 KB	Output is correct
36	Correct	4 ms	672 KB	Output is correct
37	Correct	4 ms	672 KB	Output is correct
38	Correct	3 ms	672 KB	Output is correct
39	Correct	3 ms	672 KB	Output is correct
40	Correct	3 ms	672 KB	Output is correct
41	Correct	3 ms	672 KB	Output is correct
42	Correct	4 ms	672 KB	Output is correct
43	Correct	4 ms	672 KB	Output is correct
44	Correct	3 ms	672 KB	Output is correct

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	392 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	3 ms	672 KB	Output is correct
6	Correct	3 ms	672 KB	Output is correct
7	Correct	5 ms	672 KB	Output is correct
8	Correct	3 ms	672 KB	Output is correct
9	Correct	3 ms	672 KB	Output is correct
10	Correct	4 ms	672 KB	Output is correct
11	Correct	3 ms	672 KB	Output is correct
12	Correct	3 ms	672 KB	Output is correct
13	Correct	3 ms	672 KB	Output is correct
14	Correct	3 ms	672 KB	Output is correct
15	Correct	5 ms	672 KB	Output is correct
16	Correct	4 ms	672 KB	Output is correct
17	Correct	4 ms	672 KB	Output is correct
18	Correct	4 ms	672 KB	Output is correct
19	Correct	3 ms	672 KB	Output is correct
20	Correct	3 ms	672 KB	Output is correct
21	Correct	3 ms	672 KB	Output is correct
22	Correct	4 ms	672 KB	Output is correct
23	Correct	13 ms	672 KB	Output is correct
24	Correct	4 ms	672 KB	Output is correct
25	Correct	3 ms	672 KB	Output is correct
26	Correct	3 ms	672 KB	Output is correct
27	Correct	3 ms	672 KB	Output is correct
28	Correct	3 ms	672 KB	Output is correct
29	Correct	3 ms	672 KB	Output is correct
30	Correct	3 ms	672 KB	Output is correct
31	Correct	4 ms	672 KB	Output is correct
32	Correct	2 ms	672 KB	Output is correct
33	Correct	3 ms	672 KB	Output is correct
34	Correct	3 ms	672 KB	Output is correct
35	Correct	5 ms	672 KB	Output is correct
36	Correct	4 ms	672 KB	Output is correct
37	Correct	4 ms	672 KB	Output is correct
38	Correct	3 ms	672 KB	Output is correct
39	Correct	3 ms	672 KB	Output is correct
40	Correct	3 ms	672 KB	Output is correct
41	Correct	3 ms	672 KB	Output is correct
42	Correct	4 ms	672 KB	Output is correct
43	Correct	4 ms	672 KB	Output is correct
44	Correct	3 ms	672 KB	Output is correct
45	Correct	5 ms	672 KB	Output is correct
46	Correct	13 ms	796 KB	Output is correct
47	Correct	13 ms	796 KB	Output is correct
48	Correct	14 ms	796 KB	Output is correct
49	Correct	7 ms	796 KB	Output is correct
50	Correct	14 ms	824 KB	Output is correct
51	Correct	7 ms	824 KB	Output is correct
52	Correct	10 ms	940 KB	Output is correct
53	Correct	8 ms	940 KB	Output is correct
54	Correct	8 ms	940 KB	Output is correct
55	Correct	10 ms	940 KB	Output is correct
56	Correct	8 ms	940 KB	Output is correct
57	Correct	16 ms	940 KB	Output is correct
58	Correct	18 ms	940 KB	Output is correct
59	Correct	18 ms	940 KB	Output is correct
60	Correct	25 ms	940 KB	Output is correct
61	Correct	18 ms	940 KB	Output is correct
62	Correct	11 ms	940 KB	Output is correct
63	Correct	14 ms	940 KB	Output is correct
64	Correct	10 ms	952 KB	Output is correct
65	Correct	14 ms	956 KB	Output is correct
66	Correct	12 ms	956 KB	Output is correct
67	Correct	19 ms	956 KB	Output is correct
68	Correct	8 ms	956 KB	Output is correct
69	Correct	8 ms	1000 KB	Output is correct
70	Correct	8 ms	1000 KB	Output is correct
71	Correct	7 ms	1000 KB	Output is correct
72	Correct	16 ms	1000 KB	Output is correct
73	Correct	18 ms	1000 KB	Output is correct
74	Correct	14 ms	1000 KB	Output is correct
75	Correct	11 ms	1000 KB	Output is correct
76	Correct	8 ms	1000 KB	Output is correct
77	Correct	8 ms	1000 KB	Output is correct
78	Correct	7 ms	1000 KB	Output is correct
79	Correct	7 ms	1000 KB	Output is correct
80	Correct	9 ms	1000 KB	Output is correct
81	Correct	9 ms	1000 KB	Output is correct
82	Correct	9 ms	1000 KB	Output is correct
83	Correct	15 ms	1000 KB	Output is correct
84	Correct	11 ms	1000 KB	Output is correct
85	Correct	12 ms	1000 KB	Output is correct
86	Correct	9 ms	1000 KB	Output is correct

Subtask #3
84.0 / 84.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	392 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	3 ms	672 KB	Output is correct
6	Correct	3 ms	672 KB	Output is correct
7	Correct	5 ms	672 KB	Output is correct
8	Correct	3 ms	672 KB	Output is correct
9	Correct	3 ms	672 KB	Output is correct
10	Correct	4 ms	672 KB	Output is correct
11	Correct	3 ms	672 KB	Output is correct
12	Correct	3 ms	672 KB	Output is correct
13	Correct	3 ms	672 KB	Output is correct
14	Correct	3 ms	672 KB	Output is correct
15	Correct	5 ms	672 KB	Output is correct
16	Correct	4 ms	672 KB	Output is correct
17	Correct	4 ms	672 KB	Output is correct
18	Correct	4 ms	672 KB	Output is correct
19	Correct	3 ms	672 KB	Output is correct
20	Correct	3 ms	672 KB	Output is correct
21	Correct	3 ms	672 KB	Output is correct
22	Correct	4 ms	672 KB	Output is correct
23	Correct	13 ms	672 KB	Output is correct
24	Correct	4 ms	672 KB	Output is correct
25	Correct	3 ms	672 KB	Output is correct
26	Correct	3 ms	672 KB	Output is correct
27	Correct	3 ms	672 KB	Output is correct
28	Correct	3 ms	672 KB	Output is correct
29	Correct	3 ms	672 KB	Output is correct
30	Correct	3 ms	672 KB	Output is correct
31	Correct	4 ms	672 KB	Output is correct
32	Correct	2 ms	672 KB	Output is correct
33	Correct	3 ms	672 KB	Output is correct
34	Correct	3 ms	672 KB	Output is correct
35	Correct	5 ms	672 KB	Output is correct
36	Correct	4 ms	672 KB	Output is correct
37	Correct	4 ms	672 KB	Output is correct
38	Correct	3 ms	672 KB	Output is correct
39	Correct	3 ms	672 KB	Output is correct
40	Correct	3 ms	672 KB	Output is correct
41	Correct	3 ms	672 KB	Output is correct
42	Correct	4 ms	672 KB	Output is correct
43	Correct	4 ms	672 KB	Output is correct
44	Correct	3 ms	672 KB	Output is correct
45	Correct	5 ms	672 KB	Output is correct
46	Correct	13 ms	796 KB	Output is correct
47	Correct	13 ms	796 KB	Output is correct
48	Correct	14 ms	796 KB	Output is correct
49	Correct	7 ms	796 KB	Output is correct
50	Correct	14 ms	824 KB	Output is correct
51	Correct	7 ms	824 KB	Output is correct
52	Correct	10 ms	940 KB	Output is correct
53	Correct	8 ms	940 KB	Output is correct
54	Correct	8 ms	940 KB	Output is correct
55	Correct	10 ms	940 KB	Output is correct
56	Correct	8 ms	940 KB	Output is correct
57	Correct	16 ms	940 KB	Output is correct
58	Correct	18 ms	940 KB	Output is correct
59	Correct	18 ms	940 KB	Output is correct
60	Correct	25 ms	940 KB	Output is correct
61	Correct	18 ms	940 KB	Output is correct
62	Correct	11 ms	940 KB	Output is correct
63	Correct	14 ms	940 KB	Output is correct
64	Correct	10 ms	952 KB	Output is correct
65	Correct	14 ms	956 KB	Output is correct
66	Correct	12 ms	956 KB	Output is correct
67	Correct	19 ms	956 KB	Output is correct
68	Correct	8 ms	956 KB	Output is correct
69	Correct	8 ms	1000 KB	Output is correct
70	Correct	8 ms	1000 KB	Output is correct
71	Correct	7 ms	1000 KB	Output is correct
72	Correct	16 ms	1000 KB	Output is correct
73	Correct	18 ms	1000 KB	Output is correct
74	Correct	14 ms	1000 KB	Output is correct
75	Correct	11 ms	1000 KB	Output is correct
76	Correct	8 ms	1000 KB	Output is correct
77	Correct	8 ms	1000 KB	Output is correct
78	Correct	7 ms	1000 KB	Output is correct
79	Correct	7 ms	1000 KB	Output is correct
80	Correct	9 ms	1000 KB	Output is correct
81	Correct	9 ms	1000 KB	Output is correct
82	Correct	9 ms	1000 KB	Output is correct
83	Correct	15 ms	1000 KB	Output is correct
84	Correct	11 ms	1000 KB	Output is correct
85	Correct	12 ms	1000 KB	Output is correct
86	Correct	9 ms	1000 KB	Output is correct
87	Correct	102 ms	1020 KB	Output is correct
88	Correct	99 ms	1616 KB	Output is correct
89	Correct	440 ms	3900 KB	Output is correct
90	Correct	517 ms	3900 KB	Output is correct
91	Correct	473 ms	3900 KB	Output is correct
92	Correct	210 ms	3900 KB	Output is correct
93	Correct	216 ms	3900 KB	Output is correct
94	Correct	190 ms	3900 KB	Output is correct
95	Correct	283 ms	6976 KB	Output is correct
96	Correct	248 ms	7096 KB	Output is correct
97	Correct	250 ms	7100 KB	Output is correct
98	Correct	226 ms	7100 KB	Output is correct
99	Correct	223 ms	7100 KB	Output is correct
100	Correct	644 ms	7100 KB	Output is correct
101	Correct	837 ms	7100 KB	Output is correct
102	Correct	711 ms	7100 KB	Output is correct
103	Correct	781 ms	7100 KB	Output is correct
104	Correct	332 ms	7100 KB	Output is correct
105	Correct	328 ms	7100 KB	Output is correct
106	Correct	444 ms	7100 KB	Output is correct
107	Correct	405 ms	7100 KB	Output is correct
108	Correct	500 ms	7100 KB	Output is correct
109	Correct	453 ms	7100 KB	Output is correct
110	Correct	254 ms	7100 KB	Output is correct
111	Correct	220 ms	7100 KB	Output is correct
112	Correct	334 ms	7100 KB	Output is correct
113	Correct	222 ms	7100 KB	Output is correct
114	Correct	862 ms	7100 KB	Output is correct
115	Correct	942 ms	7100 KB	Output is correct
116	Correct	320 ms	7100 KB	Output is correct
117	Correct	230 ms	8700 KB	Output is correct
118	Correct	214 ms	10472 KB	Output is correct
119	Correct	228 ms	12356 KB	Output is correct
120	Correct	212 ms	13668 KB	Output is correct
121	Correct	203 ms	15224 KB	Output is correct
122	Correct	206 ms	16688 KB	Output is correct
123	Correct	366 ms	18848 KB	Output is correct
124	Correct	294 ms	20480 KB	Output is correct
125	Correct	380 ms	22420 KB	Output is correct
126	Correct	460 ms	23856 KB	Output is correct
127	Correct	375 ms	25340 KB	Output is correct
128	Correct	342 ms	26772 KB	Output is correct

답안 #49231

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 9.0 / 9.0

Subtask #3 84.0 / 84.0

Subtask #1
7.0 / 7.0

Subtask #2
9.0 / 9.0

Subtask #3
84.0 / 84.0