| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1276993 | ducdev | Pilot (NOI19_pilot) | C++17 | 1096 ms | 7624 KiB | 
// Author: 4uckd3v - Nguyen Cao Duc
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int MAX_N = 1e6;
const int MOD = 1e9 + 7;
int n, q;
int h[MAX_N + 5];
vector<ii> queries;
namespace SUBTASK_5_8 {
    const int N = MAX_N;
    int st[20][N + 5];
    int jump(int idx, int x) {
        for (int i = 19; i >= 0; i--) {
            if (idx + (1 << i) - 1 <= n && st[i][idx] <= x) {
                idx += 1 << i;
            };
        };
        return idx - 1;
    };
    void Solve() {
        for (int i = 1; i <= n; i++) st[0][i] = h[i];
        for (int j = 1; (1 << j) <= n; j++) {
            for (int i = 1; i + (1 << j) - 1 <= n; i++) {
                st[j][i] = max(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
                // cout << j << ' ' << i << ' ' << st[j][i] << endl;
            };
        };
        // cout << st[2][1 + (1 << 2)] << endl;
        for (ii query : queries) {
            int x = query.first;
            ll res = 0;
            for (int i = 1; i <= n; i++) {
                if (h[i] > x) continue;
                int j = jump(i, x);
                res += j - i + 1;
            };
            cout << res << '\n';
        };
    };
};  // namespace SUBTASK_5_8
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if (fopen("MAIN.INP", "r")) {
        freopen("MAIN.INP", "r", stdin);
        freopen("MAIN.OUT", "w", stdout);
    };
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> h[i];
    };
    for (int i = 1; i <= q; i++) {
        int y;
        cin >> y;
        queries.push_back(make_pair(y, i));
    };
    SUBTASK_5_8::Solve();
};
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
