제출 #100109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
100109		MvC	Roller Coaster Railroad (IOI16_railroad)	C++11	34 / 100	89 ms	8696 KiB

railroad

#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int i,j,p,n,nr,id,cst;
ll s[20],t[20],f[20][(1<<17)],ans=llinf;
ll plan_roller_coaster(vector<int>s,vector<int>t)
{
	n=(int)s.size();
	for(i=1;i<(1<<n);i++)
	{
		nr=0;
		for(j=0;j<n;j++)
		{
			f[j][i]=llinf;
			if(i&(1<<j))
			{
				nr++,id=j;
				for(p=0;p<n;p++)
				{
					if(i&(1<<p) && p!=j)
					{
						cst=max(t[p]-s[j],0);
						f[j][i]=min(f[j][i],f[p][i^(1<<j)]+1LL*cst);
					}
				}
				if(i==(1<<n)-1)ans=min(ans,f[j][i]);
			}
		}
		if(nr==1)f[id][i]=0;
	}
	return ans;
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	
    return 0;
}*/
/*
4
1 4 5 6
7 3 8 6
*/

• Subtask 1: 11 / 11
• Subtask 2: 23 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36