oj.uz

Submission #429057

# Submission time Handle Problem Language Result Execution time Memory
429057 2021-06-15T17:01:54 Z LouayFarah Roller Coaster Railroad (IOI16_railroad) C++14
11 / 100
 2000 ms 7988 KB 
#include "bits/stdc++.h"
#include "railroad.h"
using namespace std;

long long plan_roller_coaster(vector<int> s, vector<int> t)
{
    int n = (int)s.size();

    if(n<=16)
    {
        vector<int> pos(n);
        for(int i = 0; i<n; i++)
            pos[i] = i;

        long long res = 1e18;
        do
        {
            int speed = 1;
            long long curr = 0;
            for(int i = 0; i<n; i++)
            {
                if(speed>s[pos[i]])
                    curr+=speed-s[pos[i]];
                speed = t[pos[i]];
            }
            res = min(res, curr);
        }while(next_permutation(pos.begin(), pos.end()));
        return res;
    }

    
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
   32 | }
      | ^

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB n = 2
2 Correct 1 ms 204 KB n = 2
3 Correct 1 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 1 ms 204 KB n = 2
6 Correct 1 ms 204 KB n = 2
7 Correct 1 ms 204 KB n = 3
8 Correct 1 ms 296 KB n = 3
9 Correct 1 ms 256 KB n = 3
10 Correct 1 ms 204 KB n = 8
11 Correct 2 ms 204 KB n = 8
12 Correct 2 ms 204 KB n = 8
13 Correct 2 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 2 ms 204 KB n = 8
16 Correct 2 ms 204 KB n = 8
17 Correct 2 ms 204 KB n = 8
18 Correct 2 ms 204 KB n = 8
19 Correct 1 ms 296 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 2 ms 292 KB n = 8
22 Correct 2 ms 204 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 2 ms 256 KB n = 8
25 Correct 2 ms 204 KB n = 8
26 Correct 2 ms 292 KB n = 8
27 Correct 2 ms 236 KB n = 8
28 Correct 2 ms 204 KB n = 8
29 Execution timed out 2074 ms 204 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2061 ms 7988 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB n = 2
2 Correct 1 ms 204 KB n = 2
3 Correct 1 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 1 ms 204 KB n = 2
6 Correct 1 ms 204 KB n = 2
7 Correct 1 ms 204 KB n = 3
8 Correct 1 ms 296 KB n = 3
9 Correct 1 ms 256 KB n = 3
10 Correct 1 ms 204 KB n = 8
11 Correct 2 ms 204 KB n = 8
12 Correct 2 ms 204 KB n = 8
13 Correct 2 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 2 ms 204 KB n = 8
16 Correct 2 ms 204 KB n = 8
17 Correct 2 ms 204 KB n = 8
18 Correct 2 ms 204 KB n = 8
19 Correct 1 ms 296 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 2 ms 292 KB n = 8
22 Correct 2 ms 204 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 2 ms 256 KB n = 8
25 Correct 2 ms 204 KB n = 8
26 Correct 2 ms 292 KB n = 8
27 Correct 2 ms 236 KB n = 8
28 Correct 2 ms 204 KB n = 8
29 Execution timed out 2074 ms 204 KB Time limit exceeded
30 Halted 0 ms 0 KB -