제출 #572377

#제출 시각아이디문제언어결과실행 시간메모리
572377MODDIPilot (NOI19_pilot)C++14
55 / 100
1073 ms2948 KiB
#include <bits/stdc++.h> #define ll long long #define pii pair<int,int> #define pll pair<ll,ll> #define vi vector<int> #define vl vector<ll> #define mp make_pair #define pb push_back using namespace std; int n, q; vl arr; int main(){ cin>>n>>q; arr.resize(n); for(int i = 0; i < n; i++){ cin>>arr[i]; } vl queries; for(int i = 0; i < q; i++){ ll a; cin>>a; queries.pb(a); } for(int i = 0; i < q; i++){ ll h = queries[i]; ll rez = 0, track = 0; for(int i = 0; i < n; i++){ if(arr[i] > h) track = 0; else{ track++; rez += track; } } cout<<rez<<endl; } }
#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...