Submission #363460

#	Time	Username	Problem	Language	Result	Execution time	Memory
363460		CSQ31	Roller Coaster Railroad (IOI16_railroad)	C++14	34 / 100	59 ms	18924 KiB

railroad

#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    if(n<=17){
		
		VII dp(17,vector<ll>(1<<17,INF));
		for(int i=0;i<n;i++)dp[i][(1<<i)] = max(0,1-s[i]);
		for(int mask=0;mask<(1<<n);mask++){
			for(int i=0;i<n;i++){
				if(!((1<<i)&mask))continue;
				for(int j=0;j<n;j++){
					if(i == j || !((1<<j)&mask))continue;
					//cout<<i<<" "<<j<<'\n';
					dp[i][mask] = min(dp[i][mask],dp[j][mask-(1<<i)] + max(0,t[j]-s[i]));
					
				}
			}
		}
		ll ans = INF;
		/*
		for(int mask=0;mask<(1<<n);mask++){
			for(int i=0;i<n;i++){
			   if(dp[i][mask] == INF)cout<<"INF"<<" ";
			   else cout<<dp[i][mask]<<" ";	
				
			}
			cout<<'\n';
		}*/
		for(int i=0;i<n;i++)ans = min(ans,dp[i][(1<<n)-1]);
		return ans;
	}
    return 0;
}
/*
int main()
{
	int n;
	cin>>n;
	vector<int>s(n),t(n);
	for(int i=0;i<n;i++)cin>>s[i]>>t[i];
	cout<<plan_roller_coaster(s,t);
}

*/

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