Submission #2892609

---

Source Code Expand

#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;

const ll MAX=505000;
const ll INF=0x3f3f3f3f3f3f3f;
ll N;
double L;
double v[MAX],t[MAX];
double v_sum=0,vt_sum=0;
deque<pdd> graph;
int modify(){
    pdd t1,t2,t3;
    if(graph.size()<3) return 0;
    t1=graph.front(); graph.pop_front();
    t2=graph.front(); graph.pop_front();
    t3=graph.front();
    if((t3.x-t2.x)*(t2.y-t1.y)<=(t3.y-t2.y)*(t2.x-t1.x)){
        graph.push_front(t1);
        return 1;
    }
    graph.push_front(t2); graph.push_front(t1);
    return 0;
}
int dcut(){
    pdd t1=graph.back(),t2;
    if(t1.x+v_sum>L){
        graph.pop_back();
        t2=graph.back();
        if(t2.x+v_sum<L){
            graph.push_back(make_pair(L-v_sum,(L-v_sum-t2.x)/(t1.x-t2.x)*(t1.y-t2.y)+t2.y));
            return 0;
        }
        return 1;
    }
    return 0;
}
int main(){
    scanf("%lld%lf",&N,&L);
    for(ll i=0;i<N;i++) scanf("%lf%lf",&t[i],&v[i]);
    graph.push_front(make_pair(v_sum,vt_sum));
    for(ll i=0;i<N;i++){
        v_sum+=v[i],vt_sum+=v[i]*t[i];
        graph.push_front(make_pair(-v_sum,-vt_sum));
        while(dcut());
        while(modify());
        //printf("%d\t%.10f\t%.10f\n",graph.size(),graph.back().x,graph.back().y);
        printf("%.10f\n",(graph.back().y+vt_sum)/(graph.back().x+v_sum));
    }
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:45:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lf",&N,&L);
                           ^
./Main.cpp:46:52: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(ll i=0;i<N;i++) scanf("%lf%lf",&t[i],&v[i]);
                                                    ^

Judge Result