oj.uz

답안 #66133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
66133 2018-08-09T18:57:59 Z Eae02 Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
 141 ms 9540 KB 
#include "railroad.h"

#include <bits/stdc++.h>

using ll = long long;

struct Track
{
    int maxEntrySpeed;
    int exitSpeed;
};

int n;
Track tracks[16];

const ll BIG = std::numeric_limits<ll>::max();

ll memo[1 << 16][16];

ll minTrackLen(const uint16_t b, const int l)
{
    if (memo[b][l] != 0)
        return memo[b][l] - 1;
    if (b == (1 << n) - 1)
        return 0;
    
    int speed = tracks[l].exitSpeed;
    
    ll m = BIG;
    for (int i = 0; i < n; i++)
    {
        uint16_t mask = 1 << i;
        if (b & mask)
            continue;
        
        int d = std::max(speed - tracks[i].maxEntrySpeed, 0);
        m = std::min(m, minTrackLen(b | mask, i) + d);
    }
    
    memo[b][l] = m + 1;
    return m;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t)
{
    if (s.size() > 16)
        return 0;
    
    n = s.size();
    for (int i = 0; i < n; i++)
    {
        tracks[i].maxEntrySpeed = s[i];
        tracks[i].exitSpeed = t[i];
    }
    
    ll m = BIG;
    for (int i = 0; i < n; i++)
    {
        m = std::min(m, minTrackLen(1 << i, i));
    }
    
    return m;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB n = 2
2 Correct 2 ms 380 KB n = 2
3 Correct 2 ms 456 KB n = 2
4 Correct 2 ms 532 KB n = 2
5 Correct 3 ms 548 KB n = 2
6 Correct 2 ms 556 KB n = 2
7 Correct 2 ms 676 KB n = 3
8 Correct 3 ms 676 KB n = 3
9 Correct 4 ms 676 KB n = 3
10 Correct 2 ms 676 KB n = 8
11 Correct 3 ms 676 KB n = 8
12 Correct 3 ms 712 KB n = 8
13 Correct 3 ms 712 KB n = 8
14 Correct 3 ms 712 KB n = 8
15 Correct 2 ms 712 KB n = 8
16 Correct 3 ms 720 KB n = 8
17 Correct 3 ms 720 KB n = 8
18 Correct 3 ms 720 KB n = 8
19 Correct 3 ms 720 KB n = 3
20 Correct 3 ms 720 KB n = 7
21 Correct 3 ms 720 KB n = 8
22 Correct 2 ms 720 KB n = 8
23 Correct 2 ms 720 KB n = 8
24 Correct 3 ms 720 KB n = 8
25 Correct 3 ms 720 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB n = 2
2 Correct 2 ms 380 KB n = 2
3 Correct 2 ms 456 KB n = 2
4 Correct 2 ms 532 KB n = 2
5 Correct 3 ms 548 KB n = 2
6 Correct 2 ms 556 KB n = 2
7 Correct 2 ms 676 KB n = 3
8 Correct 3 ms 676 KB n = 3
9 Correct 4 ms 676 KB n = 3
10 Correct 2 ms 676 KB n = 8
11 Correct 3 ms 676 KB n = 8
12 Correct 3 ms 712 KB n = 8
13 Correct 3 ms 712 KB n = 8
14 Correct 3 ms 712 KB n = 8
15 Correct 2 ms 712 KB n = 8
16 Correct 3 ms 720 KB n = 8
17 Correct 3 ms 720 KB n = 8
18 Correct 3 ms 720 KB n = 8
19 Correct 3 ms 720 KB n = 3
20 Correct 3 ms 720 KB n = 7
21 Correct 3 ms 720 KB n = 8
22 Correct 2 ms 720 KB n = 8
23 Correct 2 ms 720 KB n = 8
24 Correct 3 ms 720 KB n = 8
25 Correct 3 ms 720 KB n = 8
26 Correct 3 ms 720 KB n = 8
27 Correct 2 ms 720 KB n = 8
28 Correct 2 ms 720 KB n = 8
29 Correct 119 ms 8828 KB n = 16
30 Correct 131 ms 8960 KB n = 16
31 Correct 122 ms 8960 KB n = 16
32 Correct 130 ms 8960 KB n = 16
33 Correct 109 ms 8960 KB n = 16
34 Correct 94 ms 8960 KB n = 16
35 Correct 105 ms 8960 KB n = 16
36 Correct 43 ms 8960 KB n = 15
37 Correct 3 ms 8960 KB n = 8
38 Correct 97 ms 8960 KB n = 16
39 Correct 119 ms 8960 KB n = 16
40 Correct 3 ms 8960 KB n = 9
41 Correct 141 ms 8960 KB n = 16
42 Correct 127 ms 8960 KB n = 16
43 Correct 118 ms 8960 KB n = 16
44 Correct 3 ms 8960 KB n = 9
45 Correct 51 ms 8960 KB n = 15
46 Correct 116 ms 8960 KB n = 16
47 Correct 121 ms 8960 KB n = 16
48 Correct 124 ms 8960 KB n = 16

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 8960 KB n = 199999
2 Incorrect 88 ms 9540 KB answer is not correct: 0 instead of 1
3 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB n = 2
2 Correct 2 ms 380 KB n = 2
3 Correct 2 ms 456 KB n = 2
4 Correct 2 ms 532 KB n = 2
5 Correct 3 ms 548 KB n = 2
6 Correct 2 ms 556 KB n = 2
7 Correct 2 ms 676 KB n = 3
8 Correct 3 ms 676 KB n = 3
9 Correct 4 ms 676 KB n = 3
10 Correct 2 ms 676 KB n = 8
11 Correct 3 ms 676 KB n = 8
12 Correct 3 ms 712 KB n = 8
13 Correct 3 ms 712 KB n = 8
14 Correct 3 ms 712 KB n = 8
15 Correct 2 ms 712 KB n = 8
16 Correct 3 ms 720 KB n = 8
17 Correct 3 ms 720 KB n = 8
18 Correct 3 ms 720 KB n = 8
19 Correct 3 ms 720 KB n = 3
20 Correct 3 ms 720 KB n = 7
21 Correct 3 ms 720 KB n = 8
22 Correct 2 ms 720 KB n = 8
23 Correct 2 ms 720 KB n = 8
24 Correct 3 ms 720 KB n = 8
25 Correct 3 ms 720 KB n = 8
26 Correct 3 ms 720 KB n = 8
27 Correct 2 ms 720 KB n = 8
28 Correct 2 ms 720 KB n = 8
29 Correct 119 ms 8828 KB n = 16
30 Correct 131 ms 8960 KB n = 16
31 Correct 122 ms 8960 KB n = 16
32 Correct 130 ms 8960 KB n = 16
33 Correct 109 ms 8960 KB n = 16
34 Correct 94 ms 8960 KB n = 16
35 Correct 105 ms 8960 KB n = 16
36 Correct 43 ms 8960 KB n = 15
37 Correct 3 ms 8960 KB n = 8
38 Correct 97 ms 8960 KB n = 16
39 Correct 119 ms 8960 KB n = 16
40 Correct 3 ms 8960 KB n = 9
41 Correct 141 ms 8960 KB n = 16
42 Correct 127 ms 8960 KB n = 16
43 Correct 118 ms 8960 KB n = 16
44 Correct 3 ms 8960 KB n = 9
45 Correct 51 ms 8960 KB n = 15
46 Correct 116 ms 8960 KB n = 16
47 Correct 121 ms 8960 KB n = 16
48 Correct 124 ms 8960 KB n = 16
49 Correct 84 ms 8960 KB n = 199999
50 Incorrect 88 ms 9540 KB answer is not correct: 0 instead of 1
51 Halted 0 ms 0 KB -