Submission #1157085

#	Time	Username	Problem	Language	Result	Execution time	Memory
1157085		mychecksedad	Gift Exchange (JOI24_ho_t4)	C++20	0 / 100	37 ms	3520 KiB

Main

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;


int n, q, pos[N];
array<int, 2> a[N];
void solve(){
  cin>> n;
  for(int i = 1; i <= n; ++i){
    cin >> a[i][0];
  }
  for(int i = 1; i <= n; ++i){
    cin >> a[i][1];
  }
  cin >> q;
  vector<array<int, 2>> v, p;
  for(int j = 1; j <= n; ++j) v.pb(a[j]);
  sort(all(v));
  for(int j=0;j<n;++j) p.pb({-v[j][1], j});
  sort(all(p));
  for(int j=0;j<v.size();++j){
    int i = p[j][1];
    pos[i] = lower_bound(all(v), array<int, 2>{v[i][1], -1}) - v.begin();
  }
  set<int> bad;
  for(int i = 1; i < n; ++i){
    if(pos[i]==i && pos[i-1]==i-1) bad.insert(i-1);
  }

  for(;q--;){
    int l, r;cin >> l >> r;
    --l, --r;
    auto it = bad.lower_bound(l);
    bool ok = it == bad.end() ? true : (*it) >= r;
    if(ok && pos[r] != r) cout << "Yes\n";
    else cout << "No\n";
  }
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

• Subtask 1: 0 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 31
• Subtask 5: 0 / 8
• Subtask 6: 0 / 12
• Subtask 7: 0 / 18
• Subtask 8: 0 / 12