Submission #66312

#	Time	Username	Problem	Language	Result	Execution time	Memory
66312		mirbek01	Roller Coaster Railroad (IOI16_railroad)	C++17	34 / 100	125 ms	25780 KiB

railroad

# include "railroad.h"
# include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 2;

long long dp[17][N];
int id[N];
vector <int> a, b;

bool cmp(int i, int j){
      return b[i] <= a[j];
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
      int n = (int) s.size();
      if(n <= 16){
            for(int i = 1; i < N; i ++)
                  for(int j = 0; j < n; j ++)
                        dp[j][i] = 1e18;
            for(int i = 0; i < n; i ++){
                  dp[i][1 << i] = 0;
            }
            for(int mask = 1; mask < (1 << n); mask ++){
                  for(int i = 0; i < n; i ++){
                        if(mask & (1 << i)) continue;
                        int to = mask + (1 << i);
                        for(int j = 0; j < n; j ++){
                              if(!(mask & (1 << j))) continue;
                              dp[i][to] = min(dp[i][to], dp[j][mask] + max(t[j] - s[i], 0));
                        }
                  }
            }
            long long ans = 1e18;
            for(int i = 0; i < n; i ++)
                  ans = min(ans, dp[i][(1 << n) - 1]);
            return ans;
      } else {
            a = s, b = t;
            for(int i = 0; i < n; i ++)
                  id[i] = i;
            sort(id, id + n, cmp);
            bool ans = 0;
            for(int i = 1; i < n; i ++)
                  if(s[id[i]] < t[id[i - 1]]) ans = 1;
            return ans;
      }
}

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