oj.uz

Submission #147903

# Submission time Handle Problem Language Result Execution time Memory
147903 2019-08-31T06:33:36 Z cheetose Long Mansion (JOI17_long_mansion) C++11
25 / 100
 3000 ms 52472 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];
Vi v[500001];
int n,q;
void upd(int i,int S,int E)
{
	int &l=L[i],&r=R[i];
	while(1)
	{
		if(l>S && tol[l]!=-1 && tol[l]<=r)
		{
			l--;
			l=min(l,L[l]);
			r=max(r,R[l]);
		}
		else if(r<E && tor[r]!=-1 && tor[r]>=l)
		{
			r++;
			l=min(l,L[r]);
			r=max(r,R[r]);
		}
		else break;
	}
}
void go(int S,int E)
{
	if(S==E)
	{
		L[S]=R[S]=S;
		return;
	}
	if(S+1==E)
	{
		L[S]=R[S]=S;
		L[E]=R[E]=E;
		if(tol[E]==E)L[E]=S;
		if(tor[S]==S)R[S]=E;
		return;
	}
	int M=(S+E)>>1;
	go(S,M);go(M,E);
	fdn(i,M,S,1)
	{
		upd(i,S,E);
	}
	fup(i,M,E,1)
	{
		upd(i,S,E);
	}
}
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:116:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
long_mansion.cpp:117: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:121:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&c);
   ~~~~~^~~~~~~~~
long_mansion.cpp:125:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&x);
    ~~~~~^~~~~~~~~
long_mansion.cpp:142:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&q);
  ~~~~~^~~~~~~~~
long_mansion.cpp:146: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

# Verdict Execution time Memory Grader output
1 Correct 20 ms 18180 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 21 ms 18172 KB Output is correct
6 Correct 21 ms 18168 KB Output is correct
7 Correct 24 ms 18040 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 18180 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 21 ms 18172 KB Output is correct
6 Correct 21 ms 18168 KB Output is correct
7 Correct 24 ms 18040 KB Output is correct
8 Correct 158 ms 23860 KB Output is correct
9 Correct 150 ms 23800 KB Output is correct
10 Correct 154 ms 23932 KB Output is correct
11 Correct 153 ms 24128 KB Output is correct
12 Correct 142 ms 23544 KB Output is correct
13 Correct 147 ms 24016 KB Output is correct
14 Correct 150 ms 23928 KB Output is correct
15 Correct 144 ms 24056 KB Output is correct
16 Correct 139 ms 24008 KB Output is correct
17 Correct 146 ms 24056 KB Output is correct
18 Correct 184 ms 24216 KB Output is correct
19 Correct 149 ms 24056 KB Output is correct
20 Correct 162 ms 24156 KB Output is correct
21 Correct 139 ms 24028 KB Output is correct
22 Correct 145 ms 24056 KB Output is correct
23 Correct 149 ms 23800 KB Output is correct
24 Correct 150 ms 23928 KB Output is correct
25 Correct 150 ms 23928 KB Output is correct
26 Correct 149 ms 23800 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 28704 KB Output is correct
2 Correct 291 ms 31768 KB Output is correct
3 Correct 287 ms 31492 KB Output is correct
4 Correct 299 ms 31864 KB Output is correct
5 Correct 313 ms 31752 KB Output is correct
6 Correct 243 ms 30584 KB Output is correct
7 Correct 229 ms 30304 KB Output is correct
8 Correct 218 ms 30328 KB Output is correct
9 Correct 341 ms 30328 KB Output is correct
10 Correct 223 ms 30328 KB Output is correct
11 Correct 225 ms 30328 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 18180 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 21 ms 18172 KB Output is correct
6 Correct 21 ms 18168 KB Output is correct
7 Correct 24 ms 18040 KB Output is correct
8 Correct 158 ms 23860 KB Output is correct
9 Correct 150 ms 23800 KB Output is correct
10 Correct 154 ms 23932 KB Output is correct
11 Correct 153 ms 24128 KB Output is correct
12 Correct 142 ms 23544 KB Output is correct
13 Correct 147 ms 24016 KB Output is correct
14 Correct 150 ms 23928 KB Output is correct
15 Correct 144 ms 24056 KB Output is correct
16 Correct 139 ms 24008 KB Output is correct
17 Correct 146 ms 24056 KB Output is correct
18 Correct 184 ms 24216 KB Output is correct
19 Correct 149 ms 24056 KB Output is correct
20 Correct 162 ms 24156 KB Output is correct
21 Correct 139 ms 24028 KB Output is correct
22 Correct 145 ms 24056 KB Output is correct
23 Correct 149 ms 23800 KB Output is correct
24 Correct 150 ms 23928 KB Output is correct
25 Correct 150 ms 23928 KB Output is correct
26 Correct 149 ms 23800 KB Output is correct
27 Correct 290 ms 28704 KB Output is correct
28 Correct 291 ms 31768 KB Output is correct
29 Correct 287 ms 31492 KB Output is correct
30 Correct 299 ms 31864 KB Output is correct
31 Correct 313 ms 31752 KB Output is correct
32 Correct 243 ms 30584 KB Output is correct
33 Correct 229 ms 30304 KB Output is correct
34 Correct 218 ms 30328 KB Output is correct
35 Correct 341 ms 30328 KB Output is correct
36 Correct 223 ms 30328 KB Output is correct
37 Correct 225 ms 30328 KB Output is correct
38 Correct 461 ms 48592 KB Output is correct
39 Correct 471 ms 52472 KB Output is correct
40 Correct 415 ms 43128 KB Output is correct
41 Correct 542 ms 50820 KB Output is correct
42 Correct 260 ms 31408 KB Output is correct
43 Correct 247 ms 31464 KB Output is correct
44 Correct 340 ms 38440 KB Output is correct
45 Correct 347 ms 38564 KB Output is correct
46 Correct 348 ms 38792 KB Output is correct
47 Correct 245 ms 31480 KB Output is correct
48 Correct 251 ms 31272 KB Output is correct
49 Correct 334 ms 38368 KB Output is correct
50 Correct 340 ms 38616 KB Output is correct
51 Correct 350 ms 38776 KB Output is correct
52 Execution timed out 3043 ms 29688 KB Time limit exceeded
53 Halted 0 ms 0 KB -