Submission #1186879

#TimeUsernameProblemLanguageResultExecution timeMemory
1186879darkdevilvaqifPilot (NOI19_pilot)C++20
55 / 100
1096 ms2052 KiB
#pragma optimization("03") #include <bits/stdc++.h> #define ll long long #define endl "\n" using namespace std; int main() { ll n, q, i, maxx, cnt, size; cin >> n >> q; vector <ll> a(n); for (i = 0; i < n; i++) { cin >> a[i]; } vector <ll> b(q); for (i = 0; i < q; i++) { cin >> b[i]; } for (i = 0; i < q; i++) { maxx = b[i], cnt = 0, size = 0; for (auto x : a) { if (x <= maxx) { size++; } else { cnt += (size * (size + 1)) / 2; size = 0; } } cnt += (size * (size + 1)) / 2; cout << cnt << 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...