oj.uz

Submission #518252

# Submission time Handle Problem Language Result Execution time Memory
518252 2022-01-23T09:10:28 Z Koosha_mv Treatment Project (JOI20_treatment) C++14
100 / 100
 381 ms 26152 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll
 
const int N=2e5+99,inf=1e18,S=2;
 
int n,m,prt,ans=inf,a[N],l[N],t[N],r[N],cost[N],dist[N],seg[S][N<<1];
vector<int> g[N];
vector<pair<int,int> > v[S];
 
int merge(int u,int v,int s){
	if(s==0){
		if(n==max(u,v)) return u+v-n;
		if(t[u]<t[v]) return u;
		return v;
	}
	if(n==max(u,v)) return u+v-n;
	if(t[u]>t[v]) return u;
	return v;
}
void build(int s){
	f(i,0,n){
		seg[s][i+n]=v[s][i].S;
	}
	f_(i,n-1,1){
		seg[s][i]=merge(seg[s][i<<1],seg[s][i<<1|1],s);
	}
}
int get(int l, int r,int s){
	int res=n;
	for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
		if (l&1){
			res=merge(res,seg[s][l++],s);
		}
		if (r&1){
			res=merge(res,seg[s][--r],s);
		}
	}
	return res;
}
void del(int x){
	int id;
	id=lower_bound(all(v[0]),mp(l[x]-t[x],x))-v[0].begin()+n;
	seg[0][id]=n;
	while(id>1){
		seg[0][id>>1]=merge(seg[0][id],seg[0][id^1],0);
		id>>=1;
	}
	id=lower_bound(all(v[1]),mp(l[x]+t[x],x))-v[1].begin()+n;
	seg[1][id]=n;
	while(id>1){
		seg[1][id>>1]=merge(seg[1][id],seg[1][id^1],1);
		id>>=1;
	}
}
void bfs(){
	set<pair<int,int> > s;
	f(i,0,n){
		if(l[i]==0){
			del(i);
			dist[i]=cost[i];
			s.insert({dist[i],i});
		}
	}
	while(s.size()){
		int adj,u=(*s.begin()).S;
		s.erase(*s.begin());
		//cout<<u<<" -> "<<dist[u]<<endl;
		if(r[u]==m) minm(ans,dist[u]);
		prt=lower_bound(all(v[0]),mp(r[u]-t[u],inf))-v[0].begin();
		while(get(0,prt,0)<n && t[get(0,prt,0)]<=t[u]){
			adj=get(0,prt,0);
			del(adj);
			dist[adj]=dist[u]+cost[adj];
			s.insert({dist[adj],adj});
		}
		prt=lower_bound(all(v[1]),mp(r[u]+t[u],inf))-v[1].begin();
		while(get(0,prt,1)<n && t[u]<=t[get(0,prt,1)]){
			adj=get(0,prt,1);
			del(adj);
			dist[adj]=dist[u]+cost[adj];
			s.insert({dist[adj],adj});
		}
	}
}
 
main(){
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin>>m>>n;
	fill(dist,dist+N,inf);
	f(i,0,n){
		cin>>t[i]>>l[i]>>r[i]>>cost[i]; l[i]--;
		v[0].pb({l[i]-t[i],i});
		v[1].pb({l[i]+t[i],i});
	}
	sort(all(v[0]));
	sort(all(v[1]));
	build(0);
	build(1);
	bfs();
	cout<<(ans==inf ? -1 : ans);
}

Compilation message

treatment.cpp:106:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  106 | main(){
      | ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 19440 KB Output is correct
2 Correct 90 ms 19320 KB Output is correct
3 Correct 178 ms 20836 KB Output is correct
4 Correct 174 ms 19920 KB Output is correct
5 Correct 214 ms 25040 KB Output is correct
6 Correct 174 ms 19524 KB Output is correct
7 Correct 183 ms 19332 KB Output is correct
8 Correct 75 ms 19228 KB Output is correct
9 Correct 67 ms 19252 KB Output is correct
10 Correct 67 ms 19308 KB Output is correct
11 Correct 251 ms 25456 KB Output is correct
12 Correct 265 ms 25436 KB Output is correct
13 Correct 239 ms 23620 KB Output is correct
14 Correct 222 ms 23520 KB Output is correct
15 Correct 186 ms 19368 KB Output is correct
16 Correct 204 ms 19304 KB Output is correct
17 Correct 194 ms 18568 KB Output is correct
18 Correct 228 ms 24676 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 5 ms 6604 KB Output is correct
3 Correct 5 ms 6608 KB Output is correct
4 Correct 5 ms 6628 KB Output is correct
5 Correct 4 ms 6556 KB Output is correct
6 Correct 5 ms 6608 KB Output is correct
7 Correct 4 ms 6608 KB Output is correct
8 Correct 4 ms 6608 KB Output is correct
9 Correct 5 ms 6608 KB Output is correct
10 Correct 6 ms 6556 KB Output is correct
11 Correct 5 ms 6540 KB Output is correct
12 Correct 4 ms 6608 KB Output is correct
13 Correct 4 ms 6608 KB Output is correct
14 Correct 5 ms 6564 KB Output is correct
15 Correct 3 ms 6608 KB Output is correct
16 Correct 5 ms 6556 KB Output is correct
17 Correct 6 ms 6616 KB Output is correct
18 Correct 4 ms 6608 KB Output is correct
19 Correct 6 ms 6564 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6604 KB Output is correct
2 Correct 5 ms 6604 KB Output is correct
3 Correct 5 ms 6608 KB Output is correct
4 Correct 5 ms 6628 KB Output is correct
5 Correct 4 ms 6556 KB Output is correct
6 Correct 5 ms 6608 KB Output is correct
7 Correct 4 ms 6608 KB Output is correct
8 Correct 4 ms 6608 KB Output is correct
9 Correct 5 ms 6608 KB Output is correct
10 Correct 6 ms 6556 KB Output is correct
11 Correct 5 ms 6540 KB Output is correct
12 Correct 4 ms 6608 KB Output is correct
13 Correct 4 ms 6608 KB Output is correct
14 Correct 5 ms 6564 KB Output is correct
15 Correct 3 ms 6608 KB Output is correct
16 Correct 5 ms 6556 KB Output is correct
17 Correct 6 ms 6616 KB Output is correct
18 Correct 4 ms 6608 KB Output is correct
19 Correct 6 ms 6564 KB Output is correct
20 Correct 10 ms 7332 KB Output is correct
21 Correct 10 ms 7376 KB Output is correct
22 Correct 10 ms 7312 KB Output is correct
23 Correct 9 ms 7332 KB Output is correct
24 Correct 16 ms 7596 KB Output is correct
25 Correct 11 ms 7368 KB Output is correct
26 Correct 11 ms 7320 KB Output is correct
27 Correct 15 ms 7428 KB Output is correct
28 Correct 19 ms 7460 KB Output is correct
29 Correct 15 ms 7380 KB Output is correct
30 Correct 8 ms 7376 KB Output is correct
31 Correct 6 ms 7368 KB Output is correct
32 Correct 14 ms 7532 KB Output is correct
33 Correct 11 ms 7552 KB Output is correct
34 Correct 10 ms 7396 KB Output is correct
35 Correct 12 ms 7544 KB Output is correct
36 Correct 11 ms 7508 KB Output is correct
37 Correct 11 ms 7276 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 19440 KB Output is correct
2 Correct 90 ms 19320 KB Output is correct
3 Correct 178 ms 20836 KB Output is correct
4 Correct 174 ms 19920 KB Output is correct
5 Correct 214 ms 25040 KB Output is correct
6 Correct 174 ms 19524 KB Output is correct
7 Correct 183 ms 19332 KB Output is correct
8 Correct 75 ms 19228 KB Output is correct
9 Correct 67 ms 19252 KB Output is correct
10 Correct 67 ms 19308 KB Output is correct
11 Correct 251 ms 25456 KB Output is correct
12 Correct 265 ms 25436 KB Output is correct
13 Correct 239 ms 23620 KB Output is correct
14 Correct 222 ms 23520 KB Output is correct
15 Correct 186 ms 19368 KB Output is correct
16 Correct 204 ms 19304 KB Output is correct
17 Correct 194 ms 18568 KB Output is correct
18 Correct 228 ms 24676 KB Output is correct
19 Correct 4 ms 6604 KB Output is correct
20 Correct 5 ms 6604 KB Output is correct
21 Correct 5 ms 6608 KB Output is correct
22 Correct 5 ms 6628 KB Output is correct
23 Correct 4 ms 6556 KB Output is correct
24 Correct 5 ms 6608 KB Output is correct
25 Correct 4 ms 6608 KB Output is correct
26 Correct 4 ms 6608 KB Output is correct
27 Correct 5 ms 6608 KB Output is correct
28 Correct 6 ms 6556 KB Output is correct
29 Correct 5 ms 6540 KB Output is correct
30 Correct 4 ms 6608 KB Output is correct
31 Correct 4 ms 6608 KB Output is correct
32 Correct 5 ms 6564 KB Output is correct
33 Correct 3 ms 6608 KB Output is correct
34 Correct 5 ms 6556 KB Output is correct
35 Correct 6 ms 6616 KB Output is correct
36 Correct 4 ms 6608 KB Output is correct
37 Correct 6 ms 6564 KB Output is correct
38 Correct 10 ms 7332 KB Output is correct
39 Correct 10 ms 7376 KB Output is correct
40 Correct 10 ms 7312 KB Output is correct
41 Correct 9 ms 7332 KB Output is correct
42 Correct 16 ms 7596 KB Output is correct
43 Correct 11 ms 7368 KB Output is correct
44 Correct 11 ms 7320 KB Output is correct
45 Correct 15 ms 7428 KB Output is correct
46 Correct 19 ms 7460 KB Output is correct
47 Correct 15 ms 7380 KB Output is correct
48 Correct 8 ms 7376 KB Output is correct
49 Correct 6 ms 7368 KB Output is correct
50 Correct 14 ms 7532 KB Output is correct
51 Correct 11 ms 7552 KB Output is correct
52 Correct 10 ms 7396 KB Output is correct
53 Correct 12 ms 7544 KB Output is correct
54 Correct 11 ms 7508 KB Output is correct
55 Correct 11 ms 7276 KB Output is correct
56 Correct 201 ms 20636 KB Output is correct
57 Correct 232 ms 21764 KB Output is correct
58 Correct 164 ms 18412 KB Output is correct
59 Correct 189 ms 19012 KB Output is correct
60 Correct 178 ms 19504 KB Output is correct
61 Correct 160 ms 18528 KB Output is correct
62 Correct 189 ms 20852 KB Output is correct
63 Correct 158 ms 19408 KB Output is correct
64 Correct 165 ms 19444 KB Output is correct
65 Correct 147 ms 19580 KB Output is correct
66 Correct 146 ms 19580 KB Output is correct
67 Correct 344 ms 20132 KB Output is correct
68 Correct 259 ms 20056 KB Output is correct
69 Correct 209 ms 20112 KB Output is correct
70 Correct 263 ms 20232 KB Output is correct
71 Correct 232 ms 20108 KB Output is correct
72 Correct 161 ms 20112 KB Output is correct
73 Correct 307 ms 20128 KB Output is correct
74 Correct 62 ms 19972 KB Output is correct
75 Correct 65 ms 20004 KB Output is correct
76 Correct 357 ms 25808 KB Output is correct
77 Correct 352 ms 26072 KB Output is correct
78 Correct 283 ms 23784 KB Output is correct
79 Correct 271 ms 20052 KB Output is correct
80 Correct 183 ms 19704 KB Output is correct
81 Correct 95 ms 20080 KB Output is correct
82 Correct 205 ms 19096 KB Output is correct
83 Correct 187 ms 19244 KB Output is correct
84 Correct 262 ms 19312 KB Output is correct
85 Correct 150 ms 20100 KB Output is correct
86 Correct 146 ms 20076 KB Output is correct
87 Correct 154 ms 20032 KB Output is correct
88 Correct 160 ms 20076 KB Output is correct
89 Correct 148 ms 20076 KB Output is correct
90 Correct 311 ms 26012 KB Output is correct
91 Correct 261 ms 23032 KB Output is correct
92 Correct 168 ms 20140 KB Output is correct
93 Correct 235 ms 20124 KB Output is correct
94 Correct 201 ms 20132 KB Output is correct
95 Correct 288 ms 20064 KB Output is correct
96 Correct 352 ms 25892 KB Output is correct
97 Correct 381 ms 26128 KB Output is correct
98 Correct 338 ms 26076 KB Output is correct
99 Correct 340 ms 26152 KB Output is correct
100 Correct 278 ms 26076 KB Output is correct
101 Correct 342 ms 26128 KB Output is correct
102 Correct 336 ms 26140 KB Output is correct
103 Correct 177 ms 20816 KB Output is correct