oj.uz

Submission #111008

# Submission time Handle Problem Language Result Execution time Memory
111008 2019-05-13T14:28:09 Z Pajaraja Pinball (JOI14_pinball) C++17
100 / 100
 818 ms 37368 KB 
#include <bits/stdc++.h>
#define MAXN 100007
#define LINF 1000000000000000000LL
using namespace std;
long long dpl[MAXN],dpr[MAXN],seg[2][12*MAXN],d[MAXN];
int a[MAXN],b[MAXN],c[MAXN],sz;
vector<int> v;
map<int,int> mp;
void upd(int k,int l,int r,int v,long long a,int ind)
{
	if(l==r) {seg[k][ind]=min(seg[k][ind],a); return;}
	int s=(l+r)/2;
	if(v<=s) upd(k,l,s,v,a,2*ind);
	else upd(k,s+1,r,v,a,2*ind+1);
	seg[k][ind]=min(seg[k][2*ind],seg[k][2*ind+1]);
}
long long val(int k,int l,int r,int lt,int rt,int ind)
{
	if(l>=lt && r<=rt) return seg[k][ind];
	if(rt<l || lt>r) return LINF;
	int s=(l+r)/2;
	return min(val(k,l,s,lt,rt,2*ind),val(k,s+1,r,lt,rt,2*ind+1));
}
int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
	int n,m; cin>>m>>n;
	v.push_back(1);
	for(int i=0;i<m;i++)
	{
		cin>>a[i]>>b[i]>>c[i]>>d[i];
		v.push_back(a[i]);
		v.push_back(b[i]);
		v.push_back(c[i]);
	}
	v.push_back(n);
	sort(v.begin(),v.end());
	sz=v.size();
	for(int i=0;i<sz;i++) mp[v[i]]=i;
	fill(seg[1],seg[1]+12*MAXN,LINF); fill(seg[0],seg[0]+12*MAXN,LINF);
	upd(0,0,sz,mp[1],0,1); upd(1,0,sz,mp[n],0,1);
	long long sol=LINF;
	for(int i=0;i<m;i++)
	{
		long long x=val(0,0,sz,mp[a[i]],mp[b[i]],1),y=val(1,0,sz,mp[a[i]],mp[b[i]],1);
		//cout<<mp[a[i]]<<" "<<y<<endl;
		upd(0,0,sz,mp[c[i]],x+d[i],1); upd(1,0,sz,mp[c[i]],y+d[i],1);
		sol=min(sol,x+y+d[i]);
	}
	if(sol==LINF) sol=-1;
	cout<<sol;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19200 KB Output is correct
2 Correct 26 ms 19200 KB Output is correct
3 Correct 20 ms 19200 KB Output is correct
4 Correct 17 ms 19072 KB Output is correct
5 Correct 18 ms 19072 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 18 ms 19200 KB Output is correct
8 Correct 16 ms 19072 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19200 KB Output is correct
2 Correct 26 ms 19200 KB Output is correct
3 Correct 20 ms 19200 KB Output is correct
4 Correct 17 ms 19072 KB Output is correct
5 Correct 18 ms 19072 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 18 ms 19200 KB Output is correct
8 Correct 16 ms 19072 KB Output is correct
9 Correct 21 ms 19200 KB Output is correct
10 Correct 17 ms 19200 KB Output is correct
11 Correct 18 ms 19172 KB Output is correct
12 Correct 19 ms 19200 KB Output is correct
13 Correct 17 ms 19200 KB Output is correct
14 Correct 18 ms 19200 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19200 KB Output is correct
2 Correct 26 ms 19200 KB Output is correct
3 Correct 20 ms 19200 KB Output is correct
4 Correct 17 ms 19072 KB Output is correct
5 Correct 18 ms 19072 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 18 ms 19200 KB Output is correct
8 Correct 16 ms 19072 KB Output is correct
9 Correct 21 ms 19200 KB Output is correct
10 Correct 17 ms 19200 KB Output is correct
11 Correct 18 ms 19172 KB Output is correct
12 Correct 19 ms 19200 KB Output is correct
13 Correct 17 ms 19200 KB Output is correct
14 Correct 18 ms 19200 KB Output is correct
15 Correct 19 ms 19200 KB Output is correct
16 Correct 17 ms 19200 KB Output is correct
17 Correct 25 ms 19328 KB Output is correct
18 Correct 20 ms 19200 KB Output is correct
19 Correct 20 ms 19328 KB Output is correct
20 Correct 19 ms 19200 KB Output is correct
21 Correct 19 ms 19200 KB Output is correct
22 Correct 21 ms 19300 KB Output is correct
23 Correct 20 ms 19456 KB Output is correct
24 Correct 23 ms 19292 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 19200 KB Output is correct
2 Correct 26 ms 19200 KB Output is correct
3 Correct 20 ms 19200 KB Output is correct
4 Correct 17 ms 19072 KB Output is correct
5 Correct 18 ms 19072 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 18 ms 19200 KB Output is correct
8 Correct 16 ms 19072 KB Output is correct
9 Correct 21 ms 19200 KB Output is correct
10 Correct 17 ms 19200 KB Output is correct
11 Correct 18 ms 19172 KB Output is correct
12 Correct 19 ms 19200 KB Output is correct
13 Correct 17 ms 19200 KB Output is correct
14 Correct 18 ms 19200 KB Output is correct
15 Correct 19 ms 19200 KB Output is correct
16 Correct 17 ms 19200 KB Output is correct
17 Correct 25 ms 19328 KB Output is correct
18 Correct 20 ms 19200 KB Output is correct
19 Correct 20 ms 19328 KB Output is correct
20 Correct 19 ms 19200 KB Output is correct
21 Correct 19 ms 19200 KB Output is correct
22 Correct 21 ms 19300 KB Output is correct
23 Correct 20 ms 19456 KB Output is correct
24 Correct 23 ms 19292 KB Output is correct
25 Correct 62 ms 20312 KB Output is correct
26 Correct 137 ms 22516 KB Output is correct
27 Correct 457 ms 26184 KB Output is correct
28 Correct 289 ms 23272 KB Output is correct
29 Correct 329 ms 25836 KB Output is correct
30 Correct 467 ms 24040 KB Output is correct
31 Correct 733 ms 30956 KB Output is correct
32 Correct 690 ms 28780 KB Output is correct
33 Correct 88 ms 23160 KB Output is correct
34 Correct 365 ms 28656 KB Output is correct
35 Correct 425 ms 37368 KB Output is correct
36 Correct 818 ms 37224 KB Output is correct
37 Correct 648 ms 37352 KB Output is correct
38 Correct 656 ms 37220 KB Output is correct