Submission #1311969

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311969		samarthkulkarni	Pilot (NOI19_pilot)	C++20	28 / 100	28 ms	4556 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];


	vector<pr> qw(q);
	for (int i = 0; i < q; i++) {
		cin >> qw[i].ff;
		qw[i].ss = i;
	}
	sort(all(qw));


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

	vi res(q);

	ll j = 0;
	for (auto [h, i] : qw) {
		while (j < n && a[j] <= h) j++;

		res[i] = val(j);
	}

	for (auto val : res) cout << val << endl;


}

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