제출 #488065

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
488065		niloyroot	Pilot (NOI19_pilot)	C++14	55 / 100	1088 ms	3184 KiB

pilot

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
const ll mod = 1000000007;

void solve(){
    ll n,q; cin>>n>>q;
    ll h[n+1];
    forp(i,1,n){
        cin>>h[i];
    }
    ll y[q+1];
    forp(i,1,q){
        cin>>y[i];
    }
    ll cnt=0;
    ll ans=0;
    forp(i,1,q){
        forp(j,1,n){
            if(h[j]>y[i]){
                ans+=(cnt*(cnt-1))/2; ans+=cnt;
                cnt=0;
            } else {
                cnt++;
            }
        }
        ans+=(cnt*(cnt-1))/2; ans+=cnt;
        cout<<ans<<newl;
        ans=cnt=0;
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1; //cin>>t;
    while(t--)solve();
}

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 0 / 9
• Subtask 7: 0 / 14
• Subtask 8: 10 / 10
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11