oj.uz

답안 #260693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260693 2020-08-10T18:12:30 Z fadi57 Long Mansion (JOI17_long_mansion) C++14
10 / 100
 3000 ms 28256 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long

const int mx=500020;
int c[mx];
ll b[mx];

vector<ll>keys[mx];
ll mxright[mx];
ll mxleft[mx];
ll n,m;
int leftt[mx];int rightt[mx];
int last[mx];
int canr(int i){
    if(leftt[mxright[i]]>=mxleft[i]&&leftt[mxright[i]]!=-1&&mxright[i]<n){
       return 1;
    }return 0;
}int canl(int i){
    if(rightt[mxleft[i]-1]<=mxright[i]&&rightt[mxleft[i]-1]!=-1&&mxleft[i]>1){
       return 1;
    }return 0;
}
int main()
{
  
  cin>>n;
  for(ll i=1;i<n;i++){
      cin>>c[i];
  }
  
  for(ll i=1;i<=n;i++){
      cin>>b[i];
      for(ll j=0;j<b[i];j++){
          ll x;
          cin>>x;
          keys[i].push_back(x);
      }
  }
  
    memset(last ,-1 ,sizeof last);
    
    for(int i=1;i<n;i++){
        for(int j:keys[i]){
            last[j]=i;
        }
        leftt[i]=last[c[i]];
    } 
    memset(last ,-1 ,sizeof last);
    
      for(int i=n-1;i>=1;i--){
        for(int j:keys[i+1]){
            last[j]=i+1;
        }
       rightt[i]=last[c[i]];
    }
    for(ll i=1;i<=n;i++){
        
       ll myr=i;
        ll myl=i; mxleft[i]=i;  mxright[i]=i;
        while(1){
          ll xx=0;ll xo=0;
       
          if(canr(i)){
              xx=1;
              
              myr++;
            mxright[i]=myr;
             
          }
          if(canl(i)){
              xo=1;
             
             
              myl--;  mxleft[i]=myl;
               mxleft[i]=min(mxleft[i],mxleft[mxleft[i]]);
               mxright[i]=max(mxright[i],mxright[mxleft[i]]);
        
          }
            if(xo||xx){
                
            }else{
                break;
               
            }
        } 
     
  }
  ll q;cin>>q;
  for(ll i=0;i<q;i++){
      ll x,y;cin>>x>>y;
     //cout<<mxleft[x]<<" "<<mxright[x];
      if(mxleft[x]<=y&&y<=mxright[x]){
         cout<<"YES";
      }else{cout<<"NO";}
      cout<<endl;
  }

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 14336 KB Output is correct
2 Correct 29 ms 14336 KB Output is correct
3 Correct 45 ms 14464 KB Output is correct
4 Correct 26 ms 14336 KB Output is correct
5 Correct 26 ms 14336 KB Output is correct
6 Correct 26 ms 14336 KB Output is correct
7 Correct 27 ms 14336 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 14336 KB Output is correct
2 Correct 29 ms 14336 KB Output is correct
3 Correct 45 ms 14464 KB Output is correct
4 Correct 26 ms 14336 KB Output is correct
5 Correct 26 ms 14336 KB Output is correct
6 Correct 26 ms 14336 KB Output is correct
7 Correct 27 ms 14336 KB Output is correct
8 Correct 1557 ms 20216 KB Output is correct
9 Correct 1462 ms 20216 KB Output is correct
10 Correct 1476 ms 20448 KB Output is correct
11 Correct 1529 ms 20984 KB Output is correct
12 Correct 1465 ms 20084 KB Output is correct
13 Correct 1475 ms 20344 KB Output is correct
14 Correct 1473 ms 20472 KB Output is correct
15 Correct 1460 ms 20628 KB Output is correct
16 Correct 1444 ms 20372 KB Output is correct
17 Correct 1530 ms 20392 KB Output is correct
18 Correct 1482 ms 20448 KB Output is correct
19 Correct 1467 ms 20344 KB Output is correct
20 Correct 1462 ms 20324 KB Output is correct
21 Correct 1433 ms 20088 KB Output is correct
22 Correct 1464 ms 20444 KB Output is correct
23 Correct 1456 ms 20088 KB Output is correct
24 Correct 1484 ms 20344 KB Output is correct
25 Correct 1459 ms 20252 KB Output is correct
26 Correct 1473 ms 20180 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2842 ms 28256 KB Output is correct
2 Execution timed out 3054 ms 26684 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 14336 KB Output is correct
2 Correct 29 ms 14336 KB Output is correct
3 Correct 45 ms 14464 KB Output is correct
4 Correct 26 ms 14336 KB Output is correct
5 Correct 26 ms 14336 KB Output is correct
6 Correct 26 ms 14336 KB Output is correct
7 Correct 27 ms 14336 KB Output is correct
8 Correct 1557 ms 20216 KB Output is correct
9 Correct 1462 ms 20216 KB Output is correct
10 Correct 1476 ms 20448 KB Output is correct
11 Correct 1529 ms 20984 KB Output is correct
12 Correct 1465 ms 20084 KB Output is correct
13 Correct 1475 ms 20344 KB Output is correct
14 Correct 1473 ms 20472 KB Output is correct
15 Correct 1460 ms 20628 KB Output is correct
16 Correct 1444 ms 20372 KB Output is correct
17 Correct 1530 ms 20392 KB Output is correct
18 Correct 1482 ms 20448 KB Output is correct
19 Correct 1467 ms 20344 KB Output is correct
20 Correct 1462 ms 20324 KB Output is correct
21 Correct 1433 ms 20088 KB Output is correct
22 Correct 1464 ms 20444 KB Output is correct
23 Correct 1456 ms 20088 KB Output is correct
24 Correct 1484 ms 20344 KB Output is correct
25 Correct 1459 ms 20252 KB Output is correct
26 Correct 1473 ms 20180 KB Output is correct
27 Correct 2842 ms 28256 KB Output is correct
28 Execution timed out 3054 ms 26684 KB Time limit exceeded
29 Halted 0 ms 0 KB -