Submission #1192457

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192457		TitanicXDzz	Pilot (NOI19_pilot)	C++20	89 / 100	1095 ms	42840 KiB

pilot

#include<bits/stdc++.h>
using namespace std;
long long l[1000010];
long long r[1000010];
long long dp[1000010];
pair<long long,long long> a[1000010];
int main(){
 long long n,q;
 cin>>n>>q;
 for(long long i=1;i<=n;i++){
    cin>>a[i].first;
    a[i].second=i;
 }
 sort(a+1,a+n+1);
 for(long long i=1;i<=n;i++){
    if(l[a[i].second-1]==0&&r[a[i].second+1]==0){
        l[a[i].second]=a[i].second;
        r[a[i].second]=a[i].second;
        dp[i]=dp[i-1]+1;
    }
    else if(l[a[i].second-1]==0){
        l[r[a[i].second+1]]=a[i].second;
        r[a[i].second]=r[a[i].second+1];
        dp[i]=r[a[i].second]-a[i].second+1+dp[i-1];
    }
    else if(r[a[i].second+1]==0){
        r[l[a[i].second-1]]=a[i].second;
        l[a[i].second]=l[a[i].second-1];
        dp[i]=a[i].second-l[a[i].second]+1+dp[i-1];
    }
    else{
        l[r[a[i].second+1]]=l[a[i].second-1];
        r[l[a[i].second-1]]=r[a[i].second+1];
        dp[i]=(a[i].second-l[a[i].second-1]+1)*(r[a[i].second+1]-a[i].second+1)+dp[i-1];
    }
 }
 for(long long i=1;i<=q;i++){
    long long x;
    cin>>x;
    long long l=0;
    long long r=n;
    while(l!=r){
        long long mid=(l+r+1)/2;
        if(x<a[mid].first)
            r=mid-1;
        else
            l=mid;
    }
    cout<<dp[l]<<endl;
 }
}

• 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