Submission #1069647

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1069647	2024-08-22 07:41:37	Ignut	Roller Coaster Railroad (IOI16_railroad)	C++17	34 / 100	39 ms	15188 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
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18 + 123;
const int inf = 1e9 + 123;
const int N = 16;
ll dp[1 << N][N];
ll plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = s.size();
    for (int i = 0; i < 1 << n; i ++)
        for (int j = 0; j < n; j ++)
            dp[i][j] = INF;
    for (int i = 0; i < n; i ++)
        dp[1 << i][i] = 0;
    vector<pair<int, int>> lst;
    for (int mask = 1; mask + 1 < 1 << n; mask ++) {
        lst.push_back({__builtin_popcount(mask), mask});
    }
    sort(lst.begin(), lst.end());
    for (auto [popcnt, mask] : lst) {
        for (int i = 0; i < n; i ++) {
            if (!(mask & (1 << i))) continue;
            for (int j = 0; j < n; j ++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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