제출 #715710

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715710		North1304	Pilot (NOI19_pilot)	C++17	89 / 100	1050 ms	47036 KiB

pilot

#include <bits/stdc++.h>
using namespace std;
int n,m;
pair<int,int> a[1000001],q[1000001];
set<pair<int,int> > s;
long long ans[1000001],now;
void add(int x) {
    auto it = s.lower_bound({x, INT_MAX});
    int ll = x , rr = x;
    long long l = 0,r = 0;
    if (it!=s.begin()){
        it--;
        if(it->second==x-1) {
            l = it->second-it->first+1;
            ll = it->first;
            it = s.erase(it);
        }
        else it++;
        }
    if (it!=s.end()) {
        if(it->first==x+1) {
            r = it->second-it->first+1;
            rr = it->second;
            s.erase(it); 
        }
    }
    now += (l+1) * (r+1);
    s.insert({ll,rr});
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    cin >> n >> m;
    for(int i=1;i<=n;i++) cin >> a[i].first, a[i].second = i;
    for(int i=1;i<=m;i++) cin >> q[i].first, q[i].second = i;
    sort(a+1, a+n+1);
    sort(q+1, q+m+1);
    int x = 1,y = 1;
    while (y<=m) {
        while(x<=n and a[x].first<=q[y].first) {
            add(a[x].second);
            x++;
        }
        ans[q[y].second] = now;
        y++;
    }
    for(int i=1;i<=m;i++) cout << ans[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: 0 / 11