제출 #338869

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338869		tengiz05	Mountain Trek Route (IZhO12_route)	C++17	0 / 100	1 ms	384 KiB

route

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool ckmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool ckmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int a[N], n, m, k;

void solve(int test_case){
	int i, j;
	cin >> n >> k;
	int ini = 0;
	for(i=0;i<n;i++){
		cin >> a[i];
	}a[n] = a[0];
	for(i=1;i<=n;i++){
		ini += abs(a[i]-a[i-1]);
	}
	int later = 0;
	for(j=0;j<k;j++){
		int ind=-1;
		bool iseq = 1;
		for(i=1;i<=n;i++){
			if(a[i] != a[i-1])iseq = false;
			if(a[i] < a[i-1] && a[i] < a[(i)%(n)+1]){
				ind = i;
			}
		}
		if(iseq)break;
	//	cout << "orig " << ind << '\n';
		if(ind == -1){
			for(i=1;i<=n;i++){
				if(a[i] < a[i-1]){
					ind = i;
				}
			}
			assert(ind != -1);
			a[ind]++;
			if(ind == n)a[0]++;
		}else {
			a[ind]++;
			if(ind == n)a[0]++;
		}
	}
//	for(i=0;i<=n;i++)cout << a[i] << ' ';cout << '\n';
	for(i=1;i<=n;i++){
		later += abs(a[i]-a[i-1]);
	}
	cout << ini - later << '\n';
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

• Subtask 1: 0 / 100