oj.uz

Submission #79812

# Submission time Handle Problem Language Result Execution time Memory
79812 2018-10-16T14:44:43 Z AngelKnows Pinball (JOI14_pinball) C++14
100 / 100
 251 ms 48412 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for (int i=1;i<=n;i++)
#define REP(i,a,b) for (int i=a;i<=b;i++)
 
#define pb push_back
#define fi first
#define se second
#define pi pair<int,int>
#define mp make_pair
#define sz(x) ((int)(x).size())
 
typedef long long ll;

const int inf=0x3f3f3f3f;
const ll linf=1e18;
const int N=100000+10;
const double eps=1e-5;
const int mo=1e9+7;

int m,n;
struct node {
	int l,r,m,w;
} b[N];
int tot;
struct data {
	int val;
	int id;
	int t;
} a[3*N];
int cnt;
ll seg[12*N];
ll ld[N],rd[N];
void build(int k,int l,int r) {
	if (l==r) {
		seg[k]=linf;
		return;
	}
	seg[k]=linf;
	int mid=(l+r)>>1;
	build(k<<1,l,mid);
	build(k<<1|1,mid+1,r);
}
void update(int k,int l,int r,int x,ll v) {
	if (l==r) {
		seg[k]=min(seg[k],v);
		return;
	}
	int mid=(l+r)>>1;
	if (x<=mid) update(k<<1,l,mid,x,v);
	else update(k<<1|1,mid+1,r,x,v);
	seg[k]=min(seg[k<<1],seg[k<<1|1]);
}
ll query(int k,int L,int R,int l,int r) {
	if (L==l&&R==r) {
		return seg[k];
	}
	int mid=(L+R)>>1;
	if (r<=mid) {
		return query(k<<1,L,mid,l,r);
	} else if (l>mid) {
		return query(k<<1|1,mid+1,R,l,r);
	} else {
		return min(query(k<<1,L,mid,l,mid),query(k<<1|1,mid+1,R,mid+1,r));
	}
}
bool cmp(data x,data y) {
	return x.val<y.val;
} 
int main() {
 
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    scanf("%d %d",&m,&n);
    a[++tot]=data{1,0,0};
    a[++tot]=data{n,0,0};
    FOR(i,m) {
    	scanf("%d %d %d %d",&b[i].l,&b[i].r,&b[i].m,&b[i].w);
    	a[++tot]=data{b[i].l,i,1};
		a[++tot]=data{b[i].m,i,2};
		a[++tot]=data{b[i].r,i,3};	
	}
	sort(a+1,a+1+tot,cmp);
	FOR(i,tot) {
		if (i==1||a[i].val!=a[i-1].val) {
			++cnt;
		}
		int id=a[i].id;
		if (id==0) continue;
		int t=a[i].t;
		if (t==1) {
			b[id].l=cnt;
		} else if (t==2) {
			b[id].m=cnt;
		} else {
			b[id].r=cnt;
		}
	}
	memset(ld,0x3f,sizeof ld);
	memset(rd,0x3f,sizeof rd);
	build(1,1,cnt);
	FOR(i,m) {
		int l=b[i].l,r=b[i].r;
		ll t=query(1,1,cnt,l,r);
		if (t!=linf) {
			ld[i]=t+b[i].w;
			update(1,1,cnt,b[i].m,t+b[i].w);
		}
		if (b[i].l==1) {
			ld[i]=min(ld[i],1LL*b[i].w);
			update(1,1,cnt,b[i].m,b[i].w);
		}
	}
	build(1,1,cnt);
	FOR(i,m) {
		int l=b[i].l,r=b[i].r;
		ll t=query(1,1,cnt,l,r);
		if (t!=linf) {
			rd[i]=t+b[i].w;
			update(1,1,cnt,b[i].m,t+b[i].w);
		}
		if (b[i].r==cnt) {
			rd[i]=min(rd[i],1LL*b[i].w);
			update(1,1,cnt,b[i].m,b[i].w);
		}
	}
	ll ans=linf;
	FOR(i,m) if (ld[i]!=linf&&rd[i]!=linf) {
		if (b[i].l!=1||b[i].r!=cnt) {
			ans=min(ans,ld[i]+rd[i]-b[i].w);
		}
		else ans=min(ans,1LL*b[i].w);
		
	}
	//FOR(i,m) cout<<ld[i]<<" "<<rd[i]<<endl;
	if (ans!=linf) cout<<ans<<endl;
	else cout<<-1<<endl;
	return 0;
}

Compilation message

pinball.cpp: In function 'int main()':
pinball.cpp:78:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&m,&n);
     ~~~~~^~~~~~~~~~~~~~~
pinball.cpp:82:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d %d %d %d",&b[i].l,&b[i].r,&b[i].m,&b[i].w);
      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 2044 KB Output is correct
3 Correct 3 ms 2044 KB Output is correct
4 Correct 3 ms 2128 KB Output is correct
5 Correct 3 ms 2128 KB Output is correct
6 Correct 3 ms 2156 KB Output is correct
7 Correct 3 ms 2156 KB Output is correct
8 Correct 3 ms 2176 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 2044 KB Output is correct
3 Correct 3 ms 2044 KB Output is correct
4 Correct 3 ms 2128 KB Output is correct
5 Correct 3 ms 2128 KB Output is correct
6 Correct 3 ms 2156 KB Output is correct
7 Correct 3 ms 2156 KB Output is correct
8 Correct 3 ms 2176 KB Output is correct
9 Correct 4 ms 2176 KB Output is correct
10 Correct 4 ms 2252 KB Output is correct
11 Correct 4 ms 2280 KB Output is correct
12 Correct 4 ms 2444 KB Output is correct
13 Correct 3 ms 2444 KB Output is correct
14 Correct 4 ms 2444 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 2044 KB Output is correct
3 Correct 3 ms 2044 KB Output is correct
4 Correct 3 ms 2128 KB Output is correct
5 Correct 3 ms 2128 KB Output is correct
6 Correct 3 ms 2156 KB Output is correct
7 Correct 3 ms 2156 KB Output is correct
8 Correct 3 ms 2176 KB Output is correct
9 Correct 4 ms 2176 KB Output is correct
10 Correct 4 ms 2252 KB Output is correct
11 Correct 4 ms 2280 KB Output is correct
12 Correct 4 ms 2444 KB Output is correct
13 Correct 3 ms 2444 KB Output is correct
14 Correct 4 ms 2444 KB Output is correct
15 Correct 3 ms 2444 KB Output is correct
16 Correct 4 ms 2444 KB Output is correct
17 Correct 5 ms 2556 KB Output is correct
18 Correct 5 ms 2596 KB Output is correct
19 Correct 6 ms 2776 KB Output is correct
20 Correct 5 ms 2776 KB Output is correct
21 Correct 4 ms 2792 KB Output is correct
22 Correct 5 ms 2808 KB Output is correct
23 Correct 5 ms 2868 KB Output is correct
24 Correct 5 ms 2908 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 2044 KB Output is correct
3 Correct 3 ms 2044 KB Output is correct
4 Correct 3 ms 2128 KB Output is correct
5 Correct 3 ms 2128 KB Output is correct
6 Correct 3 ms 2156 KB Output is correct
7 Correct 3 ms 2156 KB Output is correct
8 Correct 3 ms 2176 KB Output is correct
9 Correct 4 ms 2176 KB Output is correct
10 Correct 4 ms 2252 KB Output is correct
11 Correct 4 ms 2280 KB Output is correct
12 Correct 4 ms 2444 KB Output is correct
13 Correct 3 ms 2444 KB Output is correct
14 Correct 4 ms 2444 KB Output is correct
15 Correct 3 ms 2444 KB Output is correct
16 Correct 4 ms 2444 KB Output is correct
17 Correct 5 ms 2556 KB Output is correct
18 Correct 5 ms 2596 KB Output is correct
19 Correct 6 ms 2776 KB Output is correct
20 Correct 5 ms 2776 KB Output is correct
21 Correct 4 ms 2792 KB Output is correct
22 Correct 5 ms 2808 KB Output is correct
23 Correct 5 ms 2868 KB Output is correct
24 Correct 5 ms 2908 KB Output is correct
25 Correct 22 ms 4100 KB Output is correct
26 Correct 55 ms 6352 KB Output is correct
27 Correct 154 ms 12172 KB Output is correct
28 Correct 169 ms 15568 KB Output is correct
29 Correct 107 ms 16828 KB Output is correct
30 Correct 194 ms 21736 KB Output is correct
31 Correct 251 ms 29192 KB Output is correct
32 Correct 231 ms 31004 KB Output is correct
33 Correct 33 ms 31004 KB Output is correct
34 Correct 113 ms 33088 KB Output is correct
35 Correct 169 ms 43760 KB Output is correct
36 Correct 242 ms 47496 KB Output is correct
37 Correct 194 ms 48412 KB Output is correct
38 Correct 202 ms 48412 KB Output is correct