oj.uz

Submission #886162

# Submission time Handle Problem Language Result Execution time Memory
886162 2023-12-11T14:13:13 Z vjudge1 Airplane (NOI23_airplane) C++17
0 / 100
 109 ms 1976 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin>>n>>m;
	vector<int> a(n);
	for(int i=0; i<n; i++) cin>>a[i];
	for(int i=0; i<m; i++) {
		int tmp;
		cin>>tmp>>tmp;
	}
	int cur = 0, ans = 0;
	vector<int> sufmax(n);
	sufmax[n-1] = a[n-1];
	for(int i=n-2; i>0; i--) sufmax[i] = max(sufmax[i+1], a[i]);
	for(int i=0; i<n-1; i++) {
		if(cur + 1 < a[i+1]) {
			ans += a[i+1]-1-cur;
			cur += a[i+1]-1-cur;
		}
		if(sufmax[i] > cur) {
			cur++;
			ans++;
		}
		else if(sufmax[i] < cur) {
			cur--;
			ans++;
		}
		else ans++;
	}
	ans += max(1, cur);
	cout<<ans<<endl;
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 109 ms 1976 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 109 ms 1976 KB Output isn't correct
3 Halted 0 ms 0 KB -