# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
99911 |
2019-03-08T16:17:48 Z |
aer0park |
Taxis (POI13_tak) |
C++14 |
|
169 ms |
10576 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,d,anw=1,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());
id=lower_bound(x.begin(),x.end(),m-d)-x.begin();
if(id==n)
{
cout<<0;
return 0;
}
if(m==d)
anw=0,id=-1;
// find x try to be exact
ll i=n-1;
while(sum<d&&i>=0)
{
if(i==id)
{
i--;
continue;
}
if(x[i]-d+sum>0)
sum+=x[i]-max((ll)0,(d-sum)),anw++;
i--;
}
if(sum<d)
{
cout<<0;
return 0;
}
cout<<anw;
return 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 |
Correct |
3 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
512 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
1024 KB |
Output is correct |
2 |
Correct |
7 ms |
1024 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
1532 KB |
Output is correct |
2 |
Incorrect |
19 ms |
1532 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
28 ms |
1532 KB |
Output is correct |
2 |
Incorrect |
64 ms |
2584 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
88 ms |
4640 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
169 ms |
4644 KB |
Output is correct |
2 |
Incorrect |
135 ms |
10576 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
132 ms |
4644 KB |
Output is correct |
2 |
Incorrect |
160 ms |
4572 KB |
Output isn't correct |