답안 #56340 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
56340	2018-07-11T05:25:13 Z	gs14004	Construction of Highway (JOI18_construction)	C++17	100 / 100	1610 ms	21612 KB

construction

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
typedef long long lint;
typedef pair<int, int> pi;

vector<int> gph[MAXN];
int n, s[MAXN], e[MAXN], a[MAXN];
int par[17][MAXN], dep[MAXN], din[MAXN], dout[MAXN], piv;

int lca(int s, int e){
	auto in = [&](int s, int e){
		return din[s] <= din[e] && dout[e] <= dout[s];
	};
	if(in(s, e)) return s;
	for(int i=16; i>=0; i--){
		if(par[i][s] && !in(par[i][s], e)) s = par[i][s];
	}
	return par[0][s];
}

void dfs(int x, int p){
	din[x] = ++piv;
	for(auto &i : gph[x]){
		if(i != p){
			dep[i] = dep[x] + 1;
			par[0][i] = x;
			dfs(i, x);
		}
	}
	dout[x] = piv;
}

struct segtree{
	int tree[270000], lim;
	void init(){
		memset(tree, 0, sizeof(tree));
		for(lim = 1; lim <= n; lim <<= 1);
	}
	void upd(int x, int v){
		x += lim;
		tree[x] = v;
		while(x > 1){
			x >>= 1;
			tree[x] = max(tree[2*x], tree[2*x+1]);
		}
	}
	int query(int s, int e){
		s += lim;
		e += lim;
		int ret = 0;
		while(s < e){
			if(s%2 == 1) ret = max(ret, tree[s++]);
			if(e%2 == 0) ret = max(ret, tree[e--]);
			s >>= 1;
			e >>= 1;
		}
		if(s == e) ret = max(ret, tree[s]);
		return ret;
	}
	int left_max(int s, int e, int thres){
		s += lim;
		e += lim;
		while(s < e){
			if(s % 2 == 1) s++;
			if(e % 2 == 0){
				if(tree[e] > thres){
					while(e < lim){
						if(tree[2*e+1] > thres) e = 2 * e + 1;
						else e = 2 * e;
					}
					return tree[e];
				}
				e--;
			}
			s >>= 1;
			e >>= 1;
		}
		if(s == e && tree[e] > thres){
			while(e < lim){
				if(tree[2*e+1] > thres) e = 2 * e + 1;
				else e = 2 * e;
			}
			return tree[e];
		}
		return 0;
	}
	int right_max(int s, int e, int thres){
		s += lim;
		e += lim;
		while(s < e){
			if(s % 2 == 1){
				if(tree[s] > thres){
					while(s < lim){
						if(tree[2*s] > thres) s = 2 * s;
						else s = 2 * s + 1;
					}
					return tree[s];
				}
				s++;
			}
			if(e % 2 == 0) e--;
			s >>= 1;
			e >>= 1;
		}
		if(s == e && tree[s] > thres){
			while(s < lim){
				if(tree[2*s] > thres) s = 2 * s;
				else s = 2 * s + 1;
			}
			return tree[s];
		}
		return 0;
	}
};

struct bit{
	int tree[MAXN];
	void add(int x, int v){
		while(x <= n){
			tree[x] += v;
			x += x & -x;
		}
	}
	int query(int x){
		int ret = 0;
		while(x){
			ret += tree[x];
			x -= x & -x;
		}
		return ret;
	}
}bit;

int main(){
	vector<int> v;
	scanf("%d",&n);
	for(int i=1; i<=n; i++){
		scanf("%d",&a[i]);
		v.push_back(a[i]);
	}
	sort(v.begin(), v.end());
	v.resize(unique(v.begin(), v.end()) - v.begin());
	for(int i=1; i<=n; i++) a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin() + 1;
	for(int i=2; i<=n; i++){
		scanf("%d %d",&s[i],&e[i]);
		gph[s[i]].push_back(e[i]);
		gph[e[i]].push_back(s[i]);
	}
	segtree seg;
	seg.init();
	dfs(1, -1);
	for(int i=1; i<17; i++){
		for(int j=1; j<=n; j++){
			par[i][j] = par[i-1][par[i-1][j]];
		}
	}
	e[1] = 1;
	seg.upd(din[1], 1);
	for(int i=2; i<=n; i++){
		int pos = s[i];
		vector<pi> mem;
		int x;
		while((x = seg.query(din[pos], dout[pos])) != seg.tree[1]){
			int pl = seg.left_max(0, din[pos] - 1, x);
			int pr = seg.right_max(dout[pos] + 1, seg.lim-1, x);
			int nxtpos = 1;
			if(pl > x){
				int aux = lca(pos, e[pl]);
				if(dep[aux] > dep[nxtpos]) nxtpos = aux;
			}
			if(pr > x){
				int aux = lca(pos, e[pr]);
				if(dep[aux] > dep[nxtpos]) nxtpos = aux;
			}
			mem.push_back(pi(dep[pos] - dep[nxtpos], a[e[x]]));
			pos = nxtpos;
		}
		lint ans = 0;
		for(auto &i : mem){
			ans += 1ll * bit.query(i.second - 1) * i.first;
			bit.add(i.second, i.first);
		}
		ans += 1ll * bit.query(a[e[seg.tree[1]]] - 1) * (dep[pos] + 1);
		printf("%lld\n", ans);
		for(auto &i : mem) bit.add(i.second, -i.first);
		seg.upd(din[e[i]], i);
	}
}

Compilation message

construction.cpp: In function 'int main()':
construction.cpp:137:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
construction.cpp:139:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~
construction.cpp:146:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&s[i],&e[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
84.0 / 84.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	3832 KB	Output is correct
2	Correct	6 ms	3832 KB	Output is correct
3	Correct	5 ms	3896 KB	Output is correct
4	Correct	6 ms	4056 KB	Output is correct
5	Correct	6 ms	4056 KB	Output is correct
6	Correct	6 ms	4056 KB	Output is correct
7	Correct	6 ms	4056 KB	Output is correct
8	Correct	6 ms	4056 KB	Output is correct
9	Correct	5 ms	4120 KB	Output is correct
10	Correct	7 ms	4176 KB	Output is correct
11	Correct	6 ms	4176 KB	Output is correct
12	Correct	7 ms	4176 KB	Output is correct
13	Correct	5 ms	4176 KB	Output is correct
14	Correct	5 ms	4176 KB	Output is correct
15	Correct	8 ms	4176 KB	Output is correct
16	Correct	7 ms	4176 KB	Output is correct
17	Correct	8 ms	4176 KB	Output is correct
18	Correct	8 ms	4200 KB	Output is correct
19	Correct	5 ms	4200 KB	Output is correct
20	Correct	6 ms	4200 KB	Output is correct
21	Correct	7 ms	4200 KB	Output is correct
22	Correct	6 ms	4200 KB	Output is correct
23	Correct	7 ms	4200 KB	Output is correct
24	Correct	5 ms	4200 KB	Output is correct
25	Correct	7 ms	4200 KB	Output is correct
26	Correct	7 ms	4200 KB	Output is correct
27	Correct	7 ms	4200 KB	Output is correct
28	Correct	8 ms	4200 KB	Output is correct
29	Correct	5 ms	4200 KB	Output is correct
30	Correct	9 ms	4200 KB	Output is correct
31	Correct	7 ms	4200 KB	Output is correct
32	Correct	7 ms	4200 KB	Output is correct
33	Correct	5 ms	4200 KB	Output is correct
34	Correct	7 ms	4200 KB	Output is correct
35	Correct	5 ms	4200 KB	Output is correct
36	Correct	6 ms	4200 KB	Output is correct
37	Correct	5 ms	4200 KB	Output is correct
38	Correct	6 ms	4200 KB	Output is correct
39	Correct	6 ms	4200 KB	Output is correct
40	Correct	5 ms	4200 KB	Output is correct
41	Correct	5 ms	4200 KB	Output is correct
42	Correct	5 ms	4200 KB	Output is correct
43	Correct	5 ms	4200 KB	Output is correct
44	Correct	7 ms	4200 KB	Output is correct
45	Correct	7 ms	4220 KB	Output is correct
46	Correct	18 ms	4604 KB	Output is correct
47	Correct	24 ms	4604 KB	Output is correct
48	Correct	17 ms	4620 KB	Output is correct
49	Correct	10 ms	4764 KB	Output is correct
50	Correct	9 ms	4764 KB	Output is correct
51	Correct	9 ms	4768 KB	Output is correct
52	Correct	11 ms	4768 KB	Output is correct
53	Correct	16 ms	4780 KB	Output is correct
54	Correct	12 ms	4780 KB	Output is correct
55	Correct	9 ms	4788 KB	Output is correct
56	Correct	13 ms	4788 KB	Output is correct
57	Correct	26 ms	4788 KB	Output is correct
58	Correct	32 ms	4788 KB	Output is correct
59	Correct	26 ms	4788 KB	Output is correct
60	Correct	24 ms	4788 KB	Output is correct
61	Correct	11 ms	4788 KB	Output is correct
62	Correct	13 ms	4788 KB	Output is correct
63	Correct	11 ms	4788 KB	Output is correct
64	Correct	17 ms	4788 KB	Output is correct
65	Correct	14 ms	4788 KB	Output is correct
66	Correct	18 ms	4788 KB	Output is correct
67	Correct	16 ms	4788 KB	Output is correct
68	Correct	9 ms	4788 KB	Output is correct
69	Correct	11 ms	4796 KB	Output is correct
70	Correct	14 ms	4796 KB	Output is correct
71	Correct	10 ms	4796 KB	Output is correct
72	Correct	26 ms	4796 KB	Output is correct
73	Correct	24 ms	4796 KB	Output is correct
74	Correct	12 ms	4796 KB	Output is correct
75	Correct	11 ms	4796 KB	Output is correct
76	Correct	12 ms	4796 KB	Output is correct
77	Correct	14 ms	4796 KB	Output is correct
78	Correct	9 ms	4796 KB	Output is correct
79	Correct	9 ms	4796 KB	Output is correct
80	Correct	9 ms	4796 KB	Output is correct
81	Correct	11 ms	4796 KB	Output is correct
82	Correct	13 ms	4796 KB	Output is correct
83	Correct	13 ms	4796 KB	Output is correct
84	Correct	14 ms	4796 KB	Output is correct
85	Correct	12 ms	4796 KB	Output is correct
86	Correct	14 ms	4796 KB	Output is correct
87	Correct	44 ms	5524 KB	Output is correct
88	Correct	144 ms	8408 KB	Output is correct
89	Correct	777 ms	17448 KB	Output is correct
90	Correct	709 ms	17496 KB	Output is correct
91	Correct	699 ms	17496 KB	Output is correct
92	Correct	152 ms	21452 KB	Output is correct
93	Correct	181 ms	21452 KB	Output is correct
94	Correct	194 ms	21612 KB	Output is correct
95	Correct	358 ms	21612 KB	Output is correct
96	Correct	344 ms	21612 KB	Output is correct
97	Correct	267 ms	21612 KB	Output is correct
98	Correct	282 ms	21612 KB	Output is correct
99	Correct	270 ms	21612 KB	Output is correct
100	Correct	1184 ms	21612 KB	Output is correct
101	Correct	1610 ms	21612 KB	Output is correct
102	Correct	1412 ms	21612 KB	Output is correct
103	Correct	1537 ms	21612 KB	Output is correct
104	Correct	408 ms	21612 KB	Output is correct
105	Correct	365 ms	21612 KB	Output is correct
106	Correct	385 ms	21612 KB	Output is correct
107	Correct	635 ms	21612 KB	Output is correct
108	Correct	658 ms	21612 KB	Output is correct
109	Correct	714 ms	21612 KB	Output is correct
110	Correct	144 ms	21612 KB	Output is correct
111	Correct	243 ms	21612 KB	Output is correct
112	Correct	335 ms	21612 KB	Output is correct
113	Correct	297 ms	21612 KB	Output is correct
114	Correct	1563 ms	21612 KB	Output is correct
115	Correct	1486 ms	21612 KB	Output is correct
116	Correct	345 ms	21612 KB	Output is correct
117	Correct	324 ms	21612 KB	Output is correct
118	Correct	280 ms	21612 KB	Output is correct
119	Correct	321 ms	21612 KB	Output is correct
120	Correct	335 ms	21612 KB	Output is correct
121	Correct	282 ms	21612 KB	Output is correct
122	Correct	311 ms	21612 KB	Output is correct
123	Correct	409 ms	21612 KB	Output is correct
124	Correct	439 ms	21612 KB	Output is correct
125	Correct	444 ms	21612 KB	Output is correct
126	Correct	412 ms	21612 KB	Output is correct
127	Correct	408 ms	21612 KB	Output is correct
128	Correct	445 ms	21612 KB	Output is correct

답안 #56340

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