# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
99868 |
2019-03-08T07:08:08 Z |
aer0park |
Taxis (POI13_tak) |
C++14 |
|
1000 ms |
13712 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.push_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;
}
// find x try to be exact
ll i=n-1;
while(sum<d&&i>=0)
{
if(i==id) continue;
if(x[i]-d+sum>0)
sum+=x[i]-d+sum,anw++;
else if((x[i]-d+sum)*i+sum<d)
break;
i--;
}
if(sum<d)
{
cout<<0;
return 0;
}
cout<<anw;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1058 ms |
384 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1079 ms |
384 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Execution timed out |
1064 ms |
384 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
1536 KB |
Output is correct |
2 |
Execution timed out |
1070 ms |
1020 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
2172 KB |
Output is correct |
2 |
Execution timed out |
1055 ms |
2300 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
2680 KB |
Output is correct |
2 |
Execution timed out |
1062 ms |
5480 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
87 ms |
8548 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1066 ms |
13712 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
137 ms |
13664 KB |
Output is correct |
2 |
Execution timed out |
1078 ms |
13200 KB |
Time limit exceeded |