Submission #885733

#TimeUsernameProblemLanguageResultExecution timeMemory
885733NinedesuPilot (NOI19_pilot)C++14
9 / 100
30 ms3592 KiB
#include<bits/stdc++.h> #define ll long long #define pii pair<int,int> using namespace std; const int N=1e6+1; int n,q; int arr[N]; pii qst[N]; int main(){ ios_base::sync_with_stdio(0),cin.tie(0); cin >> n >> q; for(int i=1; i<=n; i++){ cin >> arr[i]; } while(q--){ int h; cin >> h; int idx=upper_bound(arr+1,arr+n+1,h)-arr-1; cout << ((ll)arr[idx]*(arr[idx]+1))/2 << '\n'; } 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...