# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36605 | Flumen | Taxis (POI13_tak) | C++11 | 196 ms | 9828 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
long long a[500100],v[500100];
int main(){
int n,ans=600000,num,i,l,r,mid;
long long m,d,tmp,tmp1,x;
scanf("%lld%lld%d",&m,&d,&n);
for(i=1;i<=n;i++){
scanf("%lld",&a[i]);
a[i]*=-1;
}
sort(a+1,a+n+1);
for(i=1;i<=n;i++)a[i]*=-1;
num=1;
tmp=0;
while(tmp<d){
num++;
tmp1=tmp;
tmp*=2;
tmp+=(a[num]-d);
if(tmp<=tmp1){
num--;
break;
}
}
//printf("%d\n",num);
for(i=1;i<=num;i++){
v[i]=v[i-1]*2+(a[i]-d);
//printf("%lld\n",v[i]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |