oj.uz

답안 #44844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
44844 2018-04-08T05:50:19 Z RayaBurong25_1 Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 89 ms 17556 KB 
#include "railroad.h"
#include <stdio.h>
#define INF 1e18
long long dp[65536][16];
long long min(long long a, long long b)
{
    return (a < b)?a:b;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    int i, j, k, l, cnt;
    for (i = 0; i < n; i++)
        dp[0][i] = INF;
    for (i = 1; i <= n; i++)
    {
        for (j = 0; j < (1 << n); j++)
        {
            k = j;
            cnt = 0;
            while (k > 0)
            {
                k -= k&-k;
                cnt++;
            }
            if (cnt != i) continue;
            for (k = 0; k < n; k++)
            {
                if ((j&(1 << k)) == 0)
                {
                    dp[j][k] = INF;
                }
                else if ((j^(1 << k)) == 0)
                {
                    dp[j][k] = 0;
                }
                else
                {
                    dp[j][k] = INF;
                    for (l = 0; l < n; l++)
                    {
                        dp[j][k] = min(dp[j][k], dp[j^(1 << k)][l] + (t[l] > s[k])*(t[l] - s[k]));
                    }
                }
                // printf("dp[%d][%d] = %lld\n", j, k, dp[j][k]);
            }
        }
    }
    long long ans = INF;
    for (i = 0; i < n; i++)
        ans = min(ans, dp[(1 << n) - 1][i]);
    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB n = 2
2 Correct 2 ms 380 KB n = 2
3 Correct 2 ms 428 KB n = 2
4 Correct 2 ms 428 KB n = 2
5 Correct 2 ms 480 KB n = 2
6 Correct 2 ms 512 KB n = 2
7 Correct 2 ms 540 KB n = 3
8 Correct 2 ms 540 KB n = 3
9 Correct 2 ms 676 KB n = 3
10 Correct 2 ms 676 KB n = 8
11 Correct 2 ms 676 KB n = 8
12 Correct 2 ms 700 KB n = 8
13 Correct 2 ms 724 KB n = 8
14 Correct 2 ms 724 KB n = 8
15 Correct 2 ms 724 KB n = 8
16 Correct 2 ms 724 KB n = 8
17 Correct 2 ms 724 KB n = 8
18 Correct 2 ms 724 KB n = 8
19 Correct 2 ms 724 KB n = 3
20 Correct 2 ms 724 KB n = 7
21 Correct 2 ms 724 KB n = 8
22 Correct 2 ms 724 KB n = 8
23 Correct 2 ms 784 KB n = 8
24 Correct 2 ms 784 KB n = 8
25 Correct 2 ms 784 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB n = 2
2 Correct 2 ms 380 KB n = 2
3 Correct 2 ms 428 KB n = 2
4 Correct 2 ms 428 KB n = 2
5 Correct 2 ms 480 KB n = 2
6 Correct 2 ms 512 KB n = 2
7 Correct 2 ms 540 KB n = 3
8 Correct 2 ms 540 KB n = 3
9 Correct 2 ms 676 KB n = 3
10 Correct 2 ms 676 KB n = 8
11 Correct 2 ms 676 KB n = 8
12 Correct 2 ms 700 KB n = 8
13 Correct 2 ms 724 KB n = 8
14 Correct 2 ms 724 KB n = 8
15 Correct 2 ms 724 KB n = 8
16 Correct 2 ms 724 KB n = 8
17 Correct 2 ms 724 KB n = 8
18 Correct 2 ms 724 KB n = 8
19 Correct 2 ms 724 KB n = 3
20 Correct 2 ms 724 KB n = 7
21 Correct 2 ms 724 KB n = 8
22 Correct 2 ms 724 KB n = 8
23 Correct 2 ms 784 KB n = 8
24 Correct 2 ms 784 KB n = 8
25 Correct 2 ms 784 KB n = 8
26 Correct 2 ms 784 KB n = 8
27 Correct 2 ms 784 KB n = 8
28 Correct 2 ms 784 KB n = 8
29 Correct 37 ms 8768 KB n = 16
30 Correct 40 ms 8772 KB n = 16
31 Correct 40 ms 8892 KB n = 16
32 Correct 38 ms 8892 KB n = 16
33 Correct 37 ms 8916 KB n = 16
34 Correct 37 ms 8916 KB n = 16
35 Correct 37 ms 8916 KB n = 16
36 Correct 22 ms 8916 KB n = 15
37 Correct 2 ms 8916 KB n = 8
38 Correct 38 ms 8916 KB n = 16
39 Correct 37 ms 8940 KB n = 16
40 Correct 2 ms 8940 KB n = 9
41 Correct 38 ms 8940 KB n = 16
42 Correct 37 ms 8940 KB n = 16
43 Correct 37 ms 8940 KB n = 16
44 Correct 2 ms 8940 KB n = 9
45 Correct 21 ms 8940 KB n = 15
46 Correct 37 ms 8940 KB n = 16
47 Correct 37 ms 8972 KB n = 16
48 Correct 38 ms 8972 KB n = 16

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 89 ms 17556 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB n = 2
2 Correct 2 ms 380 KB n = 2
3 Correct 2 ms 428 KB n = 2
4 Correct 2 ms 428 KB n = 2
5 Correct 2 ms 480 KB n = 2
6 Correct 2 ms 512 KB n = 2
7 Correct 2 ms 540 KB n = 3
8 Correct 2 ms 540 KB n = 3
9 Correct 2 ms 676 KB n = 3
10 Correct 2 ms 676 KB n = 8
11 Correct 2 ms 676 KB n = 8
12 Correct 2 ms 700 KB n = 8
13 Correct 2 ms 724 KB n = 8
14 Correct 2 ms 724 KB n = 8
15 Correct 2 ms 724 KB n = 8
16 Correct 2 ms 724 KB n = 8
17 Correct 2 ms 724 KB n = 8
18 Correct 2 ms 724 KB n = 8
19 Correct 2 ms 724 KB n = 3
20 Correct 2 ms 724 KB n = 7
21 Correct 2 ms 724 KB n = 8
22 Correct 2 ms 724 KB n = 8
23 Correct 2 ms 784 KB n = 8
24 Correct 2 ms 784 KB n = 8
25 Correct 2 ms 784 KB n = 8
26 Correct 2 ms 784 KB n = 8
27 Correct 2 ms 784 KB n = 8
28 Correct 2 ms 784 KB n = 8
29 Correct 37 ms 8768 KB n = 16
30 Correct 40 ms 8772 KB n = 16
31 Correct 40 ms 8892 KB n = 16
32 Correct 38 ms 8892 KB n = 16
33 Correct 37 ms 8916 KB n = 16
34 Correct 37 ms 8916 KB n = 16
35 Correct 37 ms 8916 KB n = 16
36 Correct 22 ms 8916 KB n = 15
37 Correct 2 ms 8916 KB n = 8
38 Correct 38 ms 8916 KB n = 16
39 Correct 37 ms 8940 KB n = 16
40 Correct 2 ms 8940 KB n = 9
41 Correct 38 ms 8940 KB n = 16
42 Correct 37 ms 8940 KB n = 16
43 Correct 37 ms 8940 KB n = 16
44 Correct 2 ms 8940 KB n = 9
45 Correct 21 ms 8940 KB n = 15
46 Correct 37 ms 8940 KB n = 16
47 Correct 37 ms 8972 KB n = 16
48 Correct 38 ms 8972 KB n = 16
49 Runtime error 89 ms 17556 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -