oj.uz

Submission #605066

# Submission time Handle Problem Language Result Execution time Memory
605066 2022-07-25T12:41:46 Z sysia Treatment Project (JOI20_treatment) C++17
35 / 100
 3000 ms 10540 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
const int oo = 1e18, K = 30;

struct project{
	int t, l, r, c; 
	pair<int, int>L, R;
	void read(){
		cin >> t >> l >> r >> c;
		r++;
		L = {t-l, l+t};
		R = {t-r, r+t};
		// debug(L, R);
	}
};

void solve(){
	int n, m; cin >> n >> m;
	vector<project>a(m);
	for (int i = 0; i<m; i++) a[i].read();
	vector<int>dist(m, oo);
	set<pair<int, int>>s;
	for (int i = 0; i<m; i++){
		if (a[i].l == 1){
			dist[i] = a[i].c;
			s.insert({a[i].c, i});
		}
	}
	while (s.size()){
		int v = s.begin()->second;
		int d = s.begin()->first;
		s.erase(s.begin());
		if (dist[v] < d) continue;
		for (int x = 0; x<m; x++){
			if (a[x].L.first >= a[v].R.first && a[x].L.second <= a[v].R.second){
				if (dist[x] > d + a[x].c){
					dist[x] = d+a[x].c;
					s.insert({dist[x], x});
				}
			}
		}
	}

	int ans = oo;
	for (int i = 0; i<m; i++){
		if (a[i].r == n+1){
			// debug(i, dist[i]);
			ans = min(ans, dist[i]);
		}
	}
	if (ans == oo) cout << "-1\n";
	else cout << ans << "\n";
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	solve();
	
	return 0;
}

Subtask #1
0 / 4.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 324 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 99 ms 852 KB Output is correct
21 Correct 91 ms 872 KB Output is correct
22 Correct 84 ms 768 KB Output is correct
23 Correct 56 ms 768 KB Output is correct
24 Correct 80 ms 1096 KB Output is correct
25 Correct 44 ms 852 KB Output is correct
26 Correct 33 ms 852 KB Output is correct
27 Correct 41 ms 852 KB Output is correct
28 Correct 82 ms 1100 KB Output is correct
29 Correct 46 ms 844 KB Output is correct
30 Correct 3 ms 772 KB Output is correct
31 Correct 3 ms 764 KB Output is correct
32 Correct 129 ms 1108 KB Output is correct
33 Correct 69 ms 1152 KB Output is correct
34 Correct 87 ms 892 KB Output is correct
35 Correct 133 ms 1108 KB Output is correct
36 Correct 76 ms 1108 KB Output is correct
37 Correct 73 ms 828 KB Output is correct

Subtask #4
0 / 61.0

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