| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1338351 | retarde | Gift Exchange (JOI24_ho_t4) | C++20 | 2593 ms | 16204 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
inline void solve() {
int n; cin >> n;
vector<pii> v(n); for (int i = 0; i < n; i++) cin >> v[i].fi;
for (int i = 0; i < n; i++) cin >> v[i].se;
int q; cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
l--; r--;
vector<pii> v2; for (int i = l; i <= r; i++) v2.pb(v[i]);
mii ba; for (auto &x : v2) ba[x.se]=x.fi;
set<int> availA; for (auto &x : v2) availA.insert(x.fi);
vi bs; for (auto &x : v2) bs.pb(x.se);
sort(all(bs)); reverse(all(bs));
bool ok = true;
for (auto &b : bs) {
// highest a
auto ptr = availA.rbegin();
int x = *ptr;
if (ba[b]==x) ptr++;
int y = *ptr;
if (y < b) {
ok = false;
break;
}
availA.erase(availA.find((*ptr)));
}
cout << (ok ? "Yes" : "No") << '\n';
// sort(all(v2));
// bool ok = true;
// int n2 = (int)v2.size();
// for (int i = 0; i < n2; i++) {
// if (v2[i].se > v2[(i - 1 + n2)%n2].fi) {ok = false; break;}
// }
// cout << (ok ? "Yes" : "No") << '\n';
}
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}Compilation message (stderr)
| # | 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... | ||||
