oj.uz

Submission #420342

# Submission time Handle Problem Language Result Execution time Memory
420342 2021-06-08T09:56:07 Z alishahali1382 Treatment Project (JOI20_treatment) C++17
35 / 100
 3000 ms 3268 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef pair<pii, int> piii;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<" "<<p.second<<"}\n";}
#define debugv(abcd) {cerr<<#abcd<<": ";for (auto dcba:abcd) cerr<<dcba<<" ";cerr<<"\n";}
#define pb push_back
#define all(x) x.begin(), x.end()
#define kill(x) return cout<<x<<"\n", 0;
#define SZ(x) ((int)x.size())

const int inf=1000010000;
const ll INF=10000000000100000ll; // 1e16
const int mod=1000000007;
const int MAXN=100010;

int n, m, q, k, u, v, x, y, t;
int L[MAXN], R[MAXN], T[MAXN], C[MAXN];
int mark[MAXN];
ll dist[MAXN], ans=INF;
priority_queue<pll, vector<pll>, greater<pll>> pq;

inline bool upd(ll &x, ll y){
	if (x<=y) return 0;
	x=y;
	return 1;
}

int main(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	memset(dist, 63, sizeof(dist));
	cin>>n>>m;
	for (int i=1; i<=m; i++){
		cin>>T[i]>>L[i]>>R[i]>>C[i];
		L[i]--;
		if (!L[i]) pq.push({dist[i]=C[i], i});
	}
	while (pq.size()){
		int v=pq.top().second;
		pq.pop();
		mark[v]=2;
		for (int i=1; i<=m; i++) if (!mark[i]){
			bool ok=0;
			if (T[i]<=T[v]){
				ok=(L[i]+(T[v]-T[i])<=R[v]);
			}
			else{
				ok=(L[i]<=R[v]-(T[i]-T[v]));
			}
			if (!ok) continue ;
			mark[i]=upd(dist[i], dist[v]+C[i]);
			if (mark[i]) pq.push({dist[i], i});
			assert(mark[i] || !L[i]);
		}
	}
	for (int i=1; i<=m; i++) if (R[i]==n) upd(ans, dist[i]);
	if (ans>=INF) ans=-1;
	cout<<ans<<"\n";

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

10 5
2 6 10 3
1 1 5 5
5 2 7 3
8 6 10 4
4 1 3 1

10 5
1 5 10 4
1 1 6 5
1 4 8 3
1 6 10 3
1 1 3 1


*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3078 ms 3268 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 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 79 ms 1356 KB Output is correct
21 Correct 72 ms 1376 KB Output is correct
22 Correct 98 ms 1392 KB Output is correct
23 Correct 72 ms 1344 KB Output is correct
24 Correct 57 ms 1512 KB Output is correct
25 Correct 55 ms 1356 KB Output is correct
26 Correct 46 ms 1376 KB Output is correct
27 Correct 49 ms 1356 KB Output is correct
28 Correct 60 ms 1616 KB Output is correct
29 Correct 51 ms 1356 KB Output is correct
30 Correct 4 ms 1356 KB Output is correct
31 Correct 4 ms 1356 KB Output is correct
32 Correct 30 ms 1732 KB Output is correct
33 Correct 28 ms 1592 KB Output is correct
34 Correct 121 ms 1396 KB Output is correct
35 Correct 31 ms 1484 KB Output is correct
36 Correct 28 ms 1504 KB Output is correct
37 Correct 128 ms 1348 KB Output is correct

Subtask #4
0 / 61.0

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