Submission #1319836

#TimeUsernameProblemLanguageResultExecution timeMemory
1319836benightPilot (NOI19_pilot)C++17
55 / 100
1095 ms4100 KiB
#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]<<" "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...