oj.uz

Submission #429083

# Submission time Handle Problem Language Result Execution time Memory
429083 2021-06-15T17:16:57 Z Tangent Roller Coaster Railroad (IOI16_railroad) C++17
11 / 100
 2000 ms 8648 KB 
#include "railroad.h"
#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;

#define ffor(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define fford(i, a, b) for (ll i = (a); i > (ll)(b); i--)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()

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

    ll res = 1LL << 62;

    vii used(n);
    ll curr = 0;

    function<void(int)> dfs;
    dfs = [&](int speed) {
        if (curr > res) {
            return;
        }
        bool found = false;
        rep(i, n) {
            if (!used[i]) {
                found = true;
                used[i] = true;
                curr += max(0, speed - s[i]);
                dfs(t[i]);
                curr -= max(0, speed - s[i]);
                used[i] = false;
            }
        }
        if (!found) {
            res = min(res, curr);
        }
    };
    dfs(1);

    return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 23.0

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