Submission #572373

#TimeUsernameProblemLanguageResultExecution timeMemory
572373MODDIPilot (NOI19_pilot)C++14
40 / 100
1084 ms2488 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; vi arr; int main(){ cin>>n>>q; arr.resize(n); for(int i = 0; i < n; i++){ cin>>arr[i]; } vi queries; for(int i = 0; i < q; i++){ int a; cin>>a; queries.pb(a); } for(int i = 0; i < q; i++){ int h = queries[i]; int rez = 0; for(int i = 0; i < n; i++){ if(arr[i] > h) continue; for(int j = i; j < n; j++){ if(arr[j] > h) break; else { rez++; //cout<<i<<" "<<j<<endl; } } } 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...