oj.uz

답안 #113924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113924 2019-05-29T08:39:15 Z RockyB Construction of Highway (JOI18_construction) C++14
16 / 100
 2000 ms 15732 KB 
/// In The Name Of God

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
int a[N];

pair <int, int> e[N];
vector <int> g[N];

int sz[N], up[N], par[N], len[N], dep[N];

struct fenwick {
	int f[N];
	inline void upd(int p, int x) {
		for (; p < N; p |= p + 1) f[p] += x;
	}
	inline int get(int p) {
		int res = 0;
		for (; p >= 0; p = (p & (p + 1)) - 1) res += f[p];
		return res;
	}
} T;

inline void dfs_sz(int v = 1, int p = 0) {
	sz[v]++;
	par[v] = p;
	dep[v] = dep[p] + 1;
	for (auto &to : g[v]) {
		if (to != p) {
			dfs_sz(to, v);
			sz[v] += sz[to];
			if (sz[to] > sz[g[v][0]]) swap(g[v][0], to);
		}
	}
}
inline void dfs(int v = 1) {
	len[up[v]]++;
	for (auto to : g[v]) {
		up[to] = (to == g[v][0] ? up[v] : to);
		dfs(to);
	}
}
vector < pair <int, int > > path[N];

inline void paint_v(vector < pair <int, int> > &x, int L, int c) {
	reverse(all(x));
	int add = L;
	while (sz(x)) {
		auto &it = x.back();
		if (it.s <= L) {
			L -= it.s;
			x.pp();
		}
		else {
			it.s -= L;
			break;
		}
	}
	x.pb({c, add});
	reverse(all(x));
}
inline void paint(int v, int x) {
	paint_v(path[up[v]], dep[v] - dep[up[v]] + 1, x);
	v = par[up[v]];
	while (v) {
		int cut = dep[v] - dep[up[v]] + 1, L = cut;
		reverse(all(path[up[v]]));
		while (sz(path[up[v]])) {
			auto &it = path[up[v]].back();
			if (it.s <= cut) {
				cut -= it.s;
				path[up[v]].pp();
			}
			else {
				it.s -= cut;
				break;
			}
		}
		path[up[v]].pb({x, L});
		reverse(all(path[up[v]]));
		v = par[up[v]];
	}
}
inline ll inv(vector < pair <int, int > > &x) {
	ll sum = 0;
	for (auto it : x) {
		sum += (ll)T.get(it.f - 1) * it.s;
		T.upd(it.f, it.s);
	}
	for (auto it : x) {
		T.upd(it.f, -it.s);
	}
	return sum;
}
inline void calc(int v, int u) {
	vector < pair <int, int> > s;
	int L = dep[v] - dep[up[v]] + 1, V = v;
	for (auto it : path[up[v]]) {
		if (it.s < L) {
			if (sz(s) && s.back().f == it.f) {
				s[sz(s) - 1].s += it.s;
			}
			else {
				s.pb(it);
			}
			L -= it.s;
		}
		else {
			if (sz(s) && s.back().f == it.f) {
				s[sz(s) - 1].s += L;
			}
			else {
				s.pb({it.f, L});
			}
			break;
		}
	}
	reverse(all(s));
	v = par[up[v]];
	while (v) {
		int need = dep[v] - dep[up[v]] + 1;
		vector < pair <int, int > > add;
		for (auto it : path[up[v]]) {
			if (it.s < need) {
				add.pb(it);
				need -= it.s;
			}
			else {
				add.pb({it.f, need});
				break;
			}
		}
		reverse(all(add));
		for (auto it : add) {
			if (sz(s) && s.back().f == it.f) {
				s[sz(s) - 1].s += it.s;
			}
			else {
				s.pb(it);
			}
		}
		v = par[up[v]];
	}

	ll cnt = inv(s);
	/*
	rep(i, 0, sz(s) - 1) {
		rep(j, i + 1, sz(s) - 1) {
			if (s[i].f > s[j].f) cnt += s[i].s * 1ll * s[j].s;
		}
	}*/
	paint(V, a[u]);
	if (sz(path[up[u]]) && path[up[u]].back().f == a[u]) {
		path[up[u]][sz(path[up[u]]) - 1].s++;
	}
	else {
		path[up[u]].pb({a[u], 1});
	}
	cout << cnt << nl;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
		freopen ("A.out", "w", stdout);
	#endif
	Kazakhstan
	cin >> n;
	rep(i, 1, n) cin >> a[i];
	rep(i, 2, n) {
		cin >> e[i].f >> e[i].s;
		g[e[i].f].pb(e[i].s);
	}
	dfs_sz();
	up[1] = 1;
	dfs();
	
	{ /// compressing
		vector <int> cmp;
		rep(i, 1, n) {
			cmp.pb(a[i]);
		}
		sort(all(cmp));
		cmp.erase(unique(all(cmp)), cmp.end());
		rep(i, 1, n) {
			a[i] = lower_bound(all(cmp), a[i]) - cmp.begin();
		}
	}
	rep(i, 2, n) {
		calc(e[i].f, e[i].s);
	}
	ioi
}

Subtask #1
7.0 / 7.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 7 ms 5168 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 7 ms 5120 KB Output is correct
18 Correct 7 ms 5120 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 6 ms 5120 KB Output is correct
22 Correct 6 ms 5120 KB Output is correct
23 Correct 6 ms 5164 KB Output is correct
24 Correct 6 ms 5120 KB Output is correct
25 Correct 6 ms 5120 KB Output is correct
26 Correct 6 ms 5120 KB Output is correct
27 Correct 6 ms 5120 KB Output is correct
28 Correct 6 ms 5120 KB Output is correct
29 Correct 6 ms 5120 KB Output is correct
30 Correct 6 ms 5120 KB Output is correct
31 Correct 6 ms 5120 KB Output is correct
32 Correct 6 ms 5120 KB Output is correct
33 Correct 6 ms 5120 KB Output is correct
34 Correct 6 ms 5120 KB Output is correct
35 Correct 6 ms 5120 KB Output is correct
36 Correct 6 ms 5120 KB Output is correct
37 Correct 6 ms 5120 KB Output is correct
38 Correct 6 ms 5120 KB Output is correct
39 Correct 6 ms 5120 KB Output is correct
40 Correct 6 ms 5120 KB Output is correct
41 Correct 6 ms 5120 KB Output is correct
42 Correct 6 ms 5120 KB Output is correct
43 Correct 6 ms 5120 KB Output is correct
44 Correct 6 ms 5120 KB Output is correct
45 Correct 7 ms 5248 KB Output is correct
46 Correct 11 ms 5376 KB Output is correct
47 Correct 11 ms 5424 KB Output is correct
48 Correct 11 ms 5376 KB Output is correct
49 Correct 9 ms 5632 KB Output is correct
50 Correct 7 ms 5504 KB Output is correct
51 Correct 8 ms 5504 KB Output is correct
52 Correct 11 ms 5504 KB Output is correct
53 Correct 12 ms 5504 KB Output is correct
54 Correct 12 ms 5504 KB Output is correct
55 Correct 12 ms 5504 KB Output is correct
56 Correct 9 ms 5504 KB Output is correct
57 Correct 14 ms 5376 KB Output is correct
58 Correct 14 ms 5376 KB Output is correct
59 Correct 14 ms 5376 KB Output is correct
60 Correct 13 ms 5376 KB Output is correct
61 Correct 10 ms 5504 KB Output is correct
62 Correct 10 ms 5376 KB Output is correct
63 Correct 10 ms 5504 KB Output is correct
64 Correct 10 ms 5376 KB Output is correct
65 Correct 11 ms 5376 KB Output is correct
66 Correct 11 ms 5376 KB Output is correct
67 Correct 12 ms 5376 KB Output is correct
68 Correct 9 ms 5504 KB Output is correct
69 Correct 12 ms 5504 KB Output is correct
70 Correct 13 ms 5504 KB Output is correct
71 Correct 9 ms 5504 KB Output is correct
72 Correct 14 ms 5376 KB Output is correct
73 Correct 14 ms 5376 KB Output is correct
74 Correct 10 ms 5504 KB Output is correct
75 Correct 9 ms 5376 KB Output is correct
76 Correct 9 ms 5376 KB Output is correct
77 Correct 9 ms 5376 KB Output is correct
78 Correct 8 ms 5376 KB Output is correct
79 Correct 9 ms 5376 KB Output is correct
80 Correct 9 ms 5376 KB Output is correct
81 Correct 9 ms 5376 KB Output is correct
82 Correct 9 ms 5376 KB Output is correct
83 Correct 9 ms 5376 KB Output is correct
84 Correct 8 ms 5376 KB Output is correct
85 Correct 9 ms 5376 KB Output is correct
86 Correct 8 ms 5376 KB Output is correct
87 Correct 21 ms 5760 KB Output is correct
88 Correct 61 ms 7376 KB Output is correct
89 Correct 226 ms 12188 KB Output is correct
90 Correct 253 ms 12240 KB Output is correct
91 Correct 230 ms 12124 KB Output is correct
92 Correct 117 ms 15732 KB Output is correct
93 Correct 125 ms 15712 KB Output is correct
94 Correct 129 ms 15696 KB Output is correct
95 Execution timed out 2053 ms 14476 KB Time limit exceeded
96 Halted 0 ms 0 KB -