oj.uz

Submission #917446

# Submission time Handle Problem Language Result Execution time Memory
917446 2024-01-28T08:12:48 Z PM1 MP3 Player (CEOI10_mp3player) C++17
60 / 100
 91 ms 14316 KB 
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define ll long long
const ll mxn=1e5+5,sz=(1<<20);
ll n,vmx,v2,t[mxn],a[mxn],last;
vector<pair<ll,ll>>v;
struct segment{
	ll mx[sz],mn[sz],lazy[sz];
	void shift(ll id){
		for(ll i=0;i<2;i++){
			mx[id*2+i]+=lazy[id];
			mn[id*2+i]+=lazy[id];
			lazy[id*2+i]+=lazy[id];
		}
		lazy[id]=0;
	}
	void add(ll id,ll L,ll R,ll l,ll r,ll x){
		if(L==l && R==r){
			lazy[id]+=x;
			mx[id]+=x;
			mn[id]+=x;
			return ;
		}
		if(lazy[id])
			shift(id);
		ll mid=(L+R)/2;
		if(l<mid)
			add(id*2,L,mid,l,min(r,mid),x);
		if(r>mid)
			add(id*2+1,mid,R,max(l,mid),r,x);
		mx[id]=max(mx[id*2],mx[id*2+1]);
		mn[id]=min(mn[id*2],mn[id*2+1]);
	}
}seg;
int main(){
	cin>>n>>vmx>>v2;
	for(ll i=1;i<=n;i++){
		char x;
		cin>>x>>t[i];
		if(x=='+')a[i]=1;
		else a[i]=-1;
		if(i!=1)seg.add(1,1,n+2,1,i+1,-a[i]);
	}
	seg.add(1,1,n+2,1,n+2,v2);
	for(ll i=n;i>1;i--){
		t[i]-=t[i-1];
		v.push_back({t[i],i});
	}
	v.push_back({0,0});
	sort(v.begin(),v.end());
	ll p=v.back().fr;
	while(v.size()){//cout<<seg.mx[1]<<" "<<seg.mn[1]<<endl;
		if(seg.mx[1]<=vmx && seg.mn[1]>=0)break;
		while(v.back().fr==p){
			seg.add(1,1,n+2,1,v.back().sc+1,a[v.back().sc]);
			v.pop_back();
		}
		last=p;
		p=v.back().fr;
	}
	if(v.size()==n){
		cout<<"infinity";
		return 0;
	}
	cout<<last-1<<" ";
	ll l=0,r=vmx+1,y=last-1;
	while(r-l>1){
		ll mid=(l+r)/2,x=mid;
		for(ll i=2;i<=n;i++){
			if(y>=t[i]){
				x+=a[i];
				x=max((ll)0,x);
				x=min(x,vmx);
			}
		}
		if(x<=v2)l=mid;
		else r=mid;
	}
	cout<<l;
}

Compilation message

mp3player.cpp: In function 'int main()':
mp3player.cpp:63:13: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   63 |  if(v.size()==n){
      |     ~~~~~~~~^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4700 KB Output is correct
2 Correct 3 ms 4696 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4700 KB Output is correct
2 Correct 4 ms 4848 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 9944 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 10200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 10452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 11476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 14280 KB Output is correct
2 Correct 74 ms 14280 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 14316 KB Output is correct
2 Correct 76 ms 14288 KB Output is correct