Submission #1142767

#TimeUsernameProblemLanguageResultExecution timeMemory
1142767bestbestPilot (NOI19_pilot)C++20
40 / 100
2 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define en '\n' #define sp ' ' typedef long long ll; #define Linux ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define pii pair<int,int> const int N=1e3+10; int n,Q; int h[N],y,qs[N]; int main(){Linux cin >> n >> Q; for(int i=1;i<=n;i++) { qs[i]=qs[i-1]+i; cin >> h[i]; //cout << qs[i] << sp; } h[n+1]=2e9; cout << en; int cnt,sum; while(Q--){ cnt=0,sum=0; cin >> y; for(int i=1;i<=n+1;i++){ if(h[i]>y){ sum+=qs[cnt]; cnt=0; } else { cnt++; } //cout << qs[cnt] << sp; } cout << sum << en; } 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...