oj.uz

Submission #100430

# Submission time Handle Problem Language Result Execution time Memory
100430 2019-03-11T09:31:20 Z JPN20 Construction of Highway (JOI18_construction) C++17
16 / 100
 2000 ms 18376 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int>dat; int size_ = 1;

void inits(int sz) {
	while (size_ <= sz) size_ *= 2;
	dat.resize(size_ * 2, 0);
}
void update(int pos, int x) {
	pos += size_;
	dat[pos] = x;
	
	while (pos >= 2) {
		pos >>= 1;
		dat[pos] = max(dat[pos * 2], dat[pos * 2 + 1]);
	}
}
int query_(int l, int r, int a, int b, int u) {
	if (l <= a && b <= r) return dat[u];
	if (b <= l || r <= a) return -(1 << 30);
	
	int s1 = query_(l, r, a, (a + b) >> 1, u * 2);
	int s2 = query_(l, r, (a + b) >> 1, b, u * 2 + 1);
	return max(s1, s2);
}
int query(int l, int r) {
	return query_(l, r, 0, size_, 1);
}

class BIT {
	public:
	vector<int>bit; int size1_;
	
	void init(int sz) {
		size1_ = sz + 2;
		bit.resize(size1_ + 1, 0);
	}
	void add(int pos, int x) {
		pos++;
		while (pos <= size1_) {
			bit[pos] += x; pos += (pos & -pos);
		}
	}
	int sum(int pos) {
		int s = 0; pos++;
		while (pos >= 1) {
			s += bit[pos]; pos -= (pos & -pos);
		}
		return s;
	}
};

long long check_inversions(vector<pair<int, int>> vec) {
	vector<int> A;
	for (int i = 0; i < (int)vec.size(); i++) A.push_back(vec[i].first);
	
	sort(A.begin(), A.end());
	A.erase(unique(A.begin(), A.end()), A.end());
	for (int i = 0; i < (int)vec.size(); i++) vec[i].first = lower_bound(A.begin(), A.end(), vec[i].first) - A.begin();
	
	BIT Z; Z.init(A.size() + 1);
	
	long long ans = 0;
	for (int i = 0; i < (int)vec.size(); i++) {
		ans += 1LL * vec[i].second * (Z.sum(A.size()) - Z.sum(vec[i].first));
		Z.add(vec[i].first, vec[i].second);
	}
	return ans;
}

int N, C[1 << 17], A[1 << 17], B[1 << 17], dist[1 << 17], dp[1 << 17][20];
int cl[1 << 17], cr[1 << 17], cnts;
vector<int> X[1 << 17];

void dfs(int pos, int dep) {
	cnts++; cl[pos] = cnts; dist[pos] = dep;
	for (int i = 0; i < (int)X[pos].size(); i++) {
		if (dist[X[pos][i]] != -1) continue;
		dp[X[pos][i]][0] = pos;
		dfs(X[pos][i], dep + 1);
	}
	cr[pos] = cnts;
}

int prevs(int pos, int x) {
	for (int i = 19; i >= 0; i--) {
		if (x >= (1 << i)) { x -= (1 << i); pos = dp[pos][i]; }
	}
	if (pos == 0) pos = 1;
	return pos;
}

vector<pair<int, int>> get_inverse(int pos) {
	vector<pair<int, int>> U;
	while (true) {
		// Binary Search.
		int L = 0, R = dist[pos] + 1, M, maxn = (1 << 30);
		int E = query(cl[pos], cr[pos] + 1);
		
		for (int i = 0; i < 20; i++) {
			M = (L + R) / 2;
			int G = prevs(pos, M);
			int P = query(cl[G], cr[G] + 1); //cout << "query(" << G << ") = " << P << endl;
			if (E != P) { maxn = min(maxn, M); R = M; }
			else { L = M; }
		}
		
		if (maxn == (1 << 30)) { U.push_back(make_pair(C[B[E]], dist[pos] + 1)); break; }
		U.push_back(make_pair(C[B[E]], maxn));
		pos = prevs(pos, maxn);
	}
	reverse(U.begin(), U.end());
	return U;
}

int main() {
	scanf("%d", &N);
	for (int i = 1; i <= N; i++) scanf("%d", &C[i]);
	for (int i = 1; i <= N - 1; i++) {
		scanf("%d%d", &A[i], &B[i]);
		X[A[i]].push_back(B[i]);
		X[B[i]].push_back(A[i]);
	}
	
	for (int i = 1; i <= N; i++) dist[i] = -1;
	dfs(1, 0);
	
	for (int i = 0; i < 19; i++) {
		for (int j = 1; j <= N; j++) dp[j][i + 1] = dp[dp[j][i]][i];
	}
	
	//for (int i = 1; i <= N; i++) cout << i << ": cl = " << cl[i] << ", cr = " << cr[i] << endl;
	
	inits(N + 2); update(cl[1], 0);
	for (int i = 1; i <= N - 1; i++) {
		vector<pair<int, int>> T = get_inverse(A[i]);
		
		printf("%lld\n", check_inversions(T));
		update(cl[B[i]], i);
	}
	return 0;
}

Compilation message

construction.cpp: In function 'int main()':
construction.cpp:118:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
construction.cpp:119:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= N; i++) scanf("%d", &C[i]);
                               ~~~~~^~~~~~~~~~~~~
construction.cpp:121: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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 4 ms 3456 KB Output is correct
3 Correct 5 ms 3456 KB Output is correct
4 Correct 8 ms 3584 KB Output is correct
5 Correct 9 ms 3556 KB Output is correct
6 Correct 10 ms 3456 KB Output is correct
7 Correct 12 ms 3584 KB Output is correct
8 Correct 7 ms 3584 KB Output is correct
9 Correct 7 ms 3584 KB Output is correct
10 Correct 8 ms 3584 KB Output is correct
11 Correct 9 ms 3584 KB Output is correct
12 Correct 9 ms 3584 KB Output is correct
13 Correct 11 ms 3584 KB Output is correct
14 Correct 11 ms 3584 KB Output is correct
15 Correct 15 ms 3584 KB Output is correct
16 Correct 18 ms 3584 KB Output is correct
17 Correct 16 ms 3584 KB Output is correct
18 Correct 16 ms 3584 KB Output is correct
19 Correct 10 ms 3456 KB Output is correct
20 Correct 9 ms 3584 KB Output is correct
21 Correct 9 ms 3616 KB Output is correct
22 Correct 12 ms 3584 KB Output is correct
23 Correct 11 ms 3584 KB Output is correct
24 Correct 10 ms 3456 KB Output is correct
25 Correct 10 ms 3456 KB Output is correct
26 Correct 9 ms 3584 KB Output is correct
27 Correct 8 ms 3584 KB Output is correct
28 Correct 9 ms 3628 KB Output is correct
29 Correct 8 ms 3448 KB Output is correct
30 Correct 13 ms 3456 KB Output is correct
31 Correct 16 ms 3584 KB Output is correct
32 Correct 12 ms 3584 KB Output is correct
33 Correct 9 ms 3584 KB Output is correct
34 Correct 10 ms 3584 KB Output is correct
35 Correct 8 ms 3584 KB Output is correct
36 Correct 8 ms 3456 KB Output is correct
37 Correct 8 ms 3584 KB Output is correct
38 Correct 8 ms 3584 KB Output is correct
39 Correct 9 ms 3584 KB Output is correct
40 Correct 9 ms 3584 KB Output is correct
41 Correct 8 ms 3456 KB Output is correct
42 Correct 7 ms 3456 KB Output is correct
43 Correct 8 ms 3584 KB Output is correct
44 Correct 9 ms 3456 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 4 ms 3456 KB Output is correct
3 Correct 5 ms 3456 KB Output is correct
4 Correct 8 ms 3584 KB Output is correct
5 Correct 9 ms 3556 KB Output is correct
6 Correct 10 ms 3456 KB Output is correct
7 Correct 12 ms 3584 KB Output is correct
8 Correct 7 ms 3584 KB Output is correct
9 Correct 7 ms 3584 KB Output is correct
10 Correct 8 ms 3584 KB Output is correct
11 Correct 9 ms 3584 KB Output is correct
12 Correct 9 ms 3584 KB Output is correct
13 Correct 11 ms 3584 KB Output is correct
14 Correct 11 ms 3584 KB Output is correct
15 Correct 15 ms 3584 KB Output is correct
16 Correct 18 ms 3584 KB Output is correct
17 Correct 16 ms 3584 KB Output is correct
18 Correct 16 ms 3584 KB Output is correct
19 Correct 10 ms 3456 KB Output is correct
20 Correct 9 ms 3584 KB Output is correct
21 Correct 9 ms 3616 KB Output is correct
22 Correct 12 ms 3584 KB Output is correct
23 Correct 11 ms 3584 KB Output is correct
24 Correct 10 ms 3456 KB Output is correct
25 Correct 10 ms 3456 KB Output is correct
26 Correct 9 ms 3584 KB Output is correct
27 Correct 8 ms 3584 KB Output is correct
28 Correct 9 ms 3628 KB Output is correct
29 Correct 8 ms 3448 KB Output is correct
30 Correct 13 ms 3456 KB Output is correct
31 Correct 16 ms 3584 KB Output is correct
32 Correct 12 ms 3584 KB Output is correct
33 Correct 9 ms 3584 KB Output is correct
34 Correct 10 ms 3584 KB Output is correct
35 Correct 8 ms 3584 KB Output is correct
36 Correct 8 ms 3456 KB Output is correct
37 Correct 8 ms 3584 KB Output is correct
38 Correct 8 ms 3584 KB Output is correct
39 Correct 9 ms 3584 KB Output is correct
40 Correct 9 ms 3584 KB Output is correct
41 Correct 8 ms 3456 KB Output is correct
42 Correct 7 ms 3456 KB Output is correct
43 Correct 8 ms 3584 KB Output is correct
44 Correct 9 ms 3456 KB Output is correct
45 Correct 17 ms 3672 KB Output is correct
46 Correct 62 ms 4096 KB Output is correct
47 Correct 86 ms 4344 KB Output is correct
48 Correct 78 ms 4120 KB Output is correct
49 Correct 26 ms 4224 KB Output is correct
50 Correct 28 ms 4224 KB Output is correct
51 Correct 26 ms 4224 KB Output is correct
52 Correct 36 ms 4216 KB Output is correct
53 Correct 33 ms 4224 KB Output is correct
54 Correct 33 ms 4216 KB Output is correct
55 Correct 33 ms 4216 KB Output is correct
56 Correct 32 ms 4096 KB Output is correct
57 Correct 130 ms 4100 KB Output is correct
58 Correct 161 ms 4216 KB Output is correct
59 Correct 132 ms 4096 KB Output is correct
60 Correct 140 ms 4148 KB Output is correct
61 Correct 36 ms 4096 KB Output is correct
62 Correct 36 ms 4216 KB Output is correct
63 Correct 35 ms 4216 KB Output is correct
64 Correct 66 ms 4088 KB Output is correct
65 Correct 67 ms 4088 KB Output is correct
66 Correct 68 ms 4096 KB Output is correct
67 Correct 91 ms 4096 KB Output is correct
68 Correct 25 ms 4272 KB Output is correct
69 Correct 31 ms 4216 KB Output is correct
70 Correct 32 ms 4216 KB Output is correct
71 Correct 38 ms 4224 KB Output is correct
72 Correct 141 ms 4188 KB Output is correct
73 Correct 127 ms 4216 KB Output is correct
74 Correct 39 ms 4216 KB Output is correct
75 Correct 33 ms 4148 KB Output is correct
76 Correct 51 ms 4096 KB Output is correct
77 Correct 36 ms 4224 KB Output is correct
78 Correct 49 ms 4096 KB Output is correct
79 Correct 35 ms 4096 KB Output is correct
80 Correct 33 ms 4096 KB Output is correct
81 Correct 50 ms 4096 KB Output is correct
82 Correct 51 ms 4216 KB Output is correct
83 Correct 43 ms 4096 KB Output is correct
84 Correct 40 ms 4096 KB Output is correct
85 Correct 42 ms 4184 KB Output is correct
86 Correct 43 ms 4096 KB Output is correct

Subtask #3
0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 4 ms 3456 KB Output is correct
3 Correct 5 ms 3456 KB Output is correct
4 Correct 8 ms 3584 KB Output is correct
5 Correct 9 ms 3556 KB Output is correct
6 Correct 10 ms 3456 KB Output is correct
7 Correct 12 ms 3584 KB Output is correct
8 Correct 7 ms 3584 KB Output is correct
9 Correct 7 ms 3584 KB Output is correct
10 Correct 8 ms 3584 KB Output is correct
11 Correct 9 ms 3584 KB Output is correct
12 Correct 9 ms 3584 KB Output is correct
13 Correct 11 ms 3584 KB Output is correct
14 Correct 11 ms 3584 KB Output is correct
15 Correct 15 ms 3584 KB Output is correct
16 Correct 18 ms 3584 KB Output is correct
17 Correct 16 ms 3584 KB Output is correct
18 Correct 16 ms 3584 KB Output is correct
19 Correct 10 ms 3456 KB Output is correct
20 Correct 9 ms 3584 KB Output is correct
21 Correct 9 ms 3616 KB Output is correct
22 Correct 12 ms 3584 KB Output is correct
23 Correct 11 ms 3584 KB Output is correct
24 Correct 10 ms 3456 KB Output is correct
25 Correct 10 ms 3456 KB Output is correct
26 Correct 9 ms 3584 KB Output is correct
27 Correct 8 ms 3584 KB Output is correct
28 Correct 9 ms 3628 KB Output is correct
29 Correct 8 ms 3448 KB Output is correct
30 Correct 13 ms 3456 KB Output is correct
31 Correct 16 ms 3584 KB Output is correct
32 Correct 12 ms 3584 KB Output is correct
33 Correct 9 ms 3584 KB Output is correct
34 Correct 10 ms 3584 KB Output is correct
35 Correct 8 ms 3584 KB Output is correct
36 Correct 8 ms 3456 KB Output is correct
37 Correct 8 ms 3584 KB Output is correct
38 Correct 8 ms 3584 KB Output is correct
39 Correct 9 ms 3584 KB Output is correct
40 Correct 9 ms 3584 KB Output is correct
41 Correct 8 ms 3456 KB Output is correct
42 Correct 7 ms 3456 KB Output is correct
43 Correct 8 ms 3584 KB Output is correct
44 Correct 9 ms 3456 KB Output is correct
45 Correct 17 ms 3672 KB Output is correct
46 Correct 62 ms 4096 KB Output is correct
47 Correct 86 ms 4344 KB Output is correct
48 Correct 78 ms 4120 KB Output is correct
49 Correct 26 ms 4224 KB Output is correct
50 Correct 28 ms 4224 KB Output is correct
51 Correct 26 ms 4224 KB Output is correct
52 Correct 36 ms 4216 KB Output is correct
53 Correct 33 ms 4224 KB Output is correct
54 Correct 33 ms 4216 KB Output is correct
55 Correct 33 ms 4216 KB Output is correct
56 Correct 32 ms 4096 KB Output is correct
57 Correct 130 ms 4100 KB Output is correct
58 Correct 161 ms 4216 KB Output is correct
59 Correct 132 ms 4096 KB Output is correct
60 Correct 140 ms 4148 KB Output is correct
61 Correct 36 ms 4096 KB Output is correct
62 Correct 36 ms 4216 KB Output is correct
63 Correct 35 ms 4216 KB Output is correct
64 Correct 66 ms 4088 KB Output is correct
65 Correct 67 ms 4088 KB Output is correct
66 Correct 68 ms 4096 KB Output is correct
67 Correct 91 ms 4096 KB Output is correct
68 Correct 25 ms 4272 KB Output is correct
69 Correct 31 ms 4216 KB Output is correct
70 Correct 32 ms 4216 KB Output is correct
71 Correct 38 ms 4224 KB Output is correct
72 Correct 141 ms 4188 KB Output is correct
73 Correct 127 ms 4216 KB Output is correct
74 Correct 39 ms 4216 KB Output is correct
75 Correct 33 ms 4148 KB Output is correct
76 Correct 51 ms 4096 KB Output is correct
77 Correct 36 ms 4224 KB Output is correct
78 Correct 49 ms 4096 KB Output is correct
79 Correct 35 ms 4096 KB Output is correct
80 Correct 33 ms 4096 KB Output is correct
81 Correct 50 ms 4096 KB Output is correct
82 Correct 51 ms 4216 KB Output is correct
83 Correct 43 ms 4096 KB Output is correct
84 Correct 40 ms 4096 KB Output is correct
85 Correct 42 ms 4184 KB Output is correct
86 Correct 43 ms 4096 KB Output is correct
87 Correct 182 ms 5112 KB Output is correct
88 Correct 696 ms 8052 KB Output is correct
89 Execution timed out 2064 ms 18376 KB Time limit exceeded
90 Halted 0 ms 0 KB -