Submission #427166

#	Time	Username	Problem	Language	Result	Execution time	Memory
427166		jamezzz	Port Facility (JOI17_port_facility)	C++17	0 / 100	1 ms	204 KiB

port_facility

#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
typedef pair<int,int> ii;
typedef long long ll;

#define mod 1000000007

struct node{
	int s,e,m,n0,n1;
	node *l,*r;
	node(int _s,int _e){
		s=_s;e=_e;m=(s+e)/2;n0=0;n1=0;
		if(s!=e)l=new node(s,m),r=new node(m+1,e);
	}
	void up(int x,int v){
		if(s==x&&e==x){
			if(v)++n1;
			else ++n0;
			return;
		}
		if(x<=m)l->up(x,v);
		else r->up(x,v);
		n0=l->n0+r->n0;
		n1=l->n1+r->n1;
	}
	ii qry(int x,int y){
		if(s==x&&e==y)return ii(n0,n1);
		if(y<=m)return l->qry(x,y);
		if(x>m)return r->qry(x,y);
		ii pr1=l->qry(x,m);
		ii pr2=r->qry(m+1,y);
		return ii(pr1.fi+pr2.fi,pr1.se+pr2.se);
	}
}*root;

int n,a,b;
vector<ii> v;

int main(){
	sf("%d",&n);
	for(int i=0;i<n;++i){
		sf("%d%d",&a,&b);
		v.pb(a,b);
	}
	ll ans=1;
	sort(all(v));
	root=new node(1,2*n);
	for(int i=0;i<n;++i){
		ii pr=root->qry(v[i].fi,v[i].se);
		if(pr.fi&&pr.se)pf("0\n"),exit(0);
		if(pr.fi==0&&pr.se==0)ans*=2,ans%=mod;
		if(pr.fi==0)root->up(v[i].se,0);
		else root->up(v[i].se,1);
	}
	pf("%lld\n",ans);
}

Compilation message (stderr)

port_facility.cpp: In function 'int main()':
port_facility.cpp:48:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  sf("%d",&n);
      |    ^
port_facility.cpp:50:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |   sf("%d%d",&a,&b);
      |     ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 56
• Subtask 4: 0 / 22