제출 #1319836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319836		benight	Pilot (NOI19_pilot)	C++17	55 / 100	1095 ms	4100 KiB

pilot

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<ll>
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fr(i,a,b) for(ll i=a;i>=b;i--)
#define fa(e,l) for(auto e:l)
#define all(arr) arr.begin(),arr.end()
#define pii pair<ll,ll>
#define tii tuple<ll,ll,ll>
#define coutpii(x) fa(e,x){cout<<e.first<<","<<e.second<<" ";}cout<<"\n"
#define coutll(x) fa(e,x){cout<<e<<" ";}cout<<"\n"

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll T,a,b,c,d,n,l,r,x,y,m,t,q;
    // cin>>T;
    // f(I,0,T){
    //     cin>>n;
    // }
    cin>>n>>q;
    vi arr;
    f(i,0,n){
        cin>>x;
        arr.pb(x);
    }
    vi ans(q,0),ptr(q,-1),h;
    f(i,0,q){
        cin>>x;
        h.pb(x);
    }
    f(i,0,n){
        f(j,0,q){
            if(arr[i]>h[j]){ptr[j]=i;}
            else{
                ans[j]+=i-ptr[j];
            }
        }
    }
    f(i,0,q){
        cout<<ans[i]<<" ";
    }
}

• 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