oj.uz

답안 #147915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147915 2019-08-31T06:59:44 Z cheetose Long Mansion (JOI17_long_mansion) C++11
100 / 100
 556 ms 50144 KB 
#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

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.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 18168 KB Output is correct
2 Correct 21 ms 18168 KB Output is correct
3 Correct 22 ms 18296 KB Output is correct
4 Correct 21 ms 18168 KB Output is correct
5 Correct 24 ms 18168 KB Output is correct
6 Correct 21 ms 18168 KB Output is correct
7 Correct 20 ms 18168 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 18168 KB Output is correct
2 Correct 21 ms 18168 KB Output is correct
3 Correct 22 ms 18296 KB Output is correct
4 Correct 21 ms 18168 KB Output is correct
5 Correct 24 ms 18168 KB Output is correct
6 Correct 21 ms 18168 KB Output is correct
7 Correct 20 ms 18168 KB Output is correct
8 Correct 149 ms 20344 KB Output is correct
9 Correct 148 ms 20216 KB Output is correct
10 Correct 153 ms 20472 KB Output is correct
11 Correct 152 ms 20700 KB Output is correct
12 Correct 138 ms 20472 KB Output is correct
13 Correct 143 ms 20472 KB Output is correct
14 Correct 144 ms 20484 KB Output is correct
15 Correct 142 ms 20472 KB Output is correct
16 Correct 139 ms 20776 KB Output is correct
17 Correct 148 ms 20472 KB Output is correct
18 Correct 144 ms 20440 KB Output is correct
19 Correct 143 ms 20472 KB Output is correct
20 Correct 145 ms 20700 KB Output is correct
21 Correct 136 ms 20704 KB Output is correct
22 Correct 142 ms 20452 KB Output is correct
23 Correct 144 ms 20216 KB Output is correct
24 Correct 148 ms 20344 KB Output is correct
25 Correct 144 ms 20332 KB Output is correct
26 Correct 144 ms 20200 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 25172 KB Output is correct
2 Correct 278 ms 26040 KB Output is correct
3 Correct 280 ms 25976 KB Output is correct
4 Correct 281 ms 25952 KB Output is correct
5 Correct 289 ms 25980 KB Output is correct
6 Correct 237 ms 25480 KB Output is correct
7 Correct 242 ms 25500 KB Output is correct
8 Correct 234 ms 25636 KB Output is correct
9 Correct 223 ms 25592 KB Output is correct
10 Correct 221 ms 25608 KB Output is correct
11 Correct 222 ms 25592 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 18168 KB Output is correct
2 Correct 21 ms 18168 KB Output is correct
3 Correct 22 ms 18296 KB Output is correct
4 Correct 21 ms 18168 KB Output is correct
5 Correct 24 ms 18168 KB Output is correct
6 Correct 21 ms 18168 KB Output is correct
7 Correct 20 ms 18168 KB Output is correct
8 Correct 149 ms 20344 KB Output is correct
9 Correct 148 ms 20216 KB Output is correct
10 Correct 153 ms 20472 KB Output is correct
11 Correct 152 ms 20700 KB Output is correct
12 Correct 138 ms 20472 KB Output is correct
13 Correct 143 ms 20472 KB Output is correct
14 Correct 144 ms 20484 KB Output is correct
15 Correct 142 ms 20472 KB Output is correct
16 Correct 139 ms 20776 KB Output is correct
17 Correct 148 ms 20472 KB Output is correct
18 Correct 144 ms 20440 KB Output is correct
19 Correct 143 ms 20472 KB Output is correct
20 Correct 145 ms 20700 KB Output is correct
21 Correct 136 ms 20704 KB Output is correct
22 Correct 142 ms 20452 KB Output is correct
23 Correct 144 ms 20216 KB Output is correct
24 Correct 148 ms 20344 KB Output is correct
25 Correct 144 ms 20332 KB Output is correct
26 Correct 144 ms 20200 KB Output is correct
27 Correct 281 ms 25172 KB Output is correct
28 Correct 278 ms 26040 KB Output is correct
29 Correct 280 ms 25976 KB Output is correct
30 Correct 281 ms 25952 KB Output is correct
31 Correct 289 ms 25980 KB Output is correct
32 Correct 237 ms 25480 KB Output is correct
33 Correct 242 ms 25500 KB Output is correct
34 Correct 234 ms 25636 KB Output is correct
35 Correct 223 ms 25592 KB Output is correct
36 Correct 221 ms 25608 KB Output is correct
37 Correct 222 ms 25592 KB Output is correct
38 Correct 420 ms 39672 KB Output is correct
39 Correct 429 ms 44220 KB Output is correct
40 Correct 391 ms 34564 KB Output is correct
41 Correct 556 ms 43572 KB Output is correct
42 Correct 237 ms 25592 KB Output is correct
43 Correct 247 ms 25592 KB Output is correct
44 Correct 334 ms 30312 KB Output is correct
45 Correct 340 ms 30928 KB Output is correct
46 Correct 345 ms 30904 KB Output is correct
47 Correct 248 ms 25700 KB Output is correct
48 Correct 245 ms 25704 KB Output is correct
49 Correct 367 ms 30920 KB Output is correct
50 Correct 350 ms 30764 KB Output is correct
51 Correct 347 ms 30172 KB Output is correct
52 Correct 313 ms 35420 KB Output is correct
53 Correct 365 ms 44016 KB Output is correct
54 Correct 432 ms 50144 KB Output is correct
55 Correct 368 ms 44088 KB Output is correct