Submission #1026325

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1026325	2024-07-17 22:54:10	vjudge1	Roller Coaster Railroad (IOI16_railroad)	C++17	34 / 100	39 ms	10576 KiB

railroad

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
long long transit[20][20],dp[1<<16][16];
long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = (int) s.size();
    for(int i=0;i<n;i++) for(int j=0;j<n;j++)
        transit[i][j]=max(t[i]-s[j],0);
    memset(dp,7,sizeof dp);
    for(int i=0;i<n;i++)
        dp[1<<i][i]=0;
    for(int i=1;i<1<<n;i++)
        for(int j=0;j<n;j++) if(i&1<<j)
            for(int k=0;k<n;k++) if(~i&1<<k)
                dp[i|1<<k][k]=min(dp[i|1<<k][k],dp[i][j]+transit[j][k]);
    long long ans=1e18;
    for(int i=0;i<n;i++)
        ans=min(ans,dp[(1<<n)-1][i]);
    return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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