Submission #940820

#	Time	Username	Problem	Language	Result	Execution time	Memory
940820		alextodoran	Security Guard (JOI23_guard)	C++17	0 / 100	34 ms	5544 KiB

guard

/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 200000;
const int M_MAX = 400000;
const int Q_MAX = 200000;

int N, M, Q;
int S[N_MAX + 2];

int L[N_MAX + 2], R[N_MAX + 2];

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M >> Q;
    assert(M == N - 1 && Q == 0);
    for (int i = 1; i <= N; i++) {
        cin >> S[i];
    }
    for (int i = 1; i <= M; i++) {
        int u, v;
        cin >> u >> v;
        assert(u == i && v == i + 1);
    }
    for (int i = 1; i <= N; i++) {
        if (i > 1 && S[i] >= S[i - 1]) {
            L[i] = S[i];
        } else {
            L[i] = L[i - 1];
        }
    }
    for (int i = N; i >= 1; i--) {
        if (i < N && S[i] >= S[i + 1]) {
            R[i] = S[i];
        } else {
            R[i] = R[i + 1];
        }
    }
    ll answer = 0;
    for (int i = 1; i + 1 <= N; i++) {
        answer += min(S[i], S[i + 1]);
    }
    for (int i = 1; i <= N; i++) {
        answer += max(L[i], R[i]) - S[i];
    }
    cout << answer << "\n";

    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 13
• Subtask 5: 0 / 8
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24