Submission #197787

#	Time	Username	Problem	Language	Result	Execution time	Memory
197787		arnold518	Port Facility (JOI17_port_facility)	C++14	0 / 100	374 ms	399736 KiB

port_facility

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

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

const int MAXN = 1e6;
const ll MOD = 1e9+7;

struct Data
{
	int L, R;
};

int N, col[MAXN+10];
Data A[MAXN+10];
vector<int> adj[MAXN+10];

vector<pii> tree1[MAXN*8+10], tree2[MAXN*8+10];

void update1(int node, int tl, int tr, int l, int r, int k)
{
	tree1[node].push_back(pii(l, k));
	if(tl==tr) return;
	int mid=tl+tr>>1;
	if(r<=mid) update1(node*2, tl, mid, l, r, k);
	else update1(node*2+1, mid+1, tr, l, r, k);
}	

void query1(int node, int tl, int tr, int l, int r, int k)
{
	int i, j;
	if(r<tl || tr<l) return;
	if(l<=tl && tr<=r)
	{
		for(i=tree1[node].size()-1; i>=0; i--)
		{
			if(tree1[node][i].first>=l) break;
			if(col[tree1[node][i].second]) tree1[node].pop_back();
			else adj[k].push_back(tree1[node][i].second);
		}
		return;
	}
	int mid=tl+tr>>1;
	query1(node*2, tl, mid, l, r, k);
	query1(node*2+1, mid+1, tr, l, r, k);
}

void update2(int node, int tl, int tr, int l, int r, int k)
{
	tree2[node].push_back(pii(r, k));
	if(tl==tr) return;
	int mid=tl+tr>>1;
	if(l<=mid) update2(node*2, tl, mid, l, r, k);
	else update2(node*2+1, mid+1, tr, l, r, k);
}	

void query2(int node, int tl, int tr, int l, int r, int k)
{
	int i, j;
	if(r<tl || tr<l) return;
	if(l<=tl && tr<=r)
	{
		for(i=tree2[node].size()-1; i>=0; i--)
		{
			if(tree2[node][i].first<=r) break;
			if(col[tree2[node][i].second]) tree2[node].pop_back();
			else adj[k].push_back(tree2[node][i].second);
		}
		return;
	}
	int mid=tl+tr>>1;
	query2(node*2, tl, mid, l, r, k);
	query2(node*2+1, mid+1, tr, l, r, k);
}

int main()
{
	int i, j;
	scanf("%d", &N);
	for(i=1; i<=N; i++) scanf("%d%d", &A[i].L, &A[i].R);

	sort(A+1, A+N+1, [&](const Data &p, const Data &q) { return p.L<q.L; });

	for(i=N; i>=1; i--) update1(1, 1, 2*N, A[i].L, A[i].R, i);
	for(i=1; i<=N; i++) update2(1, 1, 2*N, A[i].L, A[i].R, i);

	int cnt=0;
	for(i=1; i<=N; i++)
	{
		if(col[i]) continue;
		queue<int> Q;
		cnt++;

		Q.push(i); col[i]=1;
		while(!Q.empty())
		{
			int now=Q.front(); Q.pop();
			query1(1, 1, 2*N, A[now].L, A[now].R, now);
			query2(1, 1, 2*N, A[now].L, A[now].R, now);

			for(auto nxt : adj[now])
			{
				if(col[nxt]) continue;
				Q.push(nxt); col[nxt]=3-col[now];
			}
		}
	}

	vector<int> S[3];
	vector<pii> todo;
	for(i=1; i<=N; i++) todo.push_back({A[i].L, i}), todo.push_back({A[i].R, i+N});
	sort(todo.begin(), todo.end());

	for(auto it : todo)
	{
		if(it.second>N)
		{
			if(!S[1].empty() && S[1].back()==it.second-N) S[1].pop_back();
			else if(!S[2].empty() && S[2].back()==it.second-N) S[2].pop_back();
			else return !printf("0");
		}
		else
		{
			S[col[it.second]].push_back(it.second);
		}
	}

	ll ans=1;
	for(i=1; i<=cnt; i++) ans=ans*2%MOD;
	printf("%lld", ans);
}

Compilation message (stderr)

port_facility.cpp: In function 'void update1(int, int, int, int, int, int)':
port_facility.cpp:26:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
port_facility.cpp: In function 'void query1(int, int, int, int, int, int)':
port_facility.cpp:45:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
port_facility.cpp:33:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
port_facility.cpp: In function 'void update2(int, int, int, int, int, int)':
port_facility.cpp:54:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
port_facility.cpp: In function 'void query2(int, int, int, int, int, int)':
port_facility.cpp:73:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
port_facility.cpp:61:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
port_facility.cpp: In function 'int main()':
port_facility.cpp:80:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
port_facility.cpp:81:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
port_facility.cpp:82:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%d%d", &A[i].L, &A[i].R);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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