# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
886203 | vjudge1 | Airplane (NOI23_airplane) | C++17 | 132 ms | 3776 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long int
#define MP make_pair
#define REP(i,n) for(int (i) = 0; (i)<(n); (i)++)
#define pb push_back
const int N = 2e5+5;
const int M = 4e5+5;
const int MOD = 1e9+7;
const int INF = 1e17;
using namespace std;
void fastio() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
}
int n,m,q;
vector<int> a(N, 0);
void solve() {
cin>>n>>m;
REP(i,n) cin>>a[i + 1];
for(int i = 1; i<=m; i++) {
int u,v;
cin>>u>>v;
}
a[0] = -5;
int mx = 0;
REP(i,n) {
if(a[mx] <= a[i + 1]) mx = i + 1;
}
int cost = 0;
int curh = 0;
for(int i = 2; i<=mx; i++) {
cost++; curh++;
if(curh < a[i]) {
cost += a[i] - curh;
curh = a[i];
}
}
for(int i = mx + 1; i<=n; i++) {
cost++;
if(curh > a[i]) {
curh--;
}
}
cost += curh;
cout<<cost<<"\n";
}
signed main() {
// fastio();
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |