oj.uz

Submission #706165

# Submission time Handle Problem Language Result Execution time Memory
706165 2023-03-06T03:10:53 Z LittleCube Reconstruction Project (JOI22_reconstruction) C++14
100 / 100
 2183 ms 62392 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N, M, Q, dsu[505], rk[505];
pll bit[100005];
pair<pii, ll> E[100005];
vector<int> w = {0};

pll operator+(pll p1, pll p2)
{
	return pll(p1.F + p2.F, p1.S + p2.S);
}

void modify(int pos, pll val)
{
	for (int i = pos; i <= M; i += (i & -i))
		bit[i] = bit[i] + val;
}

pll query(int pos)
{
	pll ans = pll(0, 0);
	for (int i = pos; i > 0; i -= (i & -i))
		ans = ans + bit[i];
	return ans;
}

inline int find(int k)
{
	return k == dsu[k] ? k : dsu[k] = find(dsu[k]);
}

bool merge(int u, int v)
{
	int ru = find(u), rv = find(v);
	if (ru == rv)
		return 0;
	if (rk[ru] < rk[rv])
		swap(ru, rv);
	dsu[rv] = ru;
	rk[ru] += rk[rv];
	return 1;
}

auto wsort = [](pair<pii, ll> p1, pair<pii, ll> p2)
{ return p1.S < p2.S; };

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	vector<tuple<ll, int, ll>> event;

	cin >> N >> M;
	for (int i = 1; i <= M; i++)
		cin >> E[i].F.F >> E[i].F.S >> E[i].S;
	sort(E + 1, E + 1 + M, wsort);
	E[0].S = -1e9, E[M + 1].S = 2e9;
	for (int i = 1; i <= M; i++)
	{
		w.emplace_back(E[i].S);
		for (int j = 1; j <= N; j++)
			dsu[j] = j, rk[j] = 1;
		int l = i - 1, r = i + 1;
		for (; l >= 1; l--)
		{
			merge(E[l].F.F, E[l].F.S);
			if (find(E[i].F.F) == find(E[i].F.S))
				break;
		}

		for (int j = 1; j <= N; j++)
			dsu[j] = j, rk[j] = 1;
		for (; r <= M; r++)
		{
			merge(E[r].F.F, E[r].F.S);
			if (find(E[i].F.F) == find(E[i].F.S))
				break;
		}
		event.emplace_back(make_tuple(E[i].S + E[l].S, 1, E[i].S));
 		event.emplace_back(make_tuple(E[i].S + E[r].S, 0, E[i].S));
	}

	cin >> Q;
	for (int i = 1; i <= Q; i++)
	{
		int q;
		cin >> q;
		event.emplace_back(make_tuple(q + q, 2, q));
	}
	sort(event.begin(), event.end());
	sort(w.begin(), w.end());
	w.resize(unique(w.begin(), w.end()) - w.begin());
	pll sum = pll(0, 0);
	for (auto [x, t, ww] : event)
	{
		// cerr << x << ' ' << t << ' ' << ww << '\n';
		if (t == 0)
		{
			sum = sum + pll(-1, -ww);
			modify(lower_bound(w.begin(), w.end(), ww) - w.begin(), pll(-1, -ww));
		}
		else if (t == 1)
		{
			sum = sum + pll(1, ww);
			modify(lower_bound(w.begin(), w.end(), ww) - w.begin(), pll(1, ww));
		}
		else 
		{
			pll L = query(upper_bound(w.begin(), w.end(), ww) - w.begin() - 1), R = pll(sum.F - L.F, sum.S - L.S);
			cout << ww * L.F - L.S + R.S - ww * R.F << '\n';
		}
	}
}

Compilation message

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:102:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  102 |  for (auto [x, t, ww] : event)
      |            ^

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1682 ms 10820 KB Output is correct
21 Correct 1316 ms 10856 KB Output is correct
22 Correct 1379 ms 10688 KB Output is correct
23 Correct 1482 ms 10744 KB Output is correct
24 Correct 1642 ms 10728 KB Output is correct
25 Correct 1629 ms 10956 KB Output is correct
26 Correct 1660 ms 10704 KB Output is correct
27 Correct 1720 ms 10684 KB Output is correct
28 Correct 1652 ms 10584 KB Output is correct
29 Correct 1667 ms 10588 KB Output is correct
30 Correct 1672 ms 10716 KB Output is correct
31 Correct 1685 ms 10884 KB Output is correct
32 Correct 1679 ms 10800 KB Output is correct
33 Correct 1679 ms 10788 KB Output is correct
34 Correct 1651 ms 10768 KB Output is correct
35 Correct 1702 ms 10772 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1832 ms 62152 KB Output is correct
5 Correct 1810 ms 62328 KB Output is correct
6 Correct 1800 ms 62216 KB Output is correct
7 Correct 1059 ms 62392 KB Output is correct
8 Correct 812 ms 62148 KB Output is correct
9 Correct 732 ms 62152 KB Output is correct
10 Correct 1815 ms 62296 KB Output is correct
11 Correct 737 ms 62192 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 321 ms 45856 KB Output is correct
21 Correct 315 ms 46216 KB Output is correct
22 Correct 319 ms 45912 KB Output is correct
23 Correct 315 ms 46000 KB Output is correct
24 Correct 320 ms 45972 KB Output is correct
25 Correct 310 ms 45912 KB Output is correct
26 Correct 310 ms 45964 KB Output is correct
27 Correct 302 ms 45988 KB Output is correct
28 Correct 311 ms 45876 KB Output is correct
29 Correct 316 ms 45904 KB Output is correct
30 Correct 315 ms 45992 KB Output is correct
31 Correct 344 ms 46032 KB Output is correct
32 Correct 308 ms 46480 KB Output is correct
33 Correct 333 ms 45840 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1682 ms 10820 KB Output is correct
21 Correct 1316 ms 10856 KB Output is correct
22 Correct 1379 ms 10688 KB Output is correct
23 Correct 1482 ms 10744 KB Output is correct
24 Correct 1642 ms 10728 KB Output is correct
25 Correct 1629 ms 10956 KB Output is correct
26 Correct 1660 ms 10704 KB Output is correct
27 Correct 1720 ms 10684 KB Output is correct
28 Correct 1652 ms 10584 KB Output is correct
29 Correct 1667 ms 10588 KB Output is correct
30 Correct 1672 ms 10716 KB Output is correct
31 Correct 1685 ms 10884 KB Output is correct
32 Correct 1679 ms 10800 KB Output is correct
33 Correct 1679 ms 10788 KB Output is correct
34 Correct 1651 ms 10768 KB Output is correct
35 Correct 1702 ms 10772 KB Output is correct
36 Correct 1672 ms 11612 KB Output is correct
37 Correct 1315 ms 11724 KB Output is correct
38 Correct 1408 ms 11924 KB Output is correct
39 Correct 1491 ms 11688 KB Output is correct
40 Correct 1636 ms 11884 KB Output is correct
41 Correct 1628 ms 11880 KB Output is correct
42 Correct 1665 ms 11864 KB Output is correct
43 Correct 1687 ms 11536 KB Output is correct
44 Correct 1662 ms 10888 KB Output is correct
45 Correct 1658 ms 10676 KB Output is correct
46 Correct 1685 ms 11560 KB Output is correct
47 Correct 1684 ms 11632 KB Output is correct
48 Correct 1672 ms 11732 KB Output is correct
49 Correct 1755 ms 11628 KB Output is correct
50 Correct 1718 ms 10888 KB Output is correct
51 Correct 1734 ms 11600 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1682 ms 10820 KB Output is correct
21 Correct 1316 ms 10856 KB Output is correct
22 Correct 1379 ms 10688 KB Output is correct
23 Correct 1482 ms 10744 KB Output is correct
24 Correct 1642 ms 10728 KB Output is correct
25 Correct 1629 ms 10956 KB Output is correct
26 Correct 1660 ms 10704 KB Output is correct
27 Correct 1720 ms 10684 KB Output is correct
28 Correct 1652 ms 10584 KB Output is correct
29 Correct 1667 ms 10588 KB Output is correct
30 Correct 1672 ms 10716 KB Output is correct
31 Correct 1685 ms 10884 KB Output is correct
32 Correct 1679 ms 10800 KB Output is correct
33 Correct 1679 ms 10788 KB Output is correct
34 Correct 1651 ms 10768 KB Output is correct
35 Correct 1702 ms 10772 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1832 ms 62152 KB Output is correct
40 Correct 1810 ms 62328 KB Output is correct
41 Correct 1800 ms 62216 KB Output is correct
42 Correct 1059 ms 62392 KB Output is correct
43 Correct 812 ms 62148 KB Output is correct
44 Correct 732 ms 62152 KB Output is correct
45 Correct 1815 ms 62296 KB Output is correct
46 Correct 737 ms 62192 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 321 ms 45856 KB Output is correct
49 Correct 315 ms 46216 KB Output is correct
50 Correct 319 ms 45912 KB Output is correct
51 Correct 315 ms 46000 KB Output is correct
52 Correct 320 ms 45972 KB Output is correct
53 Correct 310 ms 45912 KB Output is correct
54 Correct 310 ms 45964 KB Output is correct
55 Correct 302 ms 45988 KB Output is correct
56 Correct 311 ms 45876 KB Output is correct
57 Correct 316 ms 45904 KB Output is correct
58 Correct 315 ms 45992 KB Output is correct
59 Correct 344 ms 46032 KB Output is correct
60 Correct 308 ms 46480 KB Output is correct
61 Correct 333 ms 45840 KB Output is correct
62 Correct 1672 ms 11612 KB Output is correct
63 Correct 1315 ms 11724 KB Output is correct
64 Correct 1408 ms 11924 KB Output is correct
65 Correct 1491 ms 11688 KB Output is correct
66 Correct 1636 ms 11884 KB Output is correct
67 Correct 1628 ms 11880 KB Output is correct
68 Correct 1665 ms 11864 KB Output is correct
69 Correct 1687 ms 11536 KB Output is correct
70 Correct 1662 ms 10888 KB Output is correct
71 Correct 1658 ms 10676 KB Output is correct
72 Correct 1685 ms 11560 KB Output is correct
73 Correct 1684 ms 11632 KB Output is correct
74 Correct 1672 ms 11732 KB Output is correct
75 Correct 1755 ms 11628 KB Output is correct
76 Correct 1718 ms 10888 KB Output is correct
77 Correct 1734 ms 11600 KB Output is correct
78 Correct 2068 ms 62156 KB Output is correct
79 Correct 1638 ms 62316 KB Output is correct
80 Correct 1758 ms 62144 KB Output is correct
81 Correct 2091 ms 62096 KB Output is correct
82 Correct 2017 ms 62196 KB Output is correct
83 Correct 2033 ms 62132 KB Output is correct
84 Correct 2161 ms 62068 KB Output is correct
85 Correct 2093 ms 62268 KB Output is correct
86 Correct 2037 ms 62220 KB Output is correct
87 Correct 1988 ms 62120 KB Output is correct
88 Correct 2183 ms 62148 KB Output is correct
89 Correct 2097 ms 62084 KB Output is correct
90 Correct 2052 ms 62320 KB Output is correct
91 Correct 2017 ms 61980 KB Output is correct
92 Correct 1892 ms 62176 KB Output is correct
93 Correct 1964 ms 62252 KB Output is correct