Submission #297919

#	Time	Username	Problem	Language	Result	Execution time	Memory
297919		khangal	Roller Coaster Railroad (IOI16_railroad)	C++14	34 / 100	149 ms	71416 KiB

railroad

#include "railroad.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0)
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set;
typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,h1,h2,e[1234567],b,c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z,t,xx,yy;
bool used[1234567];
pl p[1234567];
vl v[123456],vec,vv1,vv2,vtr[1234567];
string s1,s;
ll sz[1234567];
// ll tr[5234567],par[1234567],maxx,arr[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
map<ll,ll> mp;
ll son[1234567],q,arr[1234567],node,sum[1234567];
 
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    n = s.size();
    ll dp[1<<n][n];
    for(int i=0;i<(1<<n);i++){
    	for(int j=0;j<n;j++)dp[i][j]=MAX;
	}
    for(int i=0;i<n-1;i++){
    	dp[1<<i][i]=0;
	}
	for(int i=0;i<(1<<n);i++){
		for(int j=0;j<n;j++){
			if(dp[i][j]==MAX)con;
			for(int k=0;k<n;k++){
				if((i&(1<<k))==0){
					ll cost = dp[i][j] + max(0,t[j]-s[k]);
					dp[i|(1<<k)][k]=min(dp[i|(1<<k)][k] , cost);
				}
			}
		}
	}
	ll ans=MAX;
	for(int i0;i<n;i++){
		ans=min(ans,dp[(1<<n)-1][i]);
	}
	return ans;
}

Compilation message (stderr)

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:68:10: warning: unused variable 'i0' [-Wunused-variable]
   68 |  for(int i0;i<n;i++){
      |          ^~

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