Submission #1692465

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<iostream>
using namespace std;
const int INF=1e9;
struct node{
	int x,y;
}a[100100],d[100100],h[100100];
bool operator < (const node &A,const node &B){
	return A.x>B.x;
}
bool cmpr(const node &A,const node &B){
	return A.y<B.y;
}
priority_queue<node> q;
int top,cnt;
int b[100100],g[100100];
int c[100100],f[100100],mp[100100];
int ans;
int main(){
//	freopen("F.in","r",stdin);
	int n;
	scanf("%d",&n);
	ans=n;
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d",&a[i].x,&a[i].y);
		swap(a[i].x,a[i].y);
	}

	for(int i=1;i<=n+1;i++){
		scanf("%d",&b[i]);
		c[i]=b[i];
	}
	sort(b+1,b+n+1+1);
	int num=unique(b+1,b+n+1+1)-b-1;
	for(int i=1;i<=num;i++)
		mp[i]=b[i];
	for(int i=1;i<=n+1;i++)
		c[i]=lower_bound(b+1,b+num+1,c[i])-b;
	for(int i=1;i<=n;i++){
		a[i].x=lower_bound(b+1,b+num+1,a[i].x)-b;
		a[i].y=lower_bound(b+1,b+num+1,a[i].y)-b;
	}

	memset(b,0,sizeof(b));
	for(int i=1;i<=n+1;i++)
		b[c[i]]--;
	for(int i=1;i<=n;i++){
		if(a[i].y<=a[i].x)
			b[a[i].x]++;
		else
		{
			b[a[i].y]++;
			a[++top]=a[i];
		}
	}
	for(int i=1;i<=num;i++)
		b[i]=b[i-1]+b[i];
	sort(a+1,a+top+1,cmpr);

	int l=top;
	top=0;
	bool bo=0;
	int st=0;
	for(int i=num;i>=1;i--)
	{
		while(l>=1&&a[l].y>i){
			q.push(a[l]);
			l--;
		}
		st-=f[i];
		for(int j=1;j<(-b[i]-st);j++){
			if(q.empty()){
				bo=1;
				break;
			}
			d[++top]=q.top();
			f[d[top].x-1]++;
			q.pop();
			st++;
		}
		if(bo) break;
	}
	int Q,x,y;
	if(bo){
		scanf("%d",&Q);
		while(Q--)
			printf("-1\n");
		return 0;
	}

	memset(f,0,sizeof(f));
	for(int i=1;i<=top;i++)
		f[d[i].x]++,f[d[i].y]--;
	for(int i=1;i<=num;i++)
		f[i]=f[i-1]+f[i];
	for(int i=1;i<=num;i++)
		b[i]=b[i]+f[i];
	ans-=top;

	top=0;
	while(!q.empty()){
		a[++top]=q.top();
		q.pop();
	}
	sort(a+1,a+top+1,cmpr);
	l=top;
	int mn=INF;
	for(int i=num;i>=1;i--)
	{
		while(l>=1&&a[l].y>i){
			if(a[l].x<mn) mn=a[l].x;
			l--;
		}
		g[i]=mn;
	}

	memset(f,0,sizeof(f));
	for(int i=1;i<=num;i++){
		if(b[i]>=0)
			f[i]=f[i-1];
		else{
			if(g[i]>i) f[i]=-1;
			else{
				if(f[g[i]-1]==-1) f[i]=-1;
				else f[i]=f[g[i]-1]+1;
			}
		}
	}
	scanf("%d",&Q);
	while(Q--){
		scanf("%d%d",&x,&y);
		x=lower_bound(mp+1,mp+num+1,x)-mp;
		y=lower_bound(mp+1,mp+num+1,y)-mp;
		st=-1;
		if(x<=num&&f[x-1]>-1&&ans-f[x-1]+1>st) st=ans-f[x-1]+1;
		if(y<=num&&f[y-1]>-1&&ans-f[y-1]>st) st=ans-f[y-1];
		printf("%d\n",st);
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:29:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&a[i].x,&a[i].y);
                                ^
./Main.cpp:34:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&b[i]);
                    ^
./Main.cpp:89:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&Q);
                 ^
./Main.cpp:133:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&Q);
                ^
./Main.cpp:135:22: warning: ignoring r...

Judge Result