Submission #1311971

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311971		samarthkulkarni	Pilot (NOI19_pilot)	C++20	55 / 100	1096 ms	1540 KiB

pilot

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define vi vector<long long>
#define all(x) x.begin(), x.end()
#define endl "\n"
#define pr pair<ll, ll>
#define ff first
#define ss second

void solution();
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solution();
    return 0;
}

const int N = 1e6+10;
ll a[N];



void solution() {
	ll n, q; cin >> n >> q;

	for (int i = 0; i < n; i++) cin >> a[i];


	auto val = [&](ll z) {
		return z*(z+1)/2;
	};

	while (q--) {
		ll h; cin >> h;
		ll ans = 0;
		for (int i = 0; i < n;) {
			if (a[i] > h) {i++; continue;}
			int j = i;
			while (j < n && a[j] <= h) j++;

			ans += val(j-i);
			i = j;
		}

		cout << ans << endl;

	}


}

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 0 / 9
• Subtask 7: 0 / 14
• Subtask 8: 10 / 10
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11