제출 #320912

#제출 시각아이디문제언어결과실행 시간메모리
320912strawberry2005Pilot (NOI19_pilot)C++14
40 / 100
1097 ms1364 KiB
#include<bits/stdc++.h> #define deb(x) cout<<#x<<": "<<x<<endl using namespace std; int main(){ int n,q; cin>>n>>q; int heights[n+1],planes[q]; for(int i=0;i<n;i++) cin>>heights[i]; for(int i=0;i<q;i++) cin>>planes[i]; heights[n]=1e9; for(int i=0;i<q;i++){ int reach_height=planes[i]; int count=0,ans=0; for(int j=0;j<n+1;j++){ if(heights[j]<=reach_height) count++; else{ ans+=count*(count+1)/2; count=0; } //if(count!=0) ans+=count*(count+1)/2; } cout<<ans<<endl; } return(0); }
#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...