oj.uz

Submission #436056

# Submission time Handle Problem Language Result Execution time Memory
436056 2021-06-24T07:08:14 Z cfalas Roller Coaster Railroad (IOI16_railroad) C++14
11 / 100
 2000 ms 6468 KB 
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)
#include "railroad.h"

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
	vii m(n);
	//FOR(i,n) cout<<s[i]<<" ";
	//cout<<endl;
	//FOR(i,n) cout<<t[i]<<" ";
	//cout<<endl;
	FOR(i,n) m[i] = {s[i], t[i]};
	//FOR(i,n) cout<<m[i].F<<" "<<m[i].S<<endl;
	sort(m.begin(), m.end());
	ll ans=HASHMOD;
	do{
		int p=1;
		bool ok = true;
		ll cans=0;
		FOA(v,m){
			cans+=max(0ll, p-v.F);
			p = v.S;
		}
		//FOA(v,m) cout<<"("<<v.F<<" "<<v.S<<") ";
		//cout<<cans<<endl;
		if(ok) ans = min(ans, cans);
	}while(next_permutation(m.begin(), m.end()));
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 23.0

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