oj.uz

답안 #823951

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823951 2023-08-13T10:40:56 Z vnm06 Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
 52 ms 10596 KB 
#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;

int n;
long long dp[200000][16];

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    n = s.size();
    int st2=(1<<n);
    for(int i=1; i<st2; i++)
    {
        int br1=0, pos=0;
        for(int j=0; j<n; j++)
        {
            if((1<<j)&i) {br1++; pos=j;}
        }
        if(br1==1) {dp[i][pos]=0; continue;}
        for(int j=0; j<n; j++)
        {
            dp[i][j]=1e18;
            if(!((1<<j)&i)) continue;
            for(int k=0; k<n; k++)
            {
                if(!((1<<k)&i) || k==j) continue;
                long long st=dp[i^(1<<j)][k];
                if(s[j]<t[k]) st+=t[k]-s[j];
                if(st<dp[i][j]) dp[i][j]=st;
               ///cout<<i<<" "<<j<<" "<<k<<" "<<" "<<s[j]<<" "<<t[j]<<" "<<s[k]<<" "<<t[k]<<endl;
            }
        }
    }
    long long mst=1e18;
    for(int i=0; i<n; i++) if(mst>dp[st2-1][i]) mst=dp[st2-1][i];
    return mst;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 0 ms 308 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 1 ms 308 KB n = 3
10 Correct 1 ms 340 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 1 ms 304 KB n = 8
14 Correct 1 ms 340 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 0 ms 340 KB n = 8
17 Correct 0 ms 304 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 0 ms 304 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 340 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 0 ms 308 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 1 ms 308 KB n = 3
10 Correct 1 ms 340 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 1 ms 304 KB n = 8
14 Correct 1 ms 340 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 0 ms 340 KB n = 8
17 Correct 0 ms 304 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 0 ms 304 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 340 KB n = 8
26 Correct 1 ms 340 KB n = 8
27 Correct 0 ms 340 KB n = 8
28 Correct 1 ms 340 KB n = 8
29 Correct 52 ms 8488 KB n = 16
30 Correct 47 ms 8492 KB n = 16
31 Correct 46 ms 8444 KB n = 16
32 Correct 41 ms 8408 KB n = 16
33 Correct 37 ms 8404 KB n = 16
34 Correct 51 ms 8428 KB n = 16
35 Correct 50 ms 8432 KB n = 16
36 Correct 24 ms 4308 KB n = 15
37 Correct 1 ms 312 KB n = 8
38 Correct 49 ms 8416 KB n = 16
39 Correct 51 ms 8396 KB n = 16
40 Correct 1 ms 340 KB n = 9
41 Correct 46 ms 8448 KB n = 16
42 Correct 52 ms 8388 KB n = 16
43 Correct 39 ms 8460 KB n = 16
44 Correct 1 ms 308 KB n = 9
45 Correct 24 ms 4276 KB n = 15
46 Correct 51 ms 8496 KB n = 16
47 Correct 50 ms 8448 KB n = 16
48 Correct 51 ms 8380 KB n = 16

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 37 ms 10596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 0 ms 308 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 1 ms 308 KB n = 3
10 Correct 1 ms 340 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 1 ms 304 KB n = 8
14 Correct 1 ms 340 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 0 ms 340 KB n = 8
17 Correct 0 ms 304 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 0 ms 304 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 340 KB n = 8
25 Correct 1 ms 340 KB n = 8
26 Correct 1 ms 340 KB n = 8
27 Correct 0 ms 340 KB n = 8
28 Correct 1 ms 340 KB n = 8
29 Correct 52 ms 8488 KB n = 16
30 Correct 47 ms 8492 KB n = 16
31 Correct 46 ms 8444 KB n = 16
32 Correct 41 ms 8408 KB n = 16
33 Correct 37 ms 8404 KB n = 16
34 Correct 51 ms 8428 KB n = 16
35 Correct 50 ms 8432 KB n = 16
36 Correct 24 ms 4308 KB n = 15
37 Correct 1 ms 312 KB n = 8
38 Correct 49 ms 8416 KB n = 16
39 Correct 51 ms 8396 KB n = 16
40 Correct 1 ms 340 KB n = 9
41 Correct 46 ms 8448 KB n = 16
42 Correct 52 ms 8388 KB n = 16
43 Correct 39 ms 8460 KB n = 16
44 Correct 1 ms 308 KB n = 9
45 Correct 24 ms 4276 KB n = 15
46 Correct 51 ms 8496 KB n = 16
47 Correct 50 ms 8448 KB n = 16
48 Correct 51 ms 8380 KB n = 16
49 Runtime error 37 ms 10596 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -