제출 #236345

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
236345		dolphingarlic	Pilot (NOI19_pilot)	C++14	100 / 100	655 ms	56256 KiB

pilot

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

ll curr = 0, sz[1000002], ans[1000002];
int cmp[1000002];

int find(int A) {
    while (A != cmp[A]) A = cmp[A], cmp[A] = cmp[cmp[A]];
    return A;
}

void onion(int A, int B) {
    A = find(A), B = find(B);
    curr += sz[A] * sz[B];
    sz[A] += sz[B];
    cmp[B] = A;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    vector<pair<int, int>> events;
    FOR(i, 1, n + 1) {
        int h;
        cin >> h;
        events.push_back({h, -i});
    }
    FOR(i, 1, q + 1) {
        int h;
        cin >> h;
        events.push_back({h, i});
    }
    sort(events.begin(), events.end());

    for (pair<int, int> i : events) {
        if (i.second > 0) ans[i.second] = curr;
        else {
            curr++;
            cmp[-i.second] = -i.second;
            sz[-i.second] = 1;
            if (cmp[-i.second - 1]) onion(-i.second, -i.second - 1);
            if (cmp[-i.second + 1]) onion(-i.second, -i.second + 1);
        }
    }

    FOR(i, 1, q + 1) cout << ans[i] << '\n';
    return 0;
}

• 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