Submission #954684

# Submission time Handle Problem Language Result Execution time Memory
954684 2024-03-28T10:48:16 Z GrindMachine Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
416 ms 524288 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "railroad.h"

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    ll n = sz(s);
    vector<pll> a(n);
    rep(i,n) a[i] = {s[i],t[i]};

    ll dp[1<<n][n];
    memset(dp,0x3f,sizeof dp);
    rep(i,n) dp[1<<i][i] = 0;

    rep(mask,1<<n){
        rep(i,n){
            if(!(mask&(1<<i))) conts;
            rep(j,n){
                if(mask&(1<<j)) conts;
                ll val = dp[mask][i];
                if(a[i].ss >= a[j].ff){
                    val += a[i].ss-a[j].ff;
                }
                amin(dp[mask|(1<<j)][j],val);
            }
        }
    }

    ll ans = inf2;
    rep(i,n) amin(ans,dp[(1<<n)-1][i]);

    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 436 KB n = 2
3 Correct 0 ms 344 KB n = 2
4 Correct 0 ms 600 KB n = 2
5 Correct 0 ms 436 KB n = 2
6 Correct 1 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 0 ms 348 KB n = 3
10 Correct 0 ms 440 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 1 ms 596 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 0 ms 348 KB n = 8
16 Correct 1 ms 344 KB n = 8
17 Correct 1 ms 344 KB n = 8
18 Correct 1 ms 344 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 0 ms 348 KB n = 7
21 Correct 0 ms 600 KB n = 8
22 Correct 0 ms 344 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 0 ms 348 KB n = 8
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 436 KB n = 2
3 Correct 0 ms 344 KB n = 2
4 Correct 0 ms 600 KB n = 2
5 Correct 0 ms 436 KB n = 2
6 Correct 1 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 0 ms 348 KB n = 3
10 Correct 0 ms 440 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 1 ms 596 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 0 ms 348 KB n = 8
16 Correct 1 ms 344 KB n = 8
17 Correct 1 ms 344 KB n = 8
18 Correct 1 ms 344 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 0 ms 348 KB n = 7
21 Correct 0 ms 600 KB n = 8
22 Correct 0 ms 344 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 0 ms 348 KB n = 8
26 Correct 0 ms 344 KB n = 8
27 Correct 1 ms 348 KB n = 8
28 Correct 0 ms 348 KB n = 8
29 Correct 31 ms 8536 KB n = 16
30 Correct 32 ms 8540 KB n = 16
31 Correct 31 ms 8636 KB n = 16
32 Correct 31 ms 8540 KB n = 16
33 Correct 32 ms 8792 KB n = 16
34 Correct 31 ms 8540 KB n = 16
35 Correct 31 ms 8540 KB n = 16
36 Correct 15 ms 4188 KB n = 15
37 Correct 1 ms 348 KB n = 8
38 Correct 32 ms 8540 KB n = 16
39 Correct 31 ms 8540 KB n = 16
40 Correct 0 ms 344 KB n = 9
41 Correct 34 ms 8536 KB n = 16
42 Correct 36 ms 8536 KB n = 16
43 Correct 31 ms 8540 KB n = 16
44 Correct 1 ms 348 KB n = 9
45 Correct 15 ms 4188 KB n = 15
46 Correct 31 ms 8540 KB n = 16
47 Correct 38 ms 8792 KB n = 16
48 Correct 32 ms 8540 KB n = 16
# Verdict Execution time Memory Grader output
1 Runtime error 416 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 436 KB n = 2
3 Correct 0 ms 344 KB n = 2
4 Correct 0 ms 600 KB n = 2
5 Correct 0 ms 436 KB n = 2
6 Correct 1 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 0 ms 348 KB n = 3
10 Correct 0 ms 440 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 1 ms 596 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 0 ms 348 KB n = 8
16 Correct 1 ms 344 KB n = 8
17 Correct 1 ms 344 KB n = 8
18 Correct 1 ms 344 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 0 ms 348 KB n = 7
21 Correct 0 ms 600 KB n = 8
22 Correct 0 ms 344 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 0 ms 348 KB n = 8
26 Correct 0 ms 344 KB n = 8
27 Correct 1 ms 348 KB n = 8
28 Correct 0 ms 348 KB n = 8
29 Correct 31 ms 8536 KB n = 16
30 Correct 32 ms 8540 KB n = 16
31 Correct 31 ms 8636 KB n = 16
32 Correct 31 ms 8540 KB n = 16
33 Correct 32 ms 8792 KB n = 16
34 Correct 31 ms 8540 KB n = 16
35 Correct 31 ms 8540 KB n = 16
36 Correct 15 ms 4188 KB n = 15
37 Correct 1 ms 348 KB n = 8
38 Correct 32 ms 8540 KB n = 16
39 Correct 31 ms 8540 KB n = 16
40 Correct 0 ms 344 KB n = 9
41 Correct 34 ms 8536 KB n = 16
42 Correct 36 ms 8536 KB n = 16
43 Correct 31 ms 8540 KB n = 16
44 Correct 1 ms 348 KB n = 9
45 Correct 15 ms 4188 KB n = 15
46 Correct 31 ms 8540 KB n = 16
47 Correct 38 ms 8792 KB n = 16
48 Correct 32 ms 8540 KB n = 16
49 Runtime error 416 ms 524288 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -