結果

問題 No.1768 The frog in the well knows the great ocean.
ユーザー tokusakuraitokusakurai
提出日時 2021-11-26 23:38:15
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 135 ms / 3,000 ms
コード長 7,306 bytes
コンパイル時間 2,414 ms
コンパイル使用メモリ 216,132 KB
実行使用メモリ 18,608 KB
最終ジャッジ日時 2023-09-12 06:01:18
合計ジャッジ時間 6,059 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 6 ms
4,384 KB
testcase_02 AC 6 ms
4,376 KB
testcase_03 AC 6 ms
4,384 KB
testcase_04 AC 6 ms
4,376 KB
testcase_05 AC 6 ms
4,380 KB
testcase_06 AC 110 ms
7,848 KB
testcase_07 AC 116 ms
10,256 KB
testcase_08 AC 108 ms
9,388 KB
testcase_09 AC 108 ms
7,776 KB
testcase_10 AC 111 ms
10,708 KB
testcase_11 AC 119 ms
11,044 KB
testcase_12 AC 118 ms
11,020 KB
testcase_13 AC 119 ms
11,028 KB
testcase_14 AC 119 ms
11,060 KB
testcase_15 AC 120 ms
11,108 KB
testcase_16 AC 129 ms
18,608 KB
testcase_17 AC 129 ms
18,608 KB
testcase_18 AC 127 ms
18,244 KB
testcase_19 AC 129 ms
18,476 KB
testcase_20 AC 125 ms
18,608 KB
testcase_21 AC 1 ms
4,380 KB
testcase_22 AC 1 ms
4,376 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 32 ms
4,380 KB
testcase_25 AC 135 ms
18,172 KB
testcase_26 AC 135 ms
18,544 KB
testcase_27 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

template <typename Monoid>
struct Segment_Tree {
    using F = function<Monoid(Monoid, Monoid)>;
    int n;
    vector<Monoid> seg;
    const F f;
    const Monoid e1;

    // f(f(a,b),c) = f(a,f(b,c)), f(e1,a) = f(a,e1) = a

    Segment_Tree(const vector<Monoid> &v, const F &f, const Monoid &e1) : f(f), e1(e1) {
        int m = v.size();
        n = 1;
        while (n < m) n <<= 1;
        seg.assign(2 * n, e1);
        copy(begin(v), end(v), seg.begin() + n);
        for (int i = n - 1; i > 0; i--) seg[i] = f(seg[2 * i], seg[2 * i + 1]);
    }

    Segment_Tree(int m, const Monoid &x, const F &f, const Monoid &e1) : f(f), e1(e1) {
        n = 1;
        while (n < m) n <<= 1;
        seg.assign(2 * n, e1);
        vector<Monoid> v(m, x);
        copy(begin(v), end(v), begin(seg) + n);
        for (int i = n - 1; i > 0; i--) seg[i] = f(seg[2 * i], seg[2 * i + 1]);
    }

    void change(int i, const Monoid &x, bool update = true) {
        if (update) {
            seg[i + n] = x;
        } else {
            seg[i + n] = f(seg[i + n], x);
        }
        i += n;
        while (i >>= 1) { seg[i] = f(seg[2 * i], seg[2 * i + 1]); }
    }

    Monoid query(int l, int r) const {
        Monoid L = e1, R = e1;
        l += n, r += n;
        while (l < r) {
            if (l & 1) L = f(L, seg[l++]);
            if (r & 1) R = f(seg[--r], R);
            l >>= 1, r >>= 1;
        }
        return f(L, R);
    }

    Monoid operator[](int i) const { return seg[n + i]; }

    template <typename C>
    int find_subtree(int i, const C &check, const Monoid &x, Monoid &M, bool type) const {
        while (i < n) {
            Monoid nxt = type ? f(seg[2 * i + type], M) : f(M, seg[2 * i + type]);
            if (check(nxt, x)) {
                i = 2 * i + type;
            } else {
                M = nxt, i = 2 * i + (type ^ 1);
            }
        }
        return i - n;
    }

    template <typename C>
    int find_first(int l, const C &check, const Monoid &x) const { // check((区間[l,r]での演算結果), x)を満たす最小のr
        Monoid L = e1;
        int a = l + n, b = n + n;
        while (a < b) {
            if (a & 1) {
                Monoid nxt = f(L, seg[a]);
                if (check(nxt, x)) return find_subtree(a, check, x, L, false);
                L = nxt, a++;
            }
            a >>= 1, b >>= 1;
        }
        return n;
    }

    template <typename C>
    int find_last(int r, const C &check, const Monoid &x) const { // check((区間[l,r)での演算結果), x)を満たす最大のl
        Monoid R = e1;
        int a = n, b = r + n;
        while (a < b) {
            if (b & 1 || a == 1) {
                Monoid nxt = f(seg[--b], R);
                if (check(nxt, x)) return find_subtree(b, check, x, R, true);
                R = nxt;
            }
            a >>= 1, b >>= 1;
        }
        return -1;
    }
};

int main() {
    int T;
    cin >> T;

    while (T--) {
        int N;
        cin >> N;

        vector<int> A(N), B(N);
        rep(i, N) {
            cin >> A[i];
            A[i]--;
        }
        rep(i, N) {
            cin >> B[i];
            B[i]--;
        }

        bool flag = true;
        rep(i, N) {
            if (A[i] > B[i]) flag = false;
        }
        if (!flag) {
            cout << "No\n";
            continue;
        }

        auto f1 = [](int a, int b) { return max(a, b); };
        auto f2 = [](int a, int b) { return min(a, b); };
        auto c1 = [](int a, int b) { return a > b; };
        auto c2 = [](int a, int b) { return a < b; };
        Segment_Tree<int> seg1(A, f1, -inf), seg2(B, f2, inf);

        vector<vector<pii>> ps(N);
        rep(i, N) {
            int l = max(seg1.find_last(i + 1, c1, A[i]), seg2.find_last(i + 1, c2, A[i])) + 1;
            int r = min(seg1.find_first(i, c1, A[i]), seg2.find_first(i, c2, A[i]));
            chmin(r, N);
            // cout << i << ' ' << l << ' ' << r << '\n';
            ps[A[i]].eb(l, r);
        }

        rep(i, N) sort(all(ps[i]));
        vector<int> ptr(N, 0);

        rep(i, N) {
            int x = B[i];
            while (ptr[x] < sz(ps[x])) {
                if (ps[x][ptr[x]].first > i) {
                    flag = false;
                    break;
                }
                if (i >= ps[x][ptr[x]].second) {
                    ptr[x]++;
                } else {
                    break;
                }
            }
            if (ptr[x] == sz(ps[x])) {
                flag = false;
                break;
            }
        }

        cout << (flag ? "Yes\n" : "No\n");
    }
}
0