Submission #538918

#	Time	Username	Problem	Language	Result	Execution time	Memory
538918		_karan_gandhi	Pilot (NOI19_pilot)	C++17	89 / 100	1074 ms	111544 KiB

pilot

#include <bits/stdc++.h>
using namespace std;

#define all(v) v.begin(), v.end()
#define endl '\n'
#define pl(var) " [" << #var << ": " << (var) << "] "
#define ll long long

ll int cnt = 0;

struct DSU {
	vector<ll int> p, s;

	void init(ll int n) {
		p = vector<ll int>(n);
		s = vector<ll int>(n, 1);
		iota(all(p), 0);
	}

	ll int get(ll int x) {
		return p[x] = (p[x] == x ? x : get(p[x]));
	}

	void unite(ll int a, ll int b) {
		if (a == b) {
			cnt++;
			return;
		}
		a = get(a);
		b = get(b);


		if (a == b) {
			return;
		}

		if (s[a] > s[b]) swap(a, b);
		p[a] = b;
		cnt += s[b] * s[a];
		s[b] += s[a];
	}
};

void solve() {
	ll int n; cin >> n;
	ll int q; cin >> q;

	vector<ll int> arr(n); for (ll int i = 0; i < n; i++) cin >> arr[i];
	vector<pair<ll int, pair<ll int, ll int>>> edges;

	for (ll int i = 1; i < n; i++) {
		edges.emplace_back(max(arr[i], arr[i - 1]), make_pair(i, i - 1));
	}

	for (ll int i = 0; i < n; i++) {
		edges.emplace_back(arr[i], make_pair(i, i));
	}


	sort(all(edges));

	vector<pair<ll int, ll int>> qq;
	for (ll int i = 0; i < q; i++) {
		ll int a; cin >> a;
		qq.emplace_back(a, i);
	}
	// cout << "Hello" << endl;

	sort(all(qq));

	vector<ll int> ans(q);
	ll int ptr = 0;

	DSU dsu;
	dsu.init(n);

	for (ll int i = 0; i < q; i++) {
		ll int hi = qq[i].first;
		// cout << pl(hi) << endl;
		
		while (ptr < int(edges.size()) && edges[ptr].first <= hi) {
			dsu.unite(edges[ptr].second.first, edges[ptr].second.second);
			// cout << pl(edges[ptr].first) << pl(edges[ptr].second.first) << pl(edges[ptr].second.second) << pl(cnt) << endl;
			ptr++;
		}

		ans[qq[i].second] = cnt;
	}

	for (ll int a : ans) {
		cout << a << endl;
	}
}

int main() {
	// ios::sync_with_stdio(false);
	// cin.tie(nullptr);

	ll int T = 1;
	// cin >> T;
	while (T--)
		solve();
}

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 0 / 11