Submission #888419

#	Time	Username	Problem	Language	Result	Execution time	Memory
888419		imarn	Pilot (NOI19_pilot)	C++14	100 / 100	409 ms	54964 KiB

pilot

#include<bits/stdc++.h>
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) x.begin(),x.end()
#define pb push_back
#define sz(x) (int)x.size()
#define f first
#define s second
#define vi vector<int>
#define vpii vector<pii>
#define ll long long
using namespace std;
const int N=1e6+5;
int pr[N],a[N];
pii qr[N];
ll sz[N];
ll ac[N];
bool vis[N]{0};
vector<pii>v;
int get(int r){
    return pr[r]==r?r:pr[r]=get(pr[r]);
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,q;cin>>n>>q;iota(pr,pr+n+1,0);
    for(int i=1;i<=n;i++)cin>>a[i],sz[i]=1;
    for(int i=1;i<=q;i++)cin>>qr[i].f,qr[i].s=i;
    ll ans=0;sort(qr+1,qr+q+1);
    ll sn=0;
    for(int i=1;i<=n;i++){
        if(sn==0&&a[i]<=qr[1].f)sn++,vis[i]=1,sz[i]=sn;
        else if(sn>0&&a[i]<=qr[1].f)pr[i-1]=i,sn++,vis[i]=1,sz[i]=sn;
        else if(a[i]>qr[1].f)v.pb({a[i],i}),ans+=sn*(sn+1)/2,sn=0;
    }ans+=sn*(sn+1)/2;
    sort(v.begin(),v.end());
    ac[qr[1].s]=ans;int idx=0;
    for(int i=2;i<=q;i++){
        while(idx<v.size()&&qr[i].f>=v[idx].f){
            int j = v[idx].s;
            ans+=1;vis[j]=1;
            if(vis[j-1]){
                pr[j-1]=j;ans-=sz[j]*(sz[j]+1)/2;
                ans-=sz[j-1]*(sz[j-1]+1)/2;sz[j]+=sz[j-1];
                ans+=sz[j]*(sz[j]+1)/2;
            }
            if(vis[j+1]){
                int u=get(j+1);
                pr[j]=pr[u];ans-=sz[j]*(sz[j]+1)/2;
                ans-=sz[u]*(sz[u]+1)/2;sz[u]+=sz[j];
                ans+=sz[u]*(sz[u]+1)/2;
            }idx++;
        }ac[qr[i].s]=ans;
    }for(int i=1;i<=q;i++)cout<<ac[i]<<"\n";
}

Compilation message (stderr)

pilot.cpp: In function 'int main()':
pilot.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         while(idx<v.size()&&qr[i].f>=v[idx].f){
      |               ~~~^~~~~~~~~

• 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