Submission #1315440

#	Time	Username	Problem	Language	Result	Execution time	Memory
1315440		samarthkulkarni	Airplane (NOI23_airplane)	C++20	22 / 100	49 ms	12912 KiB

Main

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

using ll = long long;
#define vi vector<long long>
#define all(x) x.begin(), x.end()
#define endl "\n"
#define pr pair<ll, ll>
#define ff first
#define ss second

void solution();
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solution();
	return 0;
}

#define arr array<ll, 4>

const int N = 2e5+10;
vi adj[N];
ll a[N];



void solution() {
	ll n, m; cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];

	while (m--) {
		int u, v; cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}


	int t = max_element(a+1, a+n+1) - a;



	ll ans = 0;
	ll x = 0;
	for (int i = 2; i <= t; i++) {
		ll delta = max(1ll, a[i]-x);
		x += delta;
		ans+=delta;
	}

	x = 0;
	for (int i = n-1; i >= t; i--) {
		ll delta = max(1ll, a[i]-x);
		x += delta;
		ans += delta;
	}

	cout << ans << endl;





}

• Subtask 1: 22 / 22
• Subtask 2: 0 / 10
• Subtask 3: 0 / 31
• Subtask 4: 0 / 37