답안 #62803 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
62803	2018-07-30T06:04:03 Z	kingpig9	Construction of Highway (JOI18_construction)	C++11	16 / 100	2000 ms	42376 KB

construction

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1 << 17;

//#define debug(...) fprintf(stderr, __VA_ARGS__)
#define debug(...)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))

int N;
int A[MAXN], B[MAXN];
int C[MAXN];
vector<int> adj[MAXN];
int ent[MAXN], exi[MAXN];

struct segtree {
	pii tree[2 * MAXN];	//pii(time, value)

	void update (int x, pii v) {
		debug("update %d, (%d, %d)\n", x, v.fi, v.se);
		tree[x += MAXN] = v;
		while (x >>= 1) {
			tree[x] = max(tree[2 * x], tree[2 * x + 1]);
		}
	}

	pii query (int a, int b, int cur = 1, int lt = 0, int rt = MAXN) {
		if (rt <= a || b <= lt) {
			return pii(-1, -1);
		}

		if (a <= lt && rt <= b) {
			return tree[cur];
		}

		int mid = (lt + rt) / 2;
		return max(query(a, b, 2 * cur, lt, mid), query(a, b, 2 * cur + 1, mid, rt));
	}
} seg;

void updpath (int x) {
	static int updtime = 0;
	seg.update(ent[x], pii(++updtime, C[x]));
}

int lastupd (int x) {
	//last update of this one
	//debug("x = %d. query [%d, %d)\n", x, ent[x], exi[x]);
	return seg.query(ent[x], exi[x]).se;
}

void dfs (int x) {
	static int cur = 0;
	ent[x] = cur++;
	for (int y : adj[x]) {
		dfs(y);
	}
	//debug("updpath(%d)\n", x);
	exi[x] = cur;
	updpath(x);
	assert(lastupd(x) == C[x]);
}

struct node {
	node *ch[2], *p;
	int id;
	int size;
} *null = new node, nodes[MAXN];

int getdir (node *n) {
	if (n->p == null) {
		return -1;
	}
	for (int i = 0; i < 2; i++) {
		if (n == n->p->ch[i]) {
			return i;
		}
	}
	return -1;
}

bool isroot (node *n) {
	return getdir(n) == -1;
}

void setc (node *n, node *c, int d) {
	n->ch[d] = c;
	if (c != null) {
		c->p = n;
	}
}

void push (node *n) {
	//nothing
}

void pull (node *n) {
	n->size = n->ch[0]->size + 1 + n->ch[1]->size;
}

void rot (node *n) {
	node *p = n->p, *g = p->p;
	bool d = getdir(n);
	//note that this matters in an LCT. cannot cal setc on g and n
	if (!isroot(p)) {
		g->ch[getdir(p)] = n;
	}
	setc(p, n->ch[!d], d);
	n->p = g;	//this line forgot include...
#warning is this correct (in rot function)?
	setc(n, p, !d);
	pull(p);
	pull(n);
}

void splay (node *n) {
	while (!isroot(n)) {
		node *p = n->p;
		if (!isroot(p)) {
			push(p->p);
		}
		push(p);
		push(n);
		if (!isroot(p)) {
			rot(getdir(n) == getdir(p) ? n : p);
		}
		rot(n);
	}
	push(n);
}

vector<pii> expose (node *u) {
	//pii(size, value of node)
	debug("----------------expose %d-------------------\n", u->id);
	vector<pii> res;
	int psize = 0;

	for (node *cur = u, *v = null; cur != null; v = cur, cur = cur->p) {
		splay(cur);
		assert(v == null || v->p == cur);
		cur->ch[1] = v;
		pull(cur);
		debug("id = %d, lastupd = %d. Size = %d\n", cur->id, lastupd(cur->id), cur->size - psize);
		if (v != null) {
			res.push_back(pii(lastupd(cur->id), cur->size - psize));
		}
		psize = cur->size;
	}
	splay(u);

	/*
	for (pii p : res) {
		debug("(%d, %d) ", p.fi, p.se);
	}
	debug("\n");
	*/

	return res;
}

struct fenwick {
	ll bit[MAXN];

	void update (int x, ll v) {
		for (x++; x < MAXN; x += (x & -x)) {
			bit[x] += v;
		}
	}

	ll query (int x) {
		ll res = 0;
		for (x++; x; x &= (x - 1)) {
			res += bit[x];
		}
		return res;
	}
} fen;

int main() {
	scanf("%d", &N);
	for (int i = 0; i < N; i++) {
		scanf("%d", &C[i]);
	}
	//compress C
	vector<int> vals(C, C + N);
	sort(all(vals));
	vals.resize(unique(all(vals)) - vals.begin());
	for (int i = 0; i < N; i++) {
		C[i] = lower_bound(all(vals), C[i]) - vals.begin();
		debug("C[%d] = %d\n", i, C[i]);
	}
	
	for (int i = 0; i < N - 1; i++) {
		scanf("%d %d", &A[i], &B[i]);
		A[i]--;
		B[i]--;
		adj[A[i]].push_back(B[i]);
	}

	dfs(0);

	//NOW THE NODES!
	null->ch[0] = null->ch[1] = null->p = null;
	null->id = -1073741819;
	null->size = 0;
	for (int i = 0; i < N; i++) {
		nodes[i].ch[0] = nodes[i].ch[1] = nodes[i].p = null;
		nodes[i].id = i;
		nodes[i].size = 1;
	}

	for (int i = 0; i < N - 1; i++) {
		nodes[B[i]].p = nodes + A[i];
	}

	for (int i = 0; i < N - 1; i++) {
		int a = A[i], b = B[i];
		vector<pii> v = expose(nodes + b);
		//we want the number of strictly less than this value.
		debug("--------SATAN 1-------------\n");
		ll ans = 0;
		for (pii p : v) {
			debug("(%d, %d)...\n", p.fi, p.se);
			debug("query(%d) = %lld\n", p.fi - 1, fen.query(p.fi - 1));
			ans += p.se * fen.query(p.fi - 1);
			debug("update(%d, %d)\n", p.fi, p.se);
			fen.update(p.fi, p.se);
		}
		for (pii p : v) {
			fen.update(p.fi, -p.se);
		}
		printf("%lld\n", ans);

		updpath(b);
		debug("--------SATAN 2-------------\n");
	}
}

Compilation message

construction.cpp:117:2: warning: #warning is this correct (in rot function)? [-Wcpp]
 #warning is this correct (in rot function)?
  ^~~~~~~
construction.cpp: In function 'int main()':
construction.cpp:224:7: warning: unused variable 'a' [-Wunused-variable]
   int a = A[i], b = B[i];
       ^
construction.cpp:187:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
construction.cpp:189:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &C[i]);
   ~~~~~^~~~~~~~~~~~~
construction.cpp:201:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &A[i], &B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	3448 KB	Output is correct
2	Correct	7 ms	3556 KB	Output is correct
3	Correct	6 ms	3596 KB	Output is correct
4	Correct	8 ms	3648 KB	Output is correct
5	Correct	9 ms	3816 KB	Output is correct
6	Correct	7 ms	3816 KB	Output is correct
7	Correct	7 ms	3816 KB	Output is correct
8	Correct	9 ms	3816 KB	Output is correct
9	Correct	7 ms	3816 KB	Output is correct
10	Correct	7 ms	3820 KB	Output is correct
11	Correct	10 ms	3832 KB	Output is correct
12	Correct	8 ms	3892 KB	Output is correct
13	Correct	7 ms	3904 KB	Output is correct
14	Correct	10 ms	3916 KB	Output is correct
15	Correct	10 ms	3928 KB	Output is correct
16	Correct	10 ms	3936 KB	Output is correct
17	Correct	10 ms	4020 KB	Output is correct
18	Correct	9 ms	4020 KB	Output is correct
19	Correct	8 ms	4020 KB	Output is correct
20	Correct	8 ms	4020 KB	Output is correct
21	Correct	9 ms	4020 KB	Output is correct
22	Correct	7 ms	4028 KB	Output is correct
23	Correct	9 ms	4028 KB	Output is correct
24	Correct	9 ms	4036 KB	Output is correct
25	Correct	8 ms	4092 KB	Output is correct
26	Correct	7 ms	4092 KB	Output is correct
27	Correct	8 ms	4108 KB	Output is correct
28	Correct	6 ms	4108 KB	Output is correct
29	Correct	7 ms	4108 KB	Output is correct
30	Correct	11 ms	4152 KB	Output is correct
31	Correct	10 ms	4152 KB	Output is correct
32	Correct	7 ms	4152 KB	Output is correct
33	Correct	6 ms	4196 KB	Output is correct
34	Correct	7 ms	4196 KB	Output is correct
35	Correct	8 ms	4196 KB	Output is correct
36	Correct	8 ms	4196 KB	Output is correct
37	Correct	7 ms	4196 KB	Output is correct
38	Correct	8 ms	4196 KB	Output is correct
39	Correct	9 ms	4196 KB	Output is correct
40	Correct	10 ms	4196 KB	Output is correct
41	Correct	8 ms	4208 KB	Output is correct
42	Correct	7 ms	4208 KB	Output is correct
43	Correct	7 ms	4208 KB	Output is correct
44	Correct	9 ms	4208 KB	Output is correct

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	3448 KB	Output is correct
2	Correct	7 ms	3556 KB	Output is correct
3	Correct	6 ms	3596 KB	Output is correct
4	Correct	8 ms	3648 KB	Output is correct
5	Correct	9 ms	3816 KB	Output is correct
6	Correct	7 ms	3816 KB	Output is correct
7	Correct	7 ms	3816 KB	Output is correct
8	Correct	9 ms	3816 KB	Output is correct
9	Correct	7 ms	3816 KB	Output is correct
10	Correct	7 ms	3820 KB	Output is correct
11	Correct	10 ms	3832 KB	Output is correct
12	Correct	8 ms	3892 KB	Output is correct
13	Correct	7 ms	3904 KB	Output is correct
14	Correct	10 ms	3916 KB	Output is correct
15	Correct	10 ms	3928 KB	Output is correct
16	Correct	10 ms	3936 KB	Output is correct
17	Correct	10 ms	4020 KB	Output is correct
18	Correct	9 ms	4020 KB	Output is correct
19	Correct	8 ms	4020 KB	Output is correct
20	Correct	8 ms	4020 KB	Output is correct
21	Correct	9 ms	4020 KB	Output is correct
22	Correct	7 ms	4028 KB	Output is correct
23	Correct	9 ms	4028 KB	Output is correct
24	Correct	9 ms	4036 KB	Output is correct
25	Correct	8 ms	4092 KB	Output is correct
26	Correct	7 ms	4092 KB	Output is correct
27	Correct	8 ms	4108 KB	Output is correct
28	Correct	6 ms	4108 KB	Output is correct
29	Correct	7 ms	4108 KB	Output is correct
30	Correct	11 ms	4152 KB	Output is correct
31	Correct	10 ms	4152 KB	Output is correct
32	Correct	7 ms	4152 KB	Output is correct
33	Correct	6 ms	4196 KB	Output is correct
34	Correct	7 ms	4196 KB	Output is correct
35	Correct	8 ms	4196 KB	Output is correct
36	Correct	8 ms	4196 KB	Output is correct
37	Correct	7 ms	4196 KB	Output is correct
38	Correct	8 ms	4196 KB	Output is correct
39	Correct	9 ms	4196 KB	Output is correct
40	Correct	10 ms	4196 KB	Output is correct
41	Correct	8 ms	4208 KB	Output is correct
42	Correct	7 ms	4208 KB	Output is correct
43	Correct	7 ms	4208 KB	Output is correct
44	Correct	9 ms	4208 KB	Output is correct
45	Correct	10 ms	4212 KB	Output is correct
46	Correct	21 ms	4616 KB	Output is correct
47	Correct	25 ms	4820 KB	Output is correct
48	Correct	28 ms	4820 KB	Output is correct
49	Correct	14 ms	5132 KB	Output is correct
50	Correct	17 ms	5212 KB	Output is correct
51	Correct	17 ms	5320 KB	Output is correct
52	Correct	18 ms	5428 KB	Output is correct
53	Correct	16 ms	5428 KB	Output is correct
54	Correct	17 ms	5464 KB	Output is correct
55	Correct	17 ms	5540 KB	Output is correct
56	Correct	41 ms	5632 KB	Output is correct
57	Correct	35 ms	5632 KB	Output is correct
58	Correct	34 ms	5636 KB	Output is correct
59	Correct	31 ms	5712 KB	Output is correct
60	Correct	30 ms	5788 KB	Output is correct
61	Correct	17 ms	5992 KB	Output is correct
62	Correct	20 ms	6068 KB	Output is correct
63	Correct	19 ms	6144 KB	Output is correct
64	Correct	19 ms	6144 KB	Output is correct
65	Correct	19 ms	6144 KB	Output is correct
66	Correct	21 ms	6188 KB	Output is correct
67	Correct	21 ms	6240 KB	Output is correct
68	Correct	14 ms	6552 KB	Output is correct
69	Correct	16 ms	6552 KB	Output is correct
70	Correct	17 ms	6552 KB	Output is correct
71	Correct	37 ms	6552 KB	Output is correct
72	Correct	34 ms	6552 KB	Output is correct
73	Correct	34 ms	6552 KB	Output is correct
74	Correct	17 ms	6600 KB	Output is correct
75	Correct	33 ms	6736 KB	Output is correct
76	Correct	24 ms	6736 KB	Output is correct
77	Correct	22 ms	6896 KB	Output is correct
78	Correct	33 ms	6896 KB	Output is correct
79	Correct	23 ms	6896 KB	Output is correct
80	Correct	22 ms	6936 KB	Output is correct
81	Correct	17 ms	6984 KB	Output is correct
82	Correct	21 ms	7048 KB	Output is correct
83	Correct	17 ms	7112 KB	Output is correct
84	Correct	20 ms	7200 KB	Output is correct
85	Correct	17 ms	7244 KB	Output is correct
86	Correct	15 ms	7288 KB	Output is correct

Subtask #3
0 / 84.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	3448 KB	Output is correct
2	Correct	7 ms	3556 KB	Output is correct
3	Correct	6 ms	3596 KB	Output is correct
4	Correct	8 ms	3648 KB	Output is correct
5	Correct	9 ms	3816 KB	Output is correct
6	Correct	7 ms	3816 KB	Output is correct
7	Correct	7 ms	3816 KB	Output is correct
8	Correct	9 ms	3816 KB	Output is correct
9	Correct	7 ms	3816 KB	Output is correct
10	Correct	7 ms	3820 KB	Output is correct
11	Correct	10 ms	3832 KB	Output is correct
12	Correct	8 ms	3892 KB	Output is correct
13	Correct	7 ms	3904 KB	Output is correct
14	Correct	10 ms	3916 KB	Output is correct
15	Correct	10 ms	3928 KB	Output is correct
16	Correct	10 ms	3936 KB	Output is correct
17	Correct	10 ms	4020 KB	Output is correct
18	Correct	9 ms	4020 KB	Output is correct
19	Correct	8 ms	4020 KB	Output is correct
20	Correct	8 ms	4020 KB	Output is correct
21	Correct	9 ms	4020 KB	Output is correct
22	Correct	7 ms	4028 KB	Output is correct
23	Correct	9 ms	4028 KB	Output is correct
24	Correct	9 ms	4036 KB	Output is correct
25	Correct	8 ms	4092 KB	Output is correct
26	Correct	7 ms	4092 KB	Output is correct
27	Correct	8 ms	4108 KB	Output is correct
28	Correct	6 ms	4108 KB	Output is correct
29	Correct	7 ms	4108 KB	Output is correct
30	Correct	11 ms	4152 KB	Output is correct
31	Correct	10 ms	4152 KB	Output is correct
32	Correct	7 ms	4152 KB	Output is correct
33	Correct	6 ms	4196 KB	Output is correct
34	Correct	7 ms	4196 KB	Output is correct
35	Correct	8 ms	4196 KB	Output is correct
36	Correct	8 ms	4196 KB	Output is correct
37	Correct	7 ms	4196 KB	Output is correct
38	Correct	8 ms	4196 KB	Output is correct
39	Correct	9 ms	4196 KB	Output is correct
40	Correct	10 ms	4196 KB	Output is correct
41	Correct	8 ms	4208 KB	Output is correct
42	Correct	7 ms	4208 KB	Output is correct
43	Correct	7 ms	4208 KB	Output is correct
44	Correct	9 ms	4208 KB	Output is correct
45	Correct	10 ms	4212 KB	Output is correct
46	Correct	21 ms	4616 KB	Output is correct
47	Correct	25 ms	4820 KB	Output is correct
48	Correct	28 ms	4820 KB	Output is correct
49	Correct	14 ms	5132 KB	Output is correct
50	Correct	17 ms	5212 KB	Output is correct
51	Correct	17 ms	5320 KB	Output is correct
52	Correct	18 ms	5428 KB	Output is correct
53	Correct	16 ms	5428 KB	Output is correct
54	Correct	17 ms	5464 KB	Output is correct
55	Correct	17 ms	5540 KB	Output is correct
56	Correct	41 ms	5632 KB	Output is correct
57	Correct	35 ms	5632 KB	Output is correct
58	Correct	34 ms	5636 KB	Output is correct
59	Correct	31 ms	5712 KB	Output is correct
60	Correct	30 ms	5788 KB	Output is correct
61	Correct	17 ms	5992 KB	Output is correct
62	Correct	20 ms	6068 KB	Output is correct
63	Correct	19 ms	6144 KB	Output is correct
64	Correct	19 ms	6144 KB	Output is correct
65	Correct	19 ms	6144 KB	Output is correct
66	Correct	21 ms	6188 KB	Output is correct
67	Correct	21 ms	6240 KB	Output is correct
68	Correct	14 ms	6552 KB	Output is correct
69	Correct	16 ms	6552 KB	Output is correct
70	Correct	17 ms	6552 KB	Output is correct
71	Correct	37 ms	6552 KB	Output is correct
72	Correct	34 ms	6552 KB	Output is correct
73	Correct	34 ms	6552 KB	Output is correct
74	Correct	17 ms	6600 KB	Output is correct
75	Correct	33 ms	6736 KB	Output is correct
76	Correct	24 ms	6736 KB	Output is correct
77	Correct	22 ms	6896 KB	Output is correct
78	Correct	33 ms	6896 KB	Output is correct
79	Correct	23 ms	6896 KB	Output is correct
80	Correct	22 ms	6936 KB	Output is correct
81	Correct	17 ms	6984 KB	Output is correct
82	Correct	21 ms	7048 KB	Output is correct
83	Correct	17 ms	7112 KB	Output is correct
84	Correct	20 ms	7200 KB	Output is correct
85	Correct	17 ms	7244 KB	Output is correct
86	Correct	15 ms	7288 KB	Output is correct
87	Correct	53 ms	7980 KB	Output is correct
88	Correct	203 ms	10668 KB	Output is correct
89	Correct	808 ms	19836 KB	Output is correct
90	Correct	845 ms	21784 KB	Output is correct
91	Correct	921 ms	23848 KB	Output is correct
92	Correct	348 ms	32140 KB	Output is correct
93	Correct	320 ms	34140 KB	Output is correct
94	Correct	330 ms	36300 KB	Output is correct
95	Correct	376 ms	36300 KB	Output is correct
96	Correct	338 ms	36776 KB	Output is correct
97	Correct	336 ms	39032 KB	Output is correct
98	Correct	369 ms	41080 KB	Output is correct
99	Execution timed out	2074 ms	42376 KB	Time limit exceeded
100	Halted	0 ms	0 KB	-

답안 #62803

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