제출 #1147426

#제출 시각아이디문제언어결과실행 시간메모리
1147426koukirocksGift Exchange (JOI24_ho_t4)C++20
10 / 100
21 ms1864 KiB
#include <bits/stdc++.h> #define F first #define S second #define speed ios_base::sync_with_stdio(0);cin.tie(0) #define all(x) x.begin()+1, x.end() using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; template<class T> using vvector = vector<vector<T>>; const ll oo = 0x3f3f3f3f3f3f3f3f; const ll INF = 0x3f3f3f3f; int main() { speed; int n; cin>>n; vector<pii> a(n+1),b(n+1); bool flag=false; for (int i=1;i<=n;i++) { cin>>a[i].F; a[i].S=i; } for (int i=1;i<=n;i++) { cin>>b[i].F; if (b[i].F==2*n-1) flag=true; b[i].S=i; } int q; cin>>q; while (q--) { int l,r; cin>>l>>r; cout<<(a[1].F==2*n-2 and flag?"No\n":"Yes\n"); } return 0; }
#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...