oj.uz

Submission #286454

# Submission time Handle Problem Language Result Execution time Memory
286454 2020-08-30T12:23:45 Z dolphingarlic Meetings (IOI18_meetings) C++14
36 / 100
 1060 ms 11000 KB 
#include "meetings.h"

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

struct Node {
    int l, r, a, b, tot;

    Node operator+(Node B) {
        Node ret = {l, B.r, (tot == r - l + 1 ? tot + B.a : a),
                    (B.tot == B.r - B.l + 1 ? b + B.tot : B.b),
                    max({tot, B.tot, b + B.a})};
        return ret;
    }
} segtree[400001];

int n, h[100001];
ll dp[5000];

void build(int node = 1, int l = 0, int r = n - 1) {
    if (l == r) segtree[node] = {l, r, h[l] == 1, h[l] == 1, h[l] == 1};
    else {
        int mid = (l + r) / 2;
        build(node * 2, l, mid);
        build(node * 2 + 1, mid + 1, r);
        segtree[node] = segtree[node * 2] + segtree[node * 2 + 1];
    }
}

Node query(int a, int b, int node = 1, int l = 0, int r = n - 1) {
    if (a <= l && b >= r) return segtree[node];
    int mid = (l + r) / 2;
    if (mid >= a) {
        if (mid + 1 <= b) return query(a, b, node * 2, l, mid) + query(a, b, node * 2 + 1, mid + 1, r);
        return query(a, b, node * 2, l, mid);
    }
    return query(a, b, node * 2 + 1, mid + 1, r);
}

vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
    n = H.size();
    for (int i = 0; i < n; i++) h[i] = H[i];
    int Q = int(L.size());
    vector<long long> C(Q);

    if (Q <= 5000) {
        for (int i = 0; i < Q; i++) {
            memset(dp, 0, sizeof dp);
            stack<pair<int, ll>> stck;
            ll val = 0;
            for (int j = L[i]; j <= R[i]; j++) {
                while (stck.size() && H[stck.top().first] <= H[j]) {
                    val -= H[stck.top().first] * stck.top().second;
                    stck.pop();
                }
                ll rng = (stck.size() ? j - stck.top().first : j - L[i] + 1);
                val += rng * H[j];
                dp[j] += val;
                stck.push({j, rng});
                // cout << dp[j] << ' ';
            }
            // cout << "| ";
            while (stck.size()) stck.pop();
            val = 0;
            for (int j = R[i]; j >= L[i]; j--) {
                while (stck.size() && H[stck.top().first] <= H[j]) {
                    val -= H[stck.top().first] * stck.top().second;
                    stck.pop();
                }
                ll rng = (stck.size() ? stck.top().first - j : R[i] - j + 1);
                val += rng * H[j];
                dp[j] += val - H[j];
                stck.push({j, rng});
                // cout << dp[j] << ' ';
            }
            // cout << '\n';
            C[i] = *min_element(dp + L[i], dp + R[i] + 1);
        }
    } else {
        build();
        for (int i = 0; i < Q; i++) {
            C[i] = 2 * (R[i] - L[i] + 1) - query(L[i], R[i]).tot;
        }
    }
    return C;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 360 ms 632 KB Output is correct
11 Correct 1060 ms 760 KB Output is correct
12 Correct 346 ms 760 KB Output is correct
13 Correct 1048 ms 760 KB Output is correct
14 Correct 234 ms 760 KB Output is correct
15 Correct 254 ms 760 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 39 ms 2680 KB Output is correct
3 Correct 126 ms 11000 KB Output is correct
4 Correct 120 ms 11000 KB Output is correct
5 Correct 83 ms 11000 KB Output is correct
6 Correct 106 ms 11000 KB Output is correct
7 Correct 117 ms 11000 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 39 ms 2680 KB Output is correct
3 Correct 126 ms 11000 KB Output is correct
4 Correct 120 ms 11000 KB Output is correct
5 Correct 83 ms 11000 KB Output is correct
6 Correct 106 ms 11000 KB Output is correct
7 Correct 117 ms 11000 KB Output is correct
8 Incorrect 117 ms 11000 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 360 ms 632 KB Output is correct
11 Correct 1060 ms 760 KB Output is correct
12 Correct 346 ms 760 KB Output is correct
13 Correct 1048 ms 760 KB Output is correct
14 Correct 234 ms 760 KB Output is correct
15 Correct 254 ms 760 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 39 ms 2680 KB Output is correct
18 Correct 126 ms 11000 KB Output is correct
19 Correct 120 ms 11000 KB Output is correct
20 Correct 83 ms 11000 KB Output is correct
21 Correct 106 ms 11000 KB Output is correct
22 Correct 117 ms 11000 KB Output is correct
23 Incorrect 117 ms 11000 KB Output isn't correct
24 Halted 0 ms 0 KB -