Submission #951604

#	Time	Username	Problem	Language	Result	Execution time	Memory
951604		Irate	Pilot (NOI19_pilot)	C++17	100 / 100	904 ms	137024 KiB

pilot

#include<bits/stdc++.h>
using namespace std;
struct Node{
    long long num_of_intervals = 0;
    int pref = 0, suff = 0, len = 0;
};
struct SegmentTree{
    vector<Node>sTree;
    SegmentTree(int n){
        sTree.resize(4 * n);
    }
    void Build(int node, int l, int r){
        if(l == r){
            sTree[node] = {0, 0, 0, 1};
        }
        else{
            int mid = (l + r) >> 1;
            Build(node * 2, l, mid);
            Build(node * 2 + 1, mid + 1, r);
            sTree[node].len = sTree[node * 2].len + sTree[node * 2 + 1].len;
        }
    }
    Node Merge(Node &left, Node &right){
        Node res;
        res.len = left.len + right.len;
        res.pref = left.pref;
        if(left.pref == left.len) res.pref += right.pref;
        res.suff = right.suff;
        if(right.suff == right.len) res.suff += left.suff;
        res.num_of_intervals = left.num_of_intervals + right.num_of_intervals;
        res.num_of_intervals -= (long long)right.pref * (right.pref + 1) / 2 + (long long)left.suff * (left.suff + 1) / 2;
        res.num_of_intervals += ((long long)right.pref + left.suff) * (right.pref + left.suff + 1) / 2;
        return res;
    }
    void Update(int node, int l, int r, int pos){
        if(l == r){
            sTree[node] = {1, 1, 1, 1};
        }
        else{
            int mid = (l + r) >> 1;
            if(pos <= mid){
                Update(node * 2, l, mid, pos);
            }
            else{
                Update(node * 2 + 1, mid + 1, r, pos);
            }
            sTree[node] = Merge(sTree[node * 2], sTree[node * 2 + 1]);
        }
    }
};
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    vector<pair<int, int>>v(n + 1);
    for(int i = 1;i <= n;++i){
        cin >> v[i].first;
        v[i].second = i;
    }    
    vector<pair<int, int>>queries(q);
    vector<long long> answers(q);
    for(int i = 0;i < q;++i) {
        cin >> queries[i].first;
        queries[i].second = i;
    }
    sort(v.begin(), v.end());
    sort(queries.begin(), queries.end());
    SegmentTree tree(n);
    tree.Build(1, 1, n);
    int p_v = 1, p_queries = 0;
    for(int i = 1;i <= 1e6;++i){
        while(p_v <= n && v[p_v].first == i){
            tree.Update(1, 1, n, v[p_v].second);
            p_v++;
        }
        while(p_queries < q && queries[p_queries].first == i){
            answers[queries[p_queries].second] = tree.sTree[1].num_of_intervals;
            p_queries++;
        }
    }
    for(int i = 0;i < q;++i){
        cout << answers[i] << '\n';
    }
}

• 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