제출 #635353

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
635353	2022-08-26 06:34:11	Bruteforceman	Roller Coaster Railroad (IOI16_railroad)	C++17	64 / 100	456 ms	65672 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 <bits/stdc++.h>
     
    long long sub12(int n, std::vector <int> s, std::vector <int> t) {
      t.push_back(1);
      long long dp[1 << 16][17];
      for (int mask = 0; mask < (1 << 16); mask++) {
        for (int i = 0; i < 17; i++) {
          dp[mask][i] = 1LL << 60;
        }
      }
      for (int i = 0; i < 17; i++) {
        dp[(1 << n) - 1][i] = 0;
      }
      auto f = [&] (auto&& self, int mask, int last) -> long long {
        if (dp[mask][last] < (1LL << 60)) {
          return dp[mask][last];
        }
        for (int i = 0; i < n; i++) {
          if (mask & (1 << i)) {
            continue;
          }
          dp[mask][last] = std::min(dp[mask][last], self(self, mask | (1 << i), i) + std::max(0, t[last] - s[i]));
        }
        return dp[mask][last];
      };
      return f(f, 0, n);
    }
     
    long long plan_roller_coaster(std::vector <int> s, std::vector <int> t) {
      int n = s.size();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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