Submission #147915

#	Time	Username	Problem	Language	Result	Execution time	Memory
147915		cheetose	Long Mansion (JOI17_long_mansion)	C++11	100 / 100	556 ms	50144 KiB

long_mansion

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int L[500001],R[500001];
int tol[500001],tor[500001];
int a[500001],t[500001];
bool l_[500001],r_[500001];
Vi v[500001];
int n,q;
void upd(int &l,int &r,int S,int E)
{
	while(1)
	{
		if(l>S && tol[l]!=-1 && tol[l]<=r)l--;
		else if(r<E && tor[r]!=-1 && tor[r]>=l)r++;
		else break;
	}
}
void go(int S,int E)
{
	if(S==E)
	{
		l_[S]=r_[S]=1;
		L[S]=R[S]=S;
		return;
	}
	if(S+1==E)
	{
		L[S]=R[S]=S;
		L[E]=R[E]=E;
		l_[S]=r_[E]=1;
		if(tol[E]==E)
		{
			L[E]=S;
			l_[E]=1;
		}
		if(tor[S]==S)
		{
			R[S]=E;
			r_[S]=1;
		}
		return;
	}
	int M=(S+E)>>1;
	go(S,M);go(M,E);
	int l=M,r=M;
	fdn(i,M,S,1)
	{
		if(!r_[i])continue;
		l=min(l,i);
		l_[i]=r_[i]=0;
		upd(l,r,S,E);
		L[i]=min(L[i],l);
		R[i]=max(L[i],r);
		if(L[i]==S)l_[i]=1;
		if(R[i]==E)r_[i]=1;
	}
	l=r=M;
	fup(i,M,E,1)
	{
		if(!l_[i])continue;
		r=max(r,i);
		l_[i]=r_[i]=0;
		upd(l,r,S,E);
		L[i]=min(L[i],l);
		R[i]=max(L[i],r);
		if(L[i]==S)l_[i]=1;
		if(R[i]==E)r_[i]=1;
	}
}
int main() {
	MEM_1(tol);MEM_1(tor);
	scanf("%d",&n);
	fup(i,1,n-1,1)scanf("%d",a+i);
	fup(i,1,n,1)
	{
		int c;
		scanf("%d",&c);
		while(c--)
		{
			int x;
			scanf("%d",&x);
			v[i].pb(x);
		}
	}
	MEM_1(t);
	fup(i,1,n-1,1)
	{
		for(int x:v[i])t[x]=i;
		tor[i]=t[a[i]];
	}
	MEM_1(t);
	fdn(i,n,2,1)
	{
		for(int x:v[i])t[x]=i;
		tol[i]=t[a[i-1]];
	}
	go(1,n);
	scanf("%d",&q);
	while(q--)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		puts(L[x]<=y && R[x]>=y?"YES":"NO");
	}
}

Compilation message (stderr)

long_mansion.cpp: In function 'int main()':
long_mansion.cpp:132:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
long_mansion.cpp:133:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,1,n-1,1)scanf("%d",a+i);
                ~~~~~^~~~~~~~~~
long_mansion.cpp:137:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&c);
   ~~~~~^~~~~~~~~
long_mansion.cpp:141:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&x);
    ~~~~~^~~~~~~~~
long_mansion.cpp:158:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&q);
  ~~~~~^~~~~~~~~
long_mansion.cpp:162:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 15 / 15
• Subtask 4: 75 / 75