Submission #1018931

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018931		Minbaev	Skyline (IZhO11_skyline)	C++17	0 / 100	648 ms	262144 KiB

skyline

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define pii pair<int,int>
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
template<class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag,
    tree_order_statistics_node_update>;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;

int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}

int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}

int n,m,k;

void solve(){
	
	cin >> n;
	vector<int>v(n);
	for(auto &to:v)cin >> to;
	
	map<vector<int>,int>mp;
	queue<pair<vector<int>,int>>q;
	q.push({v,0});
	mp[v] = 0;
	
	while(!q.empty()){
		auto to = q.front();
		q.pop();
		vector<int>v = to.f;
		
		for(int i = 0;i<n-2;i++){
			int mn = min({v[i],v[i+1],v[i+2]});
			if(mn == 0)continue;
			v[i] -= mn;
			v[i+1] -= mn;
			v[i+2] -= mn;
			
			if(mp[v] > to.s+(mn*7) || mp[v] == 0){
				q.push({v, to.s+(mn*7)});
				mp[v] = to.s+(mn*7);
			}
			v[i] += mn;
			v[i+1] += mn;
			v[i+2] += mn;
		}
		
		for(int i = 0;i<n-1;i++){
			int mn = min({v[i],v[i+1]});
			if(mn == 0)continue;
			v[i] -= mn;
			v[i+1] -= mn;
			
			if(mp[v] > to.s+(mn*5) || mp[v] == 0){
				q.push({v, to.s+(mn*5)});
				mp[v] = to.s+(mn*5);
			}
			v[i] += mn;
			v[i+1] += mn;
		}
		
		for(int i = 0;i<n;i++){
			int mn = v[i];
			v[i] -= mn;
			
			if(mp[v] > to.s+(mn*3) || mp[v] == 0){
				q.push({v, to.s+(mn*3)});
				mp[v] = to.s+(mn*3);
			}
			v[i] += mn;
		}
		
	}
	
	vector<int>vs(n);
	cout << mp[vs] << "\n";
	
}
 
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);

	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}
 

• Subtask 1: 0 / 100