oj.uz

Submission #421583

# Submission time Handle Problem Language Result Execution time Memory
421583 2021-06-09T09:39:35 Z balbit Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
 72 ms 15920 KB 
#include "railroad.h"

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair <int, int >
#define f first
#define s second

#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())


#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y) {cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#endif // BALBIT


#define pb push_back
#define REP(i,n) for (int i = 0; i<(n); ++i)
#define REP1(i,n) for (int i = 1; i<=(n); ++i)


//signed main(){
//    bug(1,2);
//}

ll dp[1<<16][17];

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    memset(dp, 0x3f, sizeof dp);
    ll re = 0x3f3f3f3f3f3f3f3f;
    REP(m,1<<n) {
        REP(v,n) {
            if (m & (1<<v)) {
                if (m==(1<<v)) {
                    dp[m][v] = 0;
                    continue;
                }
                REP(u,n) {
                    if (u!=v && m & (1<<u)) {
                        MN(dp[m][v], dp[m^(1<<v)][u] + max(0,  t[u] - s[v]));
                    }
                }
            }
            if (m == (1<<n)-1) {
                MN(re, dp[m][v]);
            }
        }
    }

    return re;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9036 KB n = 2
2 Correct 4 ms 9004 KB n = 2
3 Correct 4 ms 9000 KB n = 2
4 Correct 5 ms 8908 KB n = 2
5 Correct 5 ms 8908 KB n = 2
6 Correct 4 ms 8908 KB n = 2
7 Correct 4 ms 8908 KB n = 3
8 Correct 4 ms 8908 KB n = 3
9 Correct 4 ms 8908 KB n = 3
10 Correct 5 ms 8908 KB n = 8
11 Correct 4 ms 8908 KB n = 8
12 Correct 4 ms 8908 KB n = 8
13 Correct 4 ms 8908 KB n = 8
14 Correct 4 ms 8908 KB n = 8
15 Correct 5 ms 8908 KB n = 8
16 Correct 4 ms 8908 KB n = 8
17 Correct 4 ms 8908 KB n = 8
18 Correct 4 ms 9004 KB n = 8
19 Correct 5 ms 8908 KB n = 3
20 Correct 4 ms 8908 KB n = 7
21 Correct 4 ms 8908 KB n = 8
22 Correct 4 ms 9004 KB n = 8
23 Correct 4 ms 8908 KB n = 8
24 Correct 4 ms 8908 KB n = 8
25 Correct 4 ms 9004 KB n = 8
26 Correct 5 ms 8908 KB n = 8
27 Correct 4 ms 8908 KB n = 8
28 Correct 5 ms 8908 KB n = 8
29 Correct 38 ms 9012 KB n = 16
30 Correct 40 ms 8908 KB n = 16
31 Correct 38 ms 8996 KB n = 16
32 Correct 38 ms 8908 KB n = 16
33 Correct 39 ms 8996 KB n = 16
34 Correct 39 ms 9012 KB n = 16
35 Correct 39 ms 8908 KB n = 16
36 Correct 21 ms 9000 KB n = 15
37 Correct 4 ms 8908 KB n = 8
38 Correct 41 ms 8992 KB n = 16
39 Correct 41 ms 8908 KB n = 16
40 Correct 4 ms 8908 KB n = 9
41 Correct 47 ms 8908 KB n = 16
42 Correct 39 ms 9004 KB n = 16
43 Correct 47 ms 8908 KB n = 16
44 Correct 5 ms 8908 KB n = 9
45 Correct 20 ms 9000 KB n = 15
46 Correct 40 ms 8908 KB n = 16
47 Correct 41 ms 8996 KB n = 16
48 Correct 40 ms 8992 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 72 ms 15920 KB answer is not correct: 1 instead of 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9036 KB n = 2
2 Correct 4 ms 9004 KB n = 2
3 Correct 4 ms 9000 KB n = 2
4 Correct 5 ms 8908 KB n = 2
5 Correct 5 ms 8908 KB n = 2
6 Correct 4 ms 8908 KB n = 2
7 Correct 4 ms 8908 KB n = 3
8 Correct 4 ms 8908 KB n = 3
9 Correct 4 ms 8908 KB n = 3
10 Correct 5 ms 8908 KB n = 8
11 Correct 4 ms 8908 KB n = 8
12 Correct 4 ms 8908 KB n = 8
13 Correct 4 ms 8908 KB n = 8
14 Correct 4 ms 8908 KB n = 8
15 Correct 5 ms 8908 KB n = 8
16 Correct 4 ms 8908 KB n = 8
17 Correct 4 ms 8908 KB n = 8
18 Correct 4 ms 9004 KB n = 8
19 Correct 5 ms 8908 KB n = 3
20 Correct 4 ms 8908 KB n = 7
21 Correct 4 ms 8908 KB n = 8
22 Correct 4 ms 9004 KB n = 8
23 Correct 4 ms 8908 KB n = 8
24 Correct 4 ms 8908 KB n = 8
25 Correct 4 ms 9004 KB n = 8
26 Correct 5 ms 8908 KB n = 8
27 Correct 4 ms 8908 KB n = 8
28 Correct 5 ms 8908 KB n = 8
29 Correct 38 ms 9012 KB n = 16
30 Correct 40 ms 8908 KB n = 16
31 Correct 38 ms 8996 KB n = 16
32 Correct 38 ms 8908 KB n = 16
33 Correct 39 ms 8996 KB n = 16
34 Correct 39 ms 9012 KB n = 16
35 Correct 39 ms 8908 KB n = 16
36 Correct 21 ms 9000 KB n = 15
37 Correct 4 ms 8908 KB n = 8
38 Correct 41 ms 8992 KB n = 16
39 Correct 41 ms 8908 KB n = 16
40 Correct 4 ms 8908 KB n = 9
41 Correct 47 ms 8908 KB n = 16
42 Correct 39 ms 9004 KB n = 16
43 Correct 47 ms 8908 KB n = 16
44 Correct 5 ms 8908 KB n = 9
45 Correct 20 ms 9000 KB n = 15
46 Correct 40 ms 8908 KB n = 16
47 Correct 41 ms 8996 KB n = 16
48 Correct 40 ms 8992 KB n = 16
49 Incorrect 72 ms 15920 KB answer is not correct: 1 instead of 0
50 Halted 0 ms 0 KB -