Submission #789788

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
789788	2023-07-22T03:49:38 Z	Shithila	Roller Coaster Railroad (IOI16_railroad)	C++14	11 / 100	2000 ms	4180 KB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    vector<int> arr(n,0);
    long long min=0;
    for(int i=0;i<n;i++)
    {
        arr[i]=i;
        if(i>0 && s[arr[i]]<t[arr[i-1]])
        {
        	min=min-s[arr[i]]+t[arr[i-1]];
		}
    }
    
    do
    {
    	long long tempmin=0;
        for(int i=0;i<n;i++)
        {
           
        	if(i>0 && s[arr[i]]<t[arr[i-1]])
        	{
        		tempmin=tempmin-s[arr[i]]+t[arr[i-1]];
			}
        }
       	if(tempmin<min)
       	{
       		min=tempmin;
		}
    } while (next_permutation(arr.begin(),arr.end()));
    
    return min;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	n = 2
2	Correct	0 ms	212 KB	n = 2
3	Correct	0 ms	212 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	0 ms	212 KB	n = 3
10	Correct	1 ms	212 KB	n = 8
11	Correct	1 ms	212 KB	n = 8
12	Correct	1 ms	212 KB	n = 8
13	Correct	1 ms	212 KB	n = 8
14	Correct	1 ms	212 KB	n = 8
15	Correct	1 ms	212 KB	n = 8
16	Correct	1 ms	212 KB	n = 8
17	Correct	1 ms	212 KB	n = 8
18	Correct	1 ms	212 KB	n = 8
19	Correct	0 ms	212 KB	n = 3
20	Correct	1 ms	212 KB	n = 7
21	Correct	1 ms	212 KB	n = 8
22	Correct	1 ms	212 KB	n = 8
23	Correct	1 ms	212 KB	n = 8
24	Correct	1 ms	212 KB	n = 8
25	Correct	1 ms	212 KB	n = 8

Subtask #2

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	n = 2
2	Correct	0 ms	212 KB	n = 2
3	Correct	0 ms	212 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	0 ms	212 KB	n = 3
10	Correct	1 ms	212 KB	n = 8
11	Correct	1 ms	212 KB	n = 8
12	Correct	1 ms	212 KB	n = 8
13	Correct	1 ms	212 KB	n = 8
14	Correct	1 ms	212 KB	n = 8
15	Correct	1 ms	212 KB	n = 8
16	Correct	1 ms	212 KB	n = 8
17	Correct	1 ms	212 KB	n = 8
18	Correct	1 ms	212 KB	n = 8
19	Correct	0 ms	212 KB	n = 3
20	Correct	1 ms	212 KB	n = 7
21	Correct	1 ms	212 KB	n = 8
22	Correct	1 ms	212 KB	n = 8
23	Correct	1 ms	212 KB	n = 8
24	Correct	1 ms	212 KB	n = 8
25	Correct	1 ms	212 KB	n = 8
26	Correct	1 ms	212 KB	n = 8
27	Correct	1 ms	212 KB	n = 8
28	Correct	2 ms	212 KB	n = 8
29	Execution timed out	2054 ms	212 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	2065 ms	4180 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	212 KB	n = 2
2	Correct	0 ms	212 KB	n = 2
3	Correct	0 ms	212 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	0 ms	212 KB	n = 3
10	Correct	1 ms	212 KB	n = 8
11	Correct	1 ms	212 KB	n = 8
12	Correct	1 ms	212 KB	n = 8
13	Correct	1 ms	212 KB	n = 8
14	Correct	1 ms	212 KB	n = 8
15	Correct	1 ms	212 KB	n = 8
16	Correct	1 ms	212 KB	n = 8
17	Correct	1 ms	212 KB	n = 8
18	Correct	1 ms	212 KB	n = 8
19	Correct	0 ms	212 KB	n = 3
20	Correct	1 ms	212 KB	n = 7
21	Correct	1 ms	212 KB	n = 8
22	Correct	1 ms	212 KB	n = 8
23	Correct	1 ms	212 KB	n = 8
24	Correct	1 ms	212 KB	n = 8
25	Correct	1 ms	212 KB	n = 8
26	Correct	1 ms	212 KB	n = 8
27	Correct	1 ms	212 KB	n = 8
28	Correct	2 ms	212 KB	n = 8
29	Execution timed out	2054 ms	212 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-