oj.uz

Submission #100002

# Submission time Handle Problem Language Result Execution time Memory
100002 2019-03-09T06:21:42 Z shenxy Roller Coaster Railroad (IOI16_railroad) C++11
11 / 100
 70 ms 3496 KB 
#include "railroad.h"
#include <algorithm>
#include <vector>
#define INF 1E18
using namespace std;
int N;
long long int plan_roller_coaster(vector<int> s, vector<int> t) {
    N = s.size();
    if (N <= 8) {
        vector<int> u;
        for (int i = 0; i < 8; i++) {
            u.push_back(i);
        }
        long long int ans = 0;
        for (int i = 1; i < 8; i++) {
            ans += max(0, t[u[i - 1]] - s[u[i]]);
        }
        while (next_permutation(u.begin(), u.end())) {
            long long int temp = 0;
            for (int i = 1; i < 8; i++) {
                temp += max(0, t[u[i - 1]] - s[u[i]]);
            }
            ans = min(ans, temp);
        }
        return ans;
    }
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 256 KB n = 2
4 Correct 3 ms 256 KB n = 2
5 Correct 3 ms 384 KB n = 2
6 Correct 3 ms 384 KB n = 2
7 Correct 3 ms 352 KB n = 3
8 Correct 3 ms 384 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 3 ms 384 KB n = 8
11 Correct 3 ms 256 KB n = 8
12 Correct 3 ms 384 KB n = 8
13 Correct 4 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 3 ms 256 KB n = 8
16 Correct 3 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 3 ms 256 KB n = 8
19 Correct 3 ms 384 KB n = 3
20 Correct 3 ms 256 KB n = 7
21 Correct 3 ms 256 KB n = 8
22 Correct 3 ms 384 KB n = 8
23 Correct 3 ms 256 KB n = 8
24 Correct 4 ms 256 KB n = 8
25 Correct 3 ms 384 KB n = 8
26 Correct 4 ms 256 KB n = 8
27 Correct 4 ms 256 KB n = 8
28 Correct 3 ms 256 KB n = 8
29 Correct 2 ms 256 KB n = 16
30 Correct 2 ms 256 KB n = 16
31 Incorrect 2 ms 384 KB answer is not correct: 0 instead of 5295826283
32 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 3448 KB n = 199999
2 Incorrect 70 ms 3496 KB answer is not correct: 0 instead of 1
3 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB n = 2
2 Correct 2 ms 256 KB n = 2
3 Correct 2 ms 256 KB n = 2
4 Correct 3 ms 256 KB n = 2
5 Correct 3 ms 384 KB n = 2
6 Correct 3 ms 384 KB n = 2
7 Correct 3 ms 352 KB n = 3
8 Correct 3 ms 384 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 3 ms 384 KB n = 8
11 Correct 3 ms 256 KB n = 8
12 Correct 3 ms 384 KB n = 8
13 Correct 4 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 3 ms 256 KB n = 8
16 Correct 3 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 3 ms 256 KB n = 8
19 Correct 3 ms 384 KB n = 3
20 Correct 3 ms 256 KB n = 7
21 Correct 3 ms 256 KB n = 8
22 Correct 3 ms 384 KB n = 8
23 Correct 3 ms 256 KB n = 8
24 Correct 4 ms 256 KB n = 8
25 Correct 3 ms 384 KB n = 8
26 Correct 4 ms 256 KB n = 8
27 Correct 4 ms 256 KB n = 8
28 Correct 3 ms 256 KB n = 8
29 Correct 2 ms 256 KB n = 16
30 Correct 2 ms 256 KB n = 16
31 Incorrect 2 ms 384 KB answer is not correct: 0 instead of 5295826283
32 Halted 0 ms 0 KB -