| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1162274 | dubabuba | Gift Exchange (JOI24_ho_t4) | C++20 | 206 ms | 1860 KiB |
#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e6 + 10;
int n, a[mxn], b[mxn];
int st[mxn];
int main() {
cin >> n;
a[n + 1] = n + 1;
for(int i = 1; i <= n; i++) {
cin >> a[i];
assert(a[i - 1] < a[i]);
}
for(int i = 1; i <= n; i++) {
cin >> b[i];
st[i] = lower_bound(a, a + n + 1, b[i]) - a;
}
for(int i = 1; i <= n; i++)
st[i] = st[st[i]];
int q;
cin >> q;
while(q--) {
int l, r;
cin >> l >> r;
if(st[r] <= l) cout << "Yes\n";
else cout << "No\n";
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
