제출 #225119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
225119		tictaccat	Pilot (NOI19_pilot)	C++14	100 / 100	756 ms	56216 KiB

pilot

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

int N,Q;
int H[2000000], l[2000000], r[2000000];
LL ans[2000000];
vector<pair<int,int>> QU, M;

LL pairs(LL n) {
    return n*(n-1)/2 + n;
}

int main() {

    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> N >> Q;
    for (int i = 0; i < N; i++) {
        cin >> H[i];
        M.emplace_back(H[i],i);
        l[i] = i+1;
        r[i] = i-1;
    }
    for (int i = 0; i < Q; i++) {
        int y; 
        cin >> y;
        QU.emplace_back(y,i);
    }

    sort(QU.begin(), QU.end());
    sort(M.begin(), M.end());
    int k = 0;
    LL cnt = 0;

    for (auto m: M) {
        int h,i;
        tie(h,i) = m;
        while (k < Q && QU[k].first < h) {
            ans[QU[k].second] = cnt;
            k++;
        }
        cnt += pairs(r[i]-l[i]-1);
        cnt -= pairs(r[i]-i-1);
        cnt -= pairs(i-l[i]-1);
        if (l[i] != -1) {
            l[r[i]] = l[i];
        }
        if (r[i] != N) {
            r[l[i]] = r[i];            
        }
    }

    while (k < Q) {
        ans[QU[k].second] = cnt;
        k++;
    }

    for (int i = 0; i < Q; i++) 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