제출 #894916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894916		votranngocvy	Pilot (NOI19_pilot)	C++14	18 / 100	25 ms	11640 KiB

pilot

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

#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
const int N = 1e6 + 5;
pii a[N];
int b[N],par[N],sz[N],ans;
bool f[N];

void make_set(int v) {
    par[v] = v;
    sz[v] = 1;
}

int find_set(int v) {
    if (v == par[v]) return v;
    int p = find_set(par[v]);
    par[v] = p;
    return p;
}

void union_sets(int a,int b) {
    a = find_set(a),b = find_set(b);
    if (a == b) return;
    ans -= (sz[a] * (sz[a] + 1)) / 2 + (sz[b] * (sz[b] + 1)) / 2;
    if (sz[a] < sz[b]) swap(a,b);
    sz[a] += sz[b];
    par[b] = a;
    ans += (sz[a] * (sz[a] + 1)) / 2;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n,q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].fi;
        a[i].se = i;
    }
    sort(a + 1,a + n + 1);
    for (int i = 1; i <= q; i++) cin >> b[i];
    sort(b + 1,b + q + 1);
    int j = 1;
    for (int i = 1; i <= n; i++) make_set(i);
    for (int i = 1; i <=  q; i++) {
        while (j <= n && a[j].fi <= b[i]) {
            ans++;
            if (a[j].se > 1 && f[a[j].se - 1]) union_sets(a[j].se,a[j].se - 1);
            if (a[j].se < n && f[a[j].se + 1]) union_sets(a[j].se,a[j].se + 1);
            f[a[j].se] = true;
            j++;
        }
        cout << ans << "\n";
    }
}

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