Submission #4031339

---

Source Code Expand

#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <array>
#include <bitset> 
#include <unordered_map>
#include <random>

using namespace std;
typedef long long LL;
typedef pair<double,LL> P;

int N;
LL L;
int main() {
	cout.precision(17);
	scanf("%d%lld",&N,&L);
	double sum=0;
	LL sumv=0;
	deque<P> q;
	for(int i=0;i<N;i++){
		double t;
		LL v;
		scanf("%lf%lld",&t,&v);
		sum+=t*v;
		sumv+=v;
		while(q.size()&&q.back().first>t&&v<L){
			//cerr << t << ", " << v << endl;
			if(q.back().second+v>=L){
				t=(v*t+(L-v)*q.back().first)/L;
				q.back().second-=L-v;
				v=L;
			}
			else{
				auto v2=v+q.back().second;
				t=(v*t+q.back().second*q.back().first)/v2;
				v=v2;
				q.pop_back();
			}
		}
		//cerr << t << ", " << v << endl;
		q.push_back(P(t,v));
		while(sumv>L){
			if(sumv-q.front().second>=L){
				sumv-=q.front().second;
				sum-=q.front().first*q.front().second;
				q.pop_front();
			}
			else{
				LL d=sumv-L;
				sumv-=d;
				sum-=q.front().first*d;
				q.front().second-=d;
			}
		}
		printf("%.9lf\n",sum/L);
	}

	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:35:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%lld",&N,&L);
                       ^
./Main.cpp:42:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lf%lld",&t,&v);
                         ^

Judge Result