Submission #1180038

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <ctime>
#include <cstdlib>
#include <set>
#include <queue>
using namespace std;

#define X first
#define Y second
#define Mod 1000000007
#define N 100010
#define M 101

typedef long long ll;

const int INF=1<<30;

int n;
int l[N],r[N];
priority_queue<ll, vector<ll>, greater<ll> > qr;
priority_queue<ll> ql;

int main()
{
	//freopen("in.in","r",stdin);
	//freopen("out.out","w",stdout);
	
	scanf("%d",&n);
	for (int i=1;i<=n;i++) scanf("%d%d",&l[i],&r[i]);
	
	ll dell=0,delr=0,ans=0;
	ql.push(l[1]); qr.push(l[1]);
	for (int i=2;i<=n;i++)
	{
		dell-=r[i]-l[i];
		delr+=r[i-1]-l[i-1];
		//cout<<i<<" "<<l[i]<<" "<<ql.top()+dell<<" "<<qr.top()+delr<<endl;
		if (l[i]>qr.top()+delr)
		{
			ans+=l[i]-qr.top()-delr;
			qr.push(l[i]-delr);
			qr.push(l[i]-delr);
			ql.push(qr.top()+delr-dell);
			qr.pop();
			//cout<<"case1"<<endl;
		}
		else if (l[i]<ql.top()+dell)
		{
			ans+=ql.top()+dell-l[i];
			ql.push(l[i]-dell);
			ql.push(l[i]-dell);
			qr.push(ql.top()+dell-delr);
			//cout<<"case2 "<<ql.top()+dell<<" "<<-delr<<endl;
			ql.pop();
		}
		else
		{
			ql.push(l[i]-dell);
			qr.push(l[i]-delr);
		}
		//cout<<i<<" "<<l[i]<<" "<<ql.top()+dell<<" "<<qr.top()+delr<<endl;
	}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:35:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1;i<=n;i++) scanf("%d%d",&l[i],&r[i]);
                                                  ^

Judge Result