oj.uz

Submission #42709

# Submission time Handle Problem Language Result Execution time Memory
42709 2018-03-03T01:50:59 Z funcsr Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
 95 ms 14240 KB 
#include "railroad.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); i++)
#define INF (1LL<<60)

int N;
int S[200000], T[200000];
long long dp[1<<16][16];
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
  N = s.size();
  rep(i, N) S[i] = s[i], T[i] = t[i];
  assert(N <= 16);
  rep(i, 1<<N) rep(j, N) dp[i][j] = INF;
  rep(i, N) dp[1<<i][i] = 0;
  rep(b, 1<<N) {
    rep(last, N) {
      if (dp[b][last] == INF) continue;
      rep(t, N) if (((b>>t)&1) == 0) {
        dp[b|(1<<t)][t] = min(dp[b|(1<<t)][t], dp[b][last] + max(T[last]-S[t], 0));
      }
    }
  }
  long long m = INF;
  rep(i, N) m = min(m, dp[(1<<N)-1][i]);
  return m;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB n = 2
2 Correct 2 ms 492 KB n = 2
3 Correct 2 ms 548 KB n = 2
4 Correct 2 ms 548 KB n = 2
5 Correct 2 ms 620 KB n = 2
6 Correct 2 ms 676 KB n = 2
7 Correct 1 ms 724 KB n = 3
8 Correct 1 ms 728 KB n = 3
9 Correct 2 ms 732 KB n = 3
10 Correct 2 ms 736 KB n = 8
11 Correct 2 ms 740 KB n = 8
12 Correct 2 ms 760 KB n = 8
13 Correct 2 ms 768 KB n = 8
14 Correct 2 ms 772 KB n = 8
15 Correct 2 ms 776 KB n = 8
16 Correct 1 ms 776 KB n = 8
17 Correct 2 ms 784 KB n = 8
18 Correct 2 ms 788 KB n = 8
19 Correct 1 ms 792 KB n = 3
20 Correct 1 ms 796 KB n = 7
21 Correct 2 ms 800 KB n = 8
22 Correct 2 ms 800 KB n = 8
23 Correct 1 ms 808 KB n = 8
24 Correct 2 ms 812 KB n = 8
25 Correct 2 ms 816 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB n = 2
2 Correct 2 ms 492 KB n = 2
3 Correct 2 ms 548 KB n = 2
4 Correct 2 ms 548 KB n = 2
5 Correct 2 ms 620 KB n = 2
6 Correct 2 ms 676 KB n = 2
7 Correct 1 ms 724 KB n = 3
8 Correct 1 ms 728 KB n = 3
9 Correct 2 ms 732 KB n = 3
10 Correct 2 ms 736 KB n = 8
11 Correct 2 ms 740 KB n = 8
12 Correct 2 ms 760 KB n = 8
13 Correct 2 ms 768 KB n = 8
14 Correct 2 ms 772 KB n = 8
15 Correct 2 ms 776 KB n = 8
16 Correct 1 ms 776 KB n = 8
17 Correct 2 ms 784 KB n = 8
18 Correct 2 ms 788 KB n = 8
19 Correct 1 ms 792 KB n = 3
20 Correct 1 ms 796 KB n = 7
21 Correct 2 ms 800 KB n = 8
22 Correct 2 ms 800 KB n = 8
23 Correct 1 ms 808 KB n = 8
24 Correct 2 ms 812 KB n = 8
25 Correct 2 ms 816 KB n = 8
26 Correct 2 ms 820 KB n = 8
27 Correct 2 ms 824 KB n = 8
28 Correct 1 ms 828 KB n = 8
29 Correct 46 ms 9032 KB n = 16
30 Correct 48 ms 9032 KB n = 16
31 Correct 46 ms 9044 KB n = 16
32 Correct 54 ms 9044 KB n = 16
33 Correct 45 ms 9044 KB n = 16
34 Correct 50 ms 9044 KB n = 16
35 Correct 53 ms 9056 KB n = 16
36 Correct 21 ms 9056 KB n = 15
37 Correct 2 ms 9056 KB n = 8
38 Correct 55 ms 9076 KB n = 16
39 Correct 55 ms 9192 KB n = 16
40 Correct 2 ms 9192 KB n = 9
41 Correct 47 ms 9192 KB n = 16
42 Correct 47 ms 9192 KB n = 16
43 Correct 54 ms 9192 KB n = 16
44 Correct 2 ms 9192 KB n = 9
45 Correct 27 ms 9192 KB n = 15
46 Correct 62 ms 9192 KB n = 16
47 Correct 45 ms 9192 KB n = 16
48 Correct 49 ms 9192 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 95 ms 14240 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB n = 2
2 Correct 2 ms 492 KB n = 2
3 Correct 2 ms 548 KB n = 2
4 Correct 2 ms 548 KB n = 2
5 Correct 2 ms 620 KB n = 2
6 Correct 2 ms 676 KB n = 2
7 Correct 1 ms 724 KB n = 3
8 Correct 1 ms 728 KB n = 3
9 Correct 2 ms 732 KB n = 3
10 Correct 2 ms 736 KB n = 8
11 Correct 2 ms 740 KB n = 8
12 Correct 2 ms 760 KB n = 8
13 Correct 2 ms 768 KB n = 8
14 Correct 2 ms 772 KB n = 8
15 Correct 2 ms 776 KB n = 8
16 Correct 1 ms 776 KB n = 8
17 Correct 2 ms 784 KB n = 8
18 Correct 2 ms 788 KB n = 8
19 Correct 1 ms 792 KB n = 3
20 Correct 1 ms 796 KB n = 7
21 Correct 2 ms 800 KB n = 8
22 Correct 2 ms 800 KB n = 8
23 Correct 1 ms 808 KB n = 8
24 Correct 2 ms 812 KB n = 8
25 Correct 2 ms 816 KB n = 8
26 Correct 2 ms 820 KB n = 8
27 Correct 2 ms 824 KB n = 8
28 Correct 1 ms 828 KB n = 8
29 Correct 46 ms 9032 KB n = 16
30 Correct 48 ms 9032 KB n = 16
31 Correct 46 ms 9044 KB n = 16
32 Correct 54 ms 9044 KB n = 16
33 Correct 45 ms 9044 KB n = 16
34 Correct 50 ms 9044 KB n = 16
35 Correct 53 ms 9056 KB n = 16
36 Correct 21 ms 9056 KB n = 15
37 Correct 2 ms 9056 KB n = 8
38 Correct 55 ms 9076 KB n = 16
39 Correct 55 ms 9192 KB n = 16
40 Correct 2 ms 9192 KB n = 9
41 Correct 47 ms 9192 KB n = 16
42 Correct 47 ms 9192 KB n = 16
43 Correct 54 ms 9192 KB n = 16
44 Correct 2 ms 9192 KB n = 9
45 Correct 27 ms 9192 KB n = 15
46 Correct 62 ms 9192 KB n = 16
47 Correct 45 ms 9192 KB n = 16
48 Correct 49 ms 9192 KB n = 16
49 Runtime error 95 ms 14240 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -