oj.uz

답안 #914177

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914177 2024-01-21T10:20:53 Z Litusiano Airplane (NOI23_airplane) C++17
0 / 100
 34 ms 6740 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define int long long

int n,m;

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m;
	vector<vector<int>> G;
	vector<int> v(n); for(int& i : v) cin>>i;
	int trash;
	while(m--) cin>>trash>>trash;
	vector<int> suf(n+1); suf[n] = 0;	
	for(int i = n-1; i>=0 ; i--) suf[i] = max(v[i], suf[i+1]);
	int h = 0;
	int ans = 0;
	for(int i = 0; i<n; i++){
		if(v[i] > h){
			ans += v[i]-h; h = v[i]; // just go up
		}
		else if(h < suf[i]) h++;
		else if(h > suf[i]) h--;
	}
	cout<<ans+n<<endl;
}

Subtask #1
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 34 ms 6740 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 34 ms 6740 KB Output isn't correct
3 Halted 0 ms 0 KB -