Submission #692431

#	Time	Username	Problem	Language	Result	Execution time	Memory
692431		ghostwriter	Pilot (NOI19_pilot)	C++17	100 / 100	516 ms	52268 KiB

pilot

#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define bg begin
#define ed end
#define ft front
#define bk back
#define sz(x) (int)(x).size()
#define all(x) (x).bg(), (x).ed()
#define mtp make_tuple
#define ins insert
#define ers erase
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define str string
#define pi pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pi>
#define vpll vector<pll>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { WHILE(b) { a %= b; swap(a, b); } return b; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
const int N = 1e6 + 5;
int n, q, h[N], p[N], lm[N], rm[N];
vpi h1;
ll ans[N];
int getp(int x) { return p[x] == x? x : p[x] = getp(p[x]); }
void join(int x, int y) {
    x = getp(x);
    y = getp(y);
    if (x == y) return;
    p[y] = x;
    rm[x] = rm[y];
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> q;
    FOR(i, 1, n) {
        cin >> h[i];
        h1.pb({h[i], i});
    }
    sort(all(h1));
    FOR(i, 1, n) p[i] = lm[i] = rm[i] = i;
    FRN(j, n) {
        int i = h1[j].nd;
        if (i > 1 && h[i - 1] <= h[i]) join(i - 1, i);
        if (i < n && h[i + 1] < h[i]) join(i, i + 1);
        int l = lm[getp(i)], r = rm[getp(i)];
        ans[h[i]] += 1LL * (i - l + 1) * (r - i + 1);
    }
    FOR(i, 1, 1e6) ans[i] += ans[i - 1];
    WHILE(q--) {
        int y;
        cin >> y;
        cout << ans[y] << '\n';
    }
    // cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

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