Submission #967837

#	Time	Username	Problem	Language	Result	Execution time	Memory
967837		josanneo22	Security Guard (JOI23_guard)	C++17	0 / 100	53 ms	15704 KiB

guard

#include<bits/stdc++.h>
using namespace std;
using i64 = long long;

const int nax = 200005;
int N, M, Q;
i64 S[nax]; 
vector<int> G[nax];
namespace subtask1 {
	void solve() {
		i64 ans = 0;
		for (int i = 2; i <= N; i++) ans += max(S[i], S[i - 1]);
		for (int i = 1; i < N; i++) ans -= max(0LL, S[i] - S[i + 1]);
		cout << ans << '\n';
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);

	cin >> N >> M >> Q;
	for (int i = 1; i <= N; i++) cin >> S[i];
	for (int i = 0; i < M; i++) {
		int u, v; cin >> u >> v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	if (M == N - 1 && Q == 0 && *max_element(S + 1, S + 1 + N) <= 2) subtask1::solve();
}

• 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