oj.uz

답안 #113424

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113424 2019-05-25T14:06:13 Z RockyB Construction of Highway (JOI18_construction) C++17
7 / 100
 2000 ms 3460 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];
void dfs_sz(int v = 1, int p = 0) {
	sz[v]++;
	par[v] = p;
	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);
		}
	}
}
void dfs(int v = 1) {
	for (auto to : g[v]) {
		up[to] = (to == g[v][0] ? up[v] : to);
	}
}
void calc(int v, int u) {
	vector <int> path;
	while (v) {
		path.pb(v);
		v = par[v];
	}
	reverse(all(path));
	ll cnt = 0;
	rep(i, 0, sz(path) - 1) {
		rep(j, i + 1, sz(path) - 1) {
			if (a[path[i]] > a[path[j]]) ++cnt;
		}
		a[path[i]] = a[u];
	}
	cout << cnt << nl;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#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);
		g[e[i].s].pb(e[i].f);
	}
	dfs_sz();
	up[1] = 1;
	dfs();
	rep(i, 2, n) {
		calc(e[i].f, e[i].s);
	}
	ioi
}

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 5 ms 2816 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 5 ms 2688 KB Output is correct
8 Correct 21 ms 2816 KB Output is correct
9 Correct 23 ms 2816 KB Output is correct
10 Correct 21 ms 2816 KB Output is correct
11 Correct 9 ms 2688 KB Output is correct
12 Correct 9 ms 2816 KB Output is correct
13 Correct 10 ms 2816 KB Output is correct
14 Correct 10 ms 2688 KB Output is correct
15 Correct 5 ms 2816 KB Output is correct
16 Correct 5 ms 2816 KB Output is correct
17 Correct 5 ms 2816 KB Output is correct
18 Correct 23 ms 2816 KB Output is correct
19 Correct 10 ms 2816 KB Output is correct
20 Correct 10 ms 2688 KB Output is correct
21 Correct 9 ms 2688 KB Output is correct
22 Correct 5 ms 2816 KB Output is correct
23 Correct 5 ms 2688 KB Output is correct
24 Correct 4 ms 2688 KB Output is correct
25 Correct 5 ms 2816 KB Output is correct
26 Correct 23 ms 2816 KB Output is correct
27 Correct 10 ms 2816 KB Output is correct
28 Correct 10 ms 2816 KB Output is correct
29 Correct 10 ms 2688 KB Output is correct
30 Correct 4 ms 2816 KB Output is correct
31 Correct 4 ms 2688 KB Output is correct
32 Correct 9 ms 2688 KB Output is correct
33 Correct 6 ms 2816 KB Output is correct
34 Correct 5 ms 2688 KB Output is correct
35 Correct 5 ms 2688 KB Output is correct
36 Correct 6 ms 2816 KB Output is correct
37 Correct 5 ms 2816 KB Output is correct
38 Correct 5 ms 2816 KB Output is correct
39 Correct 6 ms 2816 KB Output is correct
40 Correct 5 ms 2816 KB Output is correct
41 Correct 5 ms 2816 KB Output is correct
42 Correct 6 ms 2816 KB Output is correct
43 Correct 5 ms 2816 KB Output is correct
44 Correct 5 ms 2816 KB Output is correct
45 Correct 4 ms 2816 KB Output is correct
46 Correct 7 ms 3072 KB Output is correct
47 Correct 7 ms 3072 KB Output is correct
48 Correct 7 ms 3072 KB Output is correct
49 Execution timed out 2058 ms 3460 KB Time limit exceeded
50 Halted 0 ms 0 KB -

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 5 ms 2816 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 5 ms 2688 KB Output is correct
8 Correct 21 ms 2816 KB Output is correct
9 Correct 23 ms 2816 KB Output is correct
10 Correct 21 ms 2816 KB Output is correct
11 Correct 9 ms 2688 KB Output is correct
12 Correct 9 ms 2816 KB Output is correct
13 Correct 10 ms 2816 KB Output is correct
14 Correct 10 ms 2688 KB Output is correct
15 Correct 5 ms 2816 KB Output is correct
16 Correct 5 ms 2816 KB Output is correct
17 Correct 5 ms 2816 KB Output is correct
18 Correct 23 ms 2816 KB Output is correct
19 Correct 10 ms 2816 KB Output is correct
20 Correct 10 ms 2688 KB Output is correct
21 Correct 9 ms 2688 KB Output is correct
22 Correct 5 ms 2816 KB Output is correct
23 Correct 5 ms 2688 KB Output is correct
24 Correct 4 ms 2688 KB Output is correct
25 Correct 5 ms 2816 KB Output is correct
26 Correct 23 ms 2816 KB Output is correct
27 Correct 10 ms 2816 KB Output is correct
28 Correct 10 ms 2816 KB Output is correct
29 Correct 10 ms 2688 KB Output is correct
30 Correct 4 ms 2816 KB Output is correct
31 Correct 4 ms 2688 KB Output is correct
32 Correct 9 ms 2688 KB Output is correct
33 Correct 6 ms 2816 KB Output is correct
34 Correct 5 ms 2688 KB Output is correct
35 Correct 5 ms 2688 KB Output is correct
36 Correct 6 ms 2816 KB Output is correct
37 Correct 5 ms 2816 KB Output is correct
38 Correct 5 ms 2816 KB Output is correct
39 Correct 6 ms 2816 KB Output is correct
40 Correct 5 ms 2816 KB Output is correct
41 Correct 5 ms 2816 KB Output is correct
42 Correct 6 ms 2816 KB Output is correct
43 Correct 5 ms 2816 KB Output is correct
44 Correct 5 ms 2816 KB Output is correct
45 Correct 4 ms 2816 KB Output is correct
46 Correct 7 ms 3072 KB Output is correct
47 Correct 7 ms 3072 KB Output is correct
48 Correct 7 ms 3072 KB Output is correct
49 Execution timed out 2058 ms 3460 KB Time limit exceeded
50 Halted 0 ms 0 KB -