Submission #1153361

#TimeUsernameProblemLanguageResultExecution timeMemory
1153361irmuunGift Exchange (JOI24_ho_t4)C++20
4 / 100
2595 ms2632 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n; cin>>n; ll a[n+5],b[n+5]; for(ll i=1;i<=n;i++){ cin>>a[i]; } for(ll i=1;i<=n;i++){ cin>>b[i]; } ll ans=0; ll q; cin>>q; while(q--){ ll l,r; cin>>l>>r; vector<ll>v(r-l+1); iota(all(v),l); bool flag=false; do{ bool ok=true; for(ll i=0;i<v.size();i++){ if(v[i]==i+l){ ok=false; break; } if(a[v[i]]<b[i+l]){ ok=false; break; } } if(ok) flag=true; }while(next_permutation(all(v))); cout<<(flag?"Yes\n":"No\n"); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...