Submission #843583

#	Time	Username	Problem	Language	Result	Execution time	Memory
843583		fanwen	Pilot (NOI19_pilot)	C++17	100 / 100	419 ms	52392 KiB

pilot

#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

long long f(int x) { return 1LL * x * (x - 1) / 2; }

struct disjoint_set {
    vector <int> lab;
    disjoint_set (int n = 0) : lab(n + 1, -1) {}
    int find(int u) { return lab[u] < 0 ? u : lab[u] = find(lab[u]); }
    bool merge(int u, int v) {
        u = find(u); v = find(v);
        if(u == v) return false;
        if(lab[u] > lab[v]) swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        return true;
    }
    bool same_component (int u, int v) { return find(u) == find(v); }
    int component_size(int i) { return -lab[find(i)]; } 
};

const int MAXN = 1e6 + 5;

int N, Q, dd[MAXN];
long long ans[MAXN], total_pair;
pair <int, int> a[MAXN], q[MAXN];

void you_make_it(void) {
	cin >> N >> Q;
	FOR(i, 1, N) cin >> a[i].first, a[i].second = i;
	FOR(i, 1, Q) cin >> q[i].first, q[i].second = i;
	sort(a + 1, a + N + 1), sort(q + 1, q + Q + 1);
	int j = 0;
	disjoint_set dsu(N);

	auto merge = [&] (int u, int v) {
		int a = dsu.component_size(u), b = dsu.component_size(v);
		if(dsu.merge(u, v)) {
			total_pair -= f(a) + f(b);
			total_pair += f(a + b);
		}
	};
	auto add = [&] (int i) {
		dd[i] = 1;
		if(i < N and dd[i + 1]) merge(i, i + 1);
		if(i > 1 and dd[i - 1]) merge(i, i - 1);
	};
	FOR(i, 1, Q) {
		auto [x, id] = q[i];
		while(j <= N and a[j].first <= x) {
			add(a[j++].second);
		}
		ans[id] = total_pair + j - 1;
	}
	FOR(i, 1, Q) cout << ans[i] << '\n';
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

• 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: 11 / 11