답안 #49228 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49228	2018-05-24T00:25:59 Z	spencercompton	Construction of Highway (JOI18_construction)	C++17	16 / 100	1000 ms	29100 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;
	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--;
		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 << endl;
		// out << ans << endl;
	}
}

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	2 ms	380 KB	Output is correct
2	Correct	2 ms	556 KB	Output is correct
3	Correct	4 ms	556 KB	Output is correct
4	Correct	3 ms	592 KB	Output is correct
5	Correct	4 ms	592 KB	Output is correct
6	Correct	4 ms	592 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	3 ms	592 KB	Output is correct
9	Correct	3 ms	592 KB	Output is correct
10	Correct	3 ms	592 KB	Output is correct
11	Correct	4 ms	592 KB	Output is correct
12	Correct	4 ms	596 KB	Output is correct
13	Correct	4 ms	636 KB	Output is correct
14	Correct	5 ms	636 KB	Output is correct
15	Correct	5 ms	636 KB	Output is correct
16	Correct	4 ms	636 KB	Output is correct
17	Correct	4 ms	636 KB	Output is correct
18	Correct	5 ms	640 KB	Output is correct
19	Correct	4 ms	640 KB	Output is correct
20	Correct	4 ms	712 KB	Output is correct
21	Correct	8 ms	712 KB	Output is correct
22	Correct	5 ms	712 KB	Output is correct
23	Correct	4 ms	712 KB	Output is correct
24	Correct	4 ms	712 KB	Output is correct
25	Correct	5 ms	712 KB	Output is correct
26	Correct	3 ms	712 KB	Output is correct
27	Correct	3 ms	712 KB	Output is correct
28	Correct	4 ms	712 KB	Output is correct
29	Correct	4 ms	712 KB	Output is correct
30	Correct	4 ms	712 KB	Output is correct
31	Correct	5 ms	712 KB	Output is correct
32	Correct	4 ms	712 KB	Output is correct
33	Correct	4 ms	712 KB	Output is correct
34	Correct	4 ms	712 KB	Output is correct
35	Correct	5 ms	712 KB	Output is correct
36	Correct	5 ms	712 KB	Output is correct
37	Correct	8 ms	712 KB	Output is correct
38	Correct	3 ms	712 KB	Output is correct
39	Correct	4 ms	712 KB	Output is correct
40	Correct	4 ms	712 KB	Output is correct
41	Correct	3 ms	712 KB	Output is correct
42	Correct	3 ms	712 KB	Output is correct
43	Correct	3 ms	712 KB	Output is correct
44	Correct	3 ms	712 KB	Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 84.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	556 KB	Output is correct
3	Correct	4 ms	556 KB	Output is correct
4	Correct	3 ms	592 KB	Output is correct
5	Correct	4 ms	592 KB	Output is correct
6	Correct	4 ms	592 KB	Output is correct
7	Correct	3 ms	592 KB	Output is correct
8	Correct	3 ms	592 KB	Output is correct
9	Correct	3 ms	592 KB	Output is correct
10	Correct	3 ms	592 KB	Output is correct
11	Correct	4 ms	592 KB	Output is correct
12	Correct	4 ms	596 KB	Output is correct
13	Correct	4 ms	636 KB	Output is correct
14	Correct	5 ms	636 KB	Output is correct
15	Correct	5 ms	636 KB	Output is correct
16	Correct	4 ms	636 KB	Output is correct
17	Correct	4 ms	636 KB	Output is correct
18	Correct	5 ms	640 KB	Output is correct
19	Correct	4 ms	640 KB	Output is correct
20	Correct	4 ms	712 KB	Output is correct
21	Correct	8 ms	712 KB	Output is correct
22	Correct	5 ms	712 KB	Output is correct
23	Correct	4 ms	712 KB	Output is correct
24	Correct	4 ms	712 KB	Output is correct
25	Correct	5 ms	712 KB	Output is correct
26	Correct	3 ms	712 KB	Output is correct
27	Correct	3 ms	712 KB	Output is correct
28	Correct	4 ms	712 KB	Output is correct
29	Correct	4 ms	712 KB	Output is correct
30	Correct	4 ms	712 KB	Output is correct
31	Correct	5 ms	712 KB	Output is correct
32	Correct	4 ms	712 KB	Output is correct
33	Correct	4 ms	712 KB	Output is correct
34	Correct	4 ms	712 KB	Output is correct
35	Correct	5 ms	712 KB	Output is correct
36	Correct	5 ms	712 KB	Output is correct
37	Correct	8 ms	712 KB	Output is correct
38	Correct	3 ms	712 KB	Output is correct
39	Correct	4 ms	712 KB	Output is correct
40	Correct	4 ms	712 KB	Output is correct
41	Correct	3 ms	712 KB	Output is correct
42	Correct	3 ms	712 KB	Output is correct
43	Correct	3 ms	712 KB	Output is correct
44	Correct	3 ms	712 KB	Output is correct
45	Correct	5 ms	712 KB	Output is correct
46	Correct	17 ms	800 KB	Output is correct
47	Correct	17 ms	800 KB	Output is correct
48	Correct	18 ms	800 KB	Output is correct
49	Correct	18 ms	800 KB	Output is correct
50	Correct	42 ms	892 KB	Output is correct
51	Correct	13 ms	892 KB	Output is correct
52	Correct	14 ms	1084 KB	Output is correct
53	Correct	14 ms	1084 KB	Output is correct
54	Correct	19 ms	1084 KB	Output is correct
55	Correct	13 ms	1084 KB	Output is correct
56	Correct	13 ms	1084 KB	Output is correct
57	Correct	21 ms	1084 KB	Output is correct
58	Correct	30 ms	1084 KB	Output is correct
59	Correct	33 ms	1084 KB	Output is correct
60	Correct	31 ms	1084 KB	Output is correct
61	Correct	22 ms	1084 KB	Output is correct
62	Correct	15 ms	1084 KB	Output is correct
63	Correct	17 ms	1084 KB	Output is correct
64	Correct	18 ms	1084 KB	Output is correct
65	Correct	17 ms	1084 KB	Output is correct
66	Correct	18 ms	1084 KB	Output is correct
67	Correct	19 ms	1084 KB	Output is correct
68	Correct	12 ms	1084 KB	Output is correct
69	Correct	13 ms	1084 KB	Output is correct
70	Correct	13 ms	1084 KB	Output is correct
71	Correct	19 ms	1084 KB	Output is correct
72	Correct	20 ms	1084 KB	Output is correct
73	Correct	43 ms	1084 KB	Output is correct
74	Correct	16 ms	1084 KB	Output is correct
75	Correct	15 ms	1084 KB	Output is correct
76	Correct	15 ms	1084 KB	Output is correct
77	Correct	14 ms	1084 KB	Output is correct
78	Correct	16 ms	1084 KB	Output is correct
79	Correct	14 ms	1084 KB	Output is correct
80	Correct	14 ms	1084 KB	Output is correct
81	Correct	17 ms	1084 KB	Output is correct
82	Correct	17 ms	1084 KB	Output is correct
83	Correct	16 ms	1084 KB	Output is correct
84	Correct	15 ms	1084 KB	Output is correct
85	Correct	15 ms	1084 KB	Output is correct
86	Correct	14 ms	1084 KB	Output is correct
87	Correct	42 ms	1084 KB	Output is correct
88	Correct	162 ms	1740 KB	Output is correct
89	Correct	514 ms	3644 KB	Output is correct
90	Correct	614 ms	3888 KB	Output is correct
91	Correct	546 ms	3888 KB	Output is correct
92	Correct	330 ms	3888 KB	Output is correct
93	Correct	320 ms	3888 KB	Output is correct
94	Correct	352 ms	3888 KB	Output is correct
95	Correct	471 ms	6968 KB	Output is correct
96	Correct	411 ms	7176 KB	Output is correct
97	Correct	415 ms	7176 KB	Output is correct
98	Correct	433 ms	7176 KB	Output is correct
99	Correct	427 ms	7176 KB	Output is correct
100	Correct	819 ms	7176 KB	Output is correct
101	Correct	914 ms	7176 KB	Output is correct
102	Correct	972 ms	7940 KB	Output is correct
103	Correct	968 ms	10116 KB	Output is correct
104	Correct	608 ms	12228 KB	Output is correct
105	Correct	557 ms	14452 KB	Output is correct
106	Correct	509 ms	16472 KB	Output is correct
107	Correct	550 ms	17868 KB	Output is correct
108	Correct	621 ms	19176 KB	Output is correct
109	Correct	728 ms	21016 KB	Output is correct
110	Correct	478 ms	22380 KB	Output is correct
111	Correct	437 ms	27360 KB	Output is correct
112	Correct	437 ms	27360 KB	Output is correct
113	Correct	424 ms	27360 KB	Output is correct
114	Execution timed out	1086 ms	29100 KB	Time limit exceeded
115	Halted	0 ms	0 KB	-

답안 #49228

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