oj.uz

Submission #954648

# Submission time Handle Problem Language Result Execution time Memory
954648 2024-03-28T09:34:45 Z GrindMachine Roller Coaster Railroad (IOI16_railroad) C++17
11 / 100
 2000 ms 10324 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]};
    sort(all(a));

    ll ans = inf2;

    do{

        ll cost = 0;
        ll speed = 1;

        rep(i,n){
            if(a[i].ff < speed){
                cost += speed-a[i].ff;
            }
            speed = a[i].ss;
        }
        
        amin(ans,cost);

    } while(next_permutation(all(a)));

    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 1 ms 348 KB n = 2
4 Correct 1 ms 504 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 1 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 0 ms 348 KB n = 3
10 Correct 1 ms 348 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 1 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 1 ms 348 KB n = 8
17 Correct 1 ms 348 KB n = 8
18 Correct 1 ms 344 KB n = 8
19 Correct 0 ms 676 KB n = 3
20 Correct 1 ms 348 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 1 ms 348 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 1 ms 348 KB n = 8
25 Correct 1 ms 600 KB n = 8

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 1 ms 348 KB n = 2
4 Correct 1 ms 504 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 1 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 0 ms 348 KB n = 3
10 Correct 1 ms 348 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 1 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 1 ms 348 KB n = 8
17 Correct 1 ms 348 KB n = 8
18 Correct 1 ms 344 KB n = 8
19 Correct 0 ms 676 KB n = 3
20 Correct 1 ms 348 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 1 ms 348 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 1 ms 348 KB n = 8
25 Correct 1 ms 600 KB n = 8
26 Correct 1 ms 348 KB n = 8
27 Correct 1 ms 348 KB n = 8
28 Correct 1 ms 348 KB n = 8
29 Execution timed out 2086 ms 348 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2047 ms 10324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 1 ms 348 KB n = 2
4 Correct 1 ms 504 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 1 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 0 ms 348 KB n = 3
10 Correct 1 ms 348 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 1 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 1 ms 348 KB n = 8
16 Correct 1 ms 348 KB n = 8
17 Correct 1 ms 348 KB n = 8
18 Correct 1 ms 344 KB n = 8
19 Correct 0 ms 676 KB n = 3
20 Correct 1 ms 348 KB n = 7
21 Correct 1 ms 348 KB n = 8
22 Correct 1 ms 348 KB n = 8
23 Correct 1 ms 348 KB n = 8
24 Correct 1 ms 348 KB n = 8
25 Correct 1 ms 600 KB n = 8
26 Correct 1 ms 348 KB n = 8
27 Correct 1 ms 348 KB n = 8
28 Correct 1 ms 348 KB n = 8
29 Execution timed out 2086 ms 348 KB Time limit exceeded
30 Halted 0 ms 0 KB -