oj.uz

Submission #896449

# Submission time Handle Problem Language Result Execution time Memory
896449 2024-01-01T13:20:34 Z guechotjrhh Treatment Project (JOI20_treatment) C++14
4 / 100
 73 ms 14464 KB 
#include <iostream>
#include<vector>
#include<set>
#include<map>
#include<fstream>
#include<algorithm>
using namespace std;
#define ll long long
#define pi pair<ll,ll>
#define x first
#define y second
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define l x.x
#define r x.y
#define t y.x
#define p y.y

ll min(ll a, ll b) { return a < b ? a : b; }
int s, n;
long long func(int S, int N, vector<int> T, vector<int> L, vector<int> R, vector<int> P) {
	s = S; n = N;
	//t[i] == 1:
	map<int, ll> mp;
	vector<pair<pi, pi>> vec(n);
	for (int i = 0; i < n; i++) {
		vec[i] = { {L[i],R[i]}, {T[i],P[i]} };
	}
	sort(all(vec));
	mp[s + 1] = 0;
	for (int i = n - 1; i >= 0; i--) {
		auto it = mp.upper_bound(vec[i].r + 1);
		if (it != mp.begin()) {
			it--;
			if (mp.find(vec[i].l) == mp.end()) mp[vec[i].l] = vec[i].p + it->y;
			else mp[vec[i].l] = min(mp[vec[i].l], vec[i].p + it->y);

			auto it = mp.find(vec[i].l);
			while (next(it) != mp.end() && it->y < next(it)->y) mp.erase(next(it));
		}
	}
	if (mp.find(1) != mp.end()) return mp[1];
	return -1;
}

void run_tests() {
	string name = "01-00.txt";
	for (int i = 1; i <= 18; i++) {
		name[3] = '0' + i / 10;
		name[4] = '0' + i % 10;
		ifstream fin("in/" + name);
		ifstream fout("out/" + name);

		int S, N;
		fin >> S >> N;

		vector<int> T(N), L(N), R(N), P(N);
		for (int i = 0; i < N; i++) fin >> T[i] >> L[i] >> R[i] >> P[i];

		ll u = func(S, N, T, L, R, P),u1;
		fout >> u1;
		if (u != u1) {
			cout << i << endl;
			cout << S << ' ' << N << endl;
			cout << u << ' ' << u1 << endl;
			//for (int i = 0; i < N; i++) cout << T[i] << ' ' << L[i] << ' ' << R[i] << ' ' << P[i] << endl;
			return;
		}
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	//run_tests();
	//return 0;

	int S, N;
	cin >> S >> N;
	
	vector<int> T(N), L(N), R(N), P(N);
	for (int i = 0; i < N; i++) cin >> T[i] >> L[i] >> R[i] >> P[i];

	cout << func(S, N, move(T), move(L), move(R), move(P)) << endl;

	return 0;
}
/*
10 5
2 5 10 3
1 1 6 5
5 2 8 3
7 6 10 4
4 1 3 1

7
*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 14464 KB Output is correct
2 Correct 60 ms 11856 KB Output is correct
3 Correct 67 ms 10320 KB Output is correct
4 Correct 73 ms 10456 KB Output is correct
5 Correct 50 ms 8108 KB Output is correct
6 Correct 41 ms 8164 KB Output is correct
7 Correct 61 ms 8652 KB Output is correct
8 Correct 39 ms 8240 KB Output is correct
9 Correct 35 ms 8028 KB Output is correct
10 Correct 34 ms 8156 KB Output is correct
11 Correct 43 ms 8272 KB Output is correct
12 Correct 45 ms 8272 KB Output is correct
13 Correct 46 ms 8012 KB Output is correct
14 Correct 52 ms 8396 KB Output is correct
15 Correct 48 ms 8252 KB Output is correct
16 Correct 48 ms 8272 KB Output is correct
17 Correct 47 ms 8268 KB Output is correct
18 Correct 48 ms 7764 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 14464 KB Output is correct
2 Correct 60 ms 11856 KB Output is correct
3 Correct 67 ms 10320 KB Output is correct
4 Correct 73 ms 10456 KB Output is correct
5 Correct 50 ms 8108 KB Output is correct
6 Correct 41 ms 8164 KB Output is correct
7 Correct 61 ms 8652 KB Output is correct
8 Correct 39 ms 8240 KB Output is correct
9 Correct 35 ms 8028 KB Output is correct
10 Correct 34 ms 8156 KB Output is correct
11 Correct 43 ms 8272 KB Output is correct
12 Correct 45 ms 8272 KB Output is correct
13 Correct 46 ms 8012 KB Output is correct
14 Correct 52 ms 8396 KB Output is correct
15 Correct 48 ms 8252 KB Output is correct
16 Correct 48 ms 8272 KB Output is correct
17 Correct 47 ms 8268 KB Output is correct
18 Correct 48 ms 7764 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Incorrect 0 ms 348 KB Output isn't correct
21 Halted 0 ms 0 KB -