Submission #1034928

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1034928	2024-07-25 22:02:33	aymanrs	Roller Coaster Railroad (IOI16_railroad)	C++14	34 / 100	87 ms	9044 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;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = s.size();
    if(n<=16){
    long long dp[1<<n][n]; 
    for(int i = 0;i < n;i++) dp[(1<<n)-1][i] = 0;
    for(int b = (1<<n)-2;b;b--){
        for(int j = 0;j < n;j++){
            if(!((b>>j)&1)) continue;
            dp[b][j] = LONG_LONG_MAX;
            for(int k = 0;k < n;k++){
                if((b>>k)&1) continue;
                dp[b][j] = min(dp[b][j], dp[b|(1<<k)][k]+max(0, t[j]-s[k]));
            }
        }
    }
    long long ans = LONG_LONG_MAX;
    for(int i = 0;i < n;i++) ans = min(ans, dp[1<<i][i]);
    return ans;
    }
    int os[n], ot[n];for(int i = 0;i < n;i++){os[i]=s[i];ot[i]=i;};
    sort(os, os+n);
    sort(ot, ot+n, [&t](int a, int b){return t[a]<t[b];});
    int mi = INT_MAX;
    bool joker = false;
    for(int _ = n-1, d=1; _ >= 0;_--,d++){
        int i = ot[_];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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