oj.uz

Submission #299437

# Submission time Handle Problem Language Result Execution time Memory
299437 2020-09-14T22:29:15 Z c4ts0up Roller Coaster Railroad (IOI16_railroad) C++17
11 / 100
 2000 ms 6552 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;

const ll INF = 1e17;

ll n, d;

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    n = s.size();

    vector <pair <ll,ll> > arr;
    arr.resize(n);
    for (int i=0; i<n; i++) arr[i] = {(ll)s[i], (ll)t[i]};

    sort(arr.begin(), arr.end());

    d = INF;

    do {

        ll vel = arr[0].ss, currd = 0;
        for (int i=1; i<n; i++) {
            currd += max(0LL, vel-arr[i].ff);
            vel = arr[i].ss;
        }
        d = min(currd, d);
    } while (next_permutation(arr.begin(), arr.end()));
    return d;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 2
2 Correct 0 ms 256 KB n = 2
3 Correct 1 ms 256 KB n = 2
4 Correct 1 ms 256 KB n = 2
5 Correct 1 ms 256 KB n = 2
6 Correct 1 ms 256 KB n = 2
7 Correct 1 ms 256 KB n = 3
8 Correct 1 ms 512 KB n = 3
9 Correct 1 ms 256 KB n = 3
10 Correct 1 ms 256 KB n = 8
11 Correct 1 ms 256 KB n = 8
12 Correct 1 ms 256 KB n = 8
13 Correct 1 ms 256 KB n = 8
14 Correct 1 ms 256 KB n = 8
15 Correct 2 ms 416 KB n = 8
16 Correct 1 ms 256 KB n = 8
17 Correct 1 ms 256 KB n = 8
18 Correct 1 ms 256 KB n = 8
19 Correct 0 ms 256 KB n = 3
20 Correct 1 ms 256 KB n = 7
21 Correct 1 ms 256 KB n = 8
22 Correct 1 ms 384 KB n = 8
23 Correct 1 ms 256 KB n = 8
24 Correct 1 ms 256 KB n = 8
25 Correct 1 ms 256 KB n = 8
26 Correct 2 ms 256 KB n = 8
27 Correct 1 ms 256 KB n = 8
28 Correct 1 ms 256 KB n = 8
29 Execution timed out 2041 ms 384 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 2043 ms 6552 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

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