Submission #1037999

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1037999	2024-07-29 11:59:11	vjudge1	Roller Coaster Railroad (IOI16_railroad)	C++17	34 / 100	46 ms	8540 KiB

railroad

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
using lint=long long;
lint plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    if(n<=16){
        lint dp[1<<n][n];
        for(int i=0;i<1<<n;i++){
            for(int j=0;j<n;j++){
                dp[i][j]=LLONG_MAX;
            }
        }
        for(int i=0;i<n;i++){
            dp[1<<i][i]=0;
        }
        for(int mask=1;mask<1<<n;mask++){
            for(int i=0;i<n;i++){
                if((mask>>i)&1){
                    for(int j=0;j<n;j++){
                        if(!((mask>>j)&1)){
                            int to=mask|(1<<j);
                            lint cost=t[i]-s[j];
                            if(cost<0)cost=0;
                            if(dp[mask][i]+cost<dp[to][j]){
                                dp[to][j]=dp[mask][i]+cost;
                            }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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