oj.uz

Submission #787429

# Submission time Handle Problem Language Result Execution time Memory
787429 2023-07-19T07:32:56 Z Sohsoh84 Roller Coaster Railroad (IOI16_railroad) C++17
0 / 100
 164 ms 19080 KB 
#include "railroad.h"
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

#define all(x)		(x).begin(), (x).end()
#define debug(x)	cerr << #x << ": " << x << endl;
#define sep		' '

const ll MAXN = 3e6 + 10;

ll f[MAXN], n, m;
vector<ll> comp_vec;

inline int ind(ll x) {
	return lower_bound(all(comp_vec), x) - comp_vec.begin() + 1;
}

ll plan_roller_coaster(vector<int> s, vector<int> t) {
	n = s.size();
	for (int i = 0; i < n; i++)
		comp_vec.push_back(s[i]), comp_vec.push_back(t[i]);

	sort(all(comp_vec));
	m = comp_vec.size();

	multiset<int> st;

	for (int i = 0; i < n; i++)
		f[ind(s[i])]++, f[ind(t[i])]--;

	for (int i = 1; i <= m; i++) {
		for (int j = 0; j < f[i]; j++)
			st.insert(i);
	}

	ll ans = 0, mx = 0;
	for (int i = 1; i <= m; i++) {
		while (f[i] < 0) {
			auto it = st.lower_bound(i);
			if (it != st.end()) st.erase(it);
			else {
				it = prev(it);
				ll val = comp_vec[i - 1] - comp_vec[*it - 1];
				ans += val;
				mx = max(mx, val);
			}

			f[i]++;
		}
	}

	return ans;
}

Subtask #1
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 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Incorrect 0 ms 212 KB answer is not correct: 1160623460 instead of 523688153
7 Halted 0 ms 0 KB -

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 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Incorrect 0 ms 212 KB answer is not correct: 1160623460 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 18996 KB n = 199999
2 Correct 164 ms 19052 KB n = 199991
3 Correct 159 ms 19080 KB n = 199993
4 Correct 116 ms 14552 KB n = 152076
5 Correct 69 ms 9060 KB n = 93249
6 Correct 146 ms 17768 KB n = 199910
7 Correct 154 ms 18876 KB n = 199999
8 Correct 143 ms 17520 KB n = 199997
9 Correct 142 ms 16308 KB n = 171294
10 Incorrect 110 ms 13472 KB answer is not correct: 1 instead of 0
11 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 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Incorrect 0 ms 212 KB answer is not correct: 1160623460 instead of 523688153
7 Halted 0 ms 0 KB -