oj.uz

Submission #100133

# Submission time Handle Problem Language Result Execution time Memory
100133 2019-03-09T12:19:39 Z aer0park Taxis (POI13_tak) C++14
30 / 100
 164 ms 4628 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
ll n,m,d,anw,sum,id;
vector<ll> x;
 
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>m>>d>>n;
	for(int i=0;i<n;i++)
	{
		ll a;cin>>a;
		x.emplace_back(a);
	}	
	sort(x.begin(),x.end());
	ll i=n-1;
	while(sum<m&&i>=0)
	{
		sum+=max((ll)0,x[i]-abs(d-sum)),anw++;
		i--;
	}
	if(sum>=m)
	{
		cout<<anw;
		return 0;
	}
	id=lower_bound(x.begin(),x.end(),m-d)-x.begin();
	if(id==n)
	{
		cout<<0;
		return 0;
	}
	i=n-1,sum=0,anw=1;
	while(sum<d&&i>=0)
	{
		if(i==id)
		{
			i--;
			continue;
		}
		sum+=max((ll)0,x[i]-abs(d-sum)),anw++;
		i--;
	}
	if(sum<d)
		cout<<0;
	else
		cout<<anw;
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Incorrect 3 ms 384 KB Output isn't correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1152 KB Output is correct
2 Correct 8 ms 1024 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1532 KB Output is correct
2 Incorrect 28 ms 1788 KB Output isn't correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1532 KB Output is correct
2 Incorrect 75 ms 2540 KB Output isn't correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 4584 KB Output is correct
2 Incorrect 106 ms 4628 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 4584 KB Output is correct
2 Incorrect 164 ms 4612 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 4556 KB Output is correct
2 Incorrect 139 ms 4584 KB Output isn't correct