Submission #574293

#TimeUsernameProblemLanguageResultExecution timeMemory
574293DevigoPilot (NOI19_pilot)C++14
40 / 100
1084 ms1892 KiB
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair

const int siz = 0;
const int mod = 0;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	vector<int> h(n);
	for(int i=0; i<n; i++) {
		cin >> h[i];
	}
	vector<int> y(q);
	for(int i=0; i<q; i++) {
		cin >> y[i];
	}
	if(q == 1 && y[0] == 1e6) {
		long long ans = (n*(n+1))/2;
		cout << ans << "\n"; return 0;
	}
	vector<long long> ans;
	for(int i=0; i<q; i++) {
		long long x = y[i]; // x = 1e6
		long long sum = 0; long long s = 0;
		for(int j=0; j<n; j++) {
			if(h[j] > x) {
				s = j+1;
				continue;
			}
			sum += ((j-s)+1);
		}
		ans.pb(sum);
	}
	for(int j: ans) cout << j << "\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...