oj.uz

Submission #544511

# Submission time Handle Problem Language Result Execution time Memory
544511 2022-04-02T07:03:22 Z model_code Reconstruction Project (JOI22_reconstruction) C++17
100 / 100
 1948 ms 18400 KB 
#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

struct UnionFind {
	int n;
	std::vector<int> a;
	UnionFind (int n) : n(n), a(n, -1) {}
	int root(int i) { return a[i] < 0 ? i : a[i] = root(a[i]); }
	bool unite(int x, int y) {
		x = root(x);
		y = root(y);
		if (x == y) return false;
		if (a[x] > a[y]) std::swap(x, y);
		a[x] += a[y];
		a[y] = x;
		return true;
	}
	bool same(int x, int y) { return root(x) == root(y); }
};

int main() {
	int n = ri();
	int m = ri();
	struct Hen {
		int a;
		int b;
		int c;
	};
	std::vector<Hen> hens(m);
	for (auto &i : hens) i.a = ri() - 1, i.b = ri() - 1, i.c = ri();
	
	std::sort(hens.begin(), hens.end(), [] (auto &i, auto &j) { return i.c < j.c; });
	
	// if the overall cost is ax + b, `add` is a list of
	//    {the value of x where the change occurs, {the change in a, the change in b}}
	std::vector<std::pair<int, std::pair<int, int> > > add;
	for (int i = 0; i < m; i++) {
		int cur_cost = hens[i].c;
		
		UnionFind uni(n);
		int j;
		for (j = i + 1; j < m; j++) {
			uni.unite(hens[j].a, hens[j].b);
			if (uni.same(hens[i].a, hens[i].b)) break;
		}
		int r = j;
		int r_value = r == m ? 1000000001 : cur_cost + (hens[r].c - cur_cost + 1) / 2;
		
		uni = UnionFind(n);
		for (j = i - 1; j >= 0; j--) {
			uni.unite(hens[j].a, hens[j].b);
			if (uni.same(hens[i].a, hens[i].b)) break;
		}
		int l = j;
		int l_value = l == -1 ? -1 : cur_cost - (cur_cost - hens[l].c) / 2;
		
		add.push_back({l_value, {-1, hens[i].c}}); // edge starting to be used (cost : 0 -> (hens[i].c - x))
		add.push_back({cur_cost, {2, -2 * hens[i].c}}); // at x == cur_cost (cost : (hens[i].c - x) -> (x - hens[i].c))
		add.push_back({r_value, {-1, hens[i].c}}); // edge ceasing to be used (cost : (x - hens[i].c) -> 0)
	}
	std::sort(add.begin(), add.end());
	
	size_t head = 0;
	int coeff = 0;
	int64_t constant = 0;
	int q = ri();
	for (int i = 0; i < q; i++) {
		int x = ri();
		
		while (head < add.size() && add[head].first <= x) {
			coeff += add[head].second.first;
			constant += add[head].second.second;
			head++;
		}
		
		printf("%" PRId64 "\n", constant + (int64_t) x * coeff);
	}
	
	return 0;
}

Compilation message

reconstruction.cpp: In function 'int ri()':
reconstruction.cpp:5:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1759 ms 7728 KB Output is correct
21 Correct 1216 ms 7672 KB Output is correct
22 Correct 1238 ms 7792 KB Output is correct
23 Correct 1381 ms 7708 KB Output is correct
24 Correct 1606 ms 7704 KB Output is correct
25 Correct 1626 ms 7764 KB Output is correct
26 Correct 1669 ms 7720 KB Output is correct
27 Correct 1664 ms 7664 KB Output is correct
28 Correct 1644 ms 7704 KB Output is correct
29 Correct 1644 ms 7708 KB Output is correct
30 Correct 1644 ms 7700 KB Output is correct
31 Correct 1658 ms 7684 KB Output is correct
32 Correct 1671 ms 7768 KB Output is correct
33 Correct 1637 ms 7680 KB Output is correct
34 Correct 1608 ms 7744 KB Output is correct
35 Correct 1659 ms 7728 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1616 ms 16152 KB Output is correct
5 Correct 1610 ms 16164 KB Output is correct
6 Correct 1626 ms 16140 KB Output is correct
7 Correct 936 ms 18112 KB Output is correct
8 Correct 734 ms 18288 KB Output is correct
9 Correct 678 ms 18092 KB Output is correct
10 Correct 1639 ms 16088 KB Output is correct
11 Correct 739 ms 18400 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 308 ms 12644 KB Output is correct
21 Correct 302 ms 12748 KB Output is correct
22 Correct 296 ms 12592 KB Output is correct
23 Correct 288 ms 12660 KB Output is correct
24 Correct 295 ms 12596 KB Output is correct
25 Correct 289 ms 12572 KB Output is correct
26 Correct 292 ms 12604 KB Output is correct
27 Correct 291 ms 12620 KB Output is correct
28 Correct 276 ms 12588 KB Output is correct
29 Correct 285 ms 12632 KB Output is correct
30 Correct 272 ms 12596 KB Output is correct
31 Correct 277 ms 12616 KB Output is correct
32 Correct 296 ms 13204 KB Output is correct
33 Correct 285 ms 12388 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1759 ms 7728 KB Output is correct
21 Correct 1216 ms 7672 KB Output is correct
22 Correct 1238 ms 7792 KB Output is correct
23 Correct 1381 ms 7708 KB Output is correct
24 Correct 1606 ms 7704 KB Output is correct
25 Correct 1626 ms 7764 KB Output is correct
26 Correct 1669 ms 7720 KB Output is correct
27 Correct 1664 ms 7664 KB Output is correct
28 Correct 1644 ms 7704 KB Output is correct
29 Correct 1644 ms 7708 KB Output is correct
30 Correct 1644 ms 7700 KB Output is correct
31 Correct 1658 ms 7684 KB Output is correct
32 Correct 1671 ms 7768 KB Output is correct
33 Correct 1637 ms 7680 KB Output is correct
34 Correct 1608 ms 7744 KB Output is correct
35 Correct 1659 ms 7728 KB Output is correct
36 Correct 1658 ms 7740 KB Output is correct
37 Correct 1174 ms 7648 KB Output is correct
38 Correct 1234 ms 7732 KB Output is correct
39 Correct 1366 ms 7748 KB Output is correct
40 Correct 1579 ms 7792 KB Output is correct
41 Correct 1573 ms 7724 KB Output is correct
42 Correct 1624 ms 7736 KB Output is correct
43 Correct 1645 ms 7696 KB Output is correct
44 Correct 1610 ms 7784 KB Output is correct
45 Correct 1620 ms 7732 KB Output is correct
46 Correct 1625 ms 7672 KB Output is correct
47 Correct 1630 ms 7704 KB Output is correct
48 Correct 1655 ms 7760 KB Output is correct
49 Correct 1697 ms 7696 KB Output is correct
50 Correct 1654 ms 7660 KB Output is correct
51 Correct 1690 ms 7712 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1759 ms 7728 KB Output is correct
21 Correct 1216 ms 7672 KB Output is correct
22 Correct 1238 ms 7792 KB Output is correct
23 Correct 1381 ms 7708 KB Output is correct
24 Correct 1606 ms 7704 KB Output is correct
25 Correct 1626 ms 7764 KB Output is correct
26 Correct 1669 ms 7720 KB Output is correct
27 Correct 1664 ms 7664 KB Output is correct
28 Correct 1644 ms 7704 KB Output is correct
29 Correct 1644 ms 7708 KB Output is correct
30 Correct 1644 ms 7700 KB Output is correct
31 Correct 1658 ms 7684 KB Output is correct
32 Correct 1671 ms 7768 KB Output is correct
33 Correct 1637 ms 7680 KB Output is correct
34 Correct 1608 ms 7744 KB Output is correct
35 Correct 1659 ms 7728 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1616 ms 16152 KB Output is correct
40 Correct 1610 ms 16164 KB Output is correct
41 Correct 1626 ms 16140 KB Output is correct
42 Correct 936 ms 18112 KB Output is correct
43 Correct 734 ms 18288 KB Output is correct
44 Correct 678 ms 18092 KB Output is correct
45 Correct 1639 ms 16088 KB Output is correct
46 Correct 739 ms 18400 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 308 ms 12644 KB Output is correct
49 Correct 302 ms 12748 KB Output is correct
50 Correct 296 ms 12592 KB Output is correct
51 Correct 288 ms 12660 KB Output is correct
52 Correct 295 ms 12596 KB Output is correct
53 Correct 289 ms 12572 KB Output is correct
54 Correct 292 ms 12604 KB Output is correct
55 Correct 291 ms 12620 KB Output is correct
56 Correct 276 ms 12588 KB Output is correct
57 Correct 285 ms 12632 KB Output is correct
58 Correct 272 ms 12596 KB Output is correct
59 Correct 277 ms 12616 KB Output is correct
60 Correct 296 ms 13204 KB Output is correct
61 Correct 285 ms 12388 KB Output is correct
62 Correct 1658 ms 7740 KB Output is correct
63 Correct 1174 ms 7648 KB Output is correct
64 Correct 1234 ms 7732 KB Output is correct
65 Correct 1366 ms 7748 KB Output is correct
66 Correct 1579 ms 7792 KB Output is correct
67 Correct 1573 ms 7724 KB Output is correct
68 Correct 1624 ms 7736 KB Output is correct
69 Correct 1645 ms 7696 KB Output is correct
70 Correct 1610 ms 7784 KB Output is correct
71 Correct 1620 ms 7732 KB Output is correct
72 Correct 1625 ms 7672 KB Output is correct
73 Correct 1630 ms 7704 KB Output is correct
74 Correct 1655 ms 7760 KB Output is correct
75 Correct 1697 ms 7696 KB Output is correct
76 Correct 1654 ms 7660 KB Output is correct
77 Correct 1690 ms 7712 KB Output is correct
78 Correct 1907 ms 15068 KB Output is correct
79 Correct 1404 ms 17108 KB Output is correct
80 Correct 1480 ms 16152 KB Output is correct
81 Correct 1642 ms 16068 KB Output is correct
82 Correct 1834 ms 15232 KB Output is correct
83 Correct 1847 ms 15412 KB Output is correct
84 Correct 1903 ms 15140 KB Output is correct
85 Correct 1922 ms 15300 KB Output is correct
86 Correct 1925 ms 15160 KB Output is correct
87 Correct 1924 ms 16664 KB Output is correct
88 Correct 1905 ms 15056 KB Output is correct
89 Correct 1907 ms 15316 KB Output is correct
90 Correct 1887 ms 15112 KB Output is correct
91 Correct 1948 ms 15204 KB Output is correct
92 Correct 1919 ms 17844 KB Output is correct
93 Correct 1904 ms 16224 KB Output is correct