結果

問題 No.1768 The frog in the well knows the great ocean.
ユーザー oteraotera
提出日時 2022-04-03 09:26:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 132 ms / 3,000 ms
コード長 9,105 bytes
コンパイル時間 2,960 ms
コンパイル使用メモリ 217,180 KB
実行使用メモリ 18,332 KB
最終ジャッジ日時 2024-11-23 00:08:44
合計ジャッジ時間 6,926 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 5 ms
5,248 KB
testcase_02 AC 6 ms
5,248 KB
testcase_03 AC 6 ms
5,248 KB
testcase_04 AC 6 ms
5,248 KB
testcase_05 AC 6 ms
5,248 KB
testcase_06 AC 100 ms
7,356 KB
testcase_07 AC 106 ms
9,796 KB
testcase_08 AC 100 ms
8,800 KB
testcase_09 AC 98 ms
7,136 KB
testcase_10 AC 102 ms
9,916 KB
testcase_11 AC 117 ms
10,536 KB
testcase_12 AC 109 ms
10,788 KB
testcase_13 AC 103 ms
10,404 KB
testcase_14 AC 110 ms
10,664 KB
testcase_15 AC 112 ms
10,788 KB
testcase_16 AC 132 ms
16,928 KB
testcase_17 AC 130 ms
16,924 KB
testcase_18 AC 127 ms
17,052 KB
testcase_19 AC 116 ms
16,868 KB
testcase_20 AC 131 ms
16,920 KB
testcase_21 AC 2 ms
5,248 KB
testcase_22 AC 2 ms
5,248 KB
testcase_23 AC 3 ms
5,248 KB
testcase_24 AC 48 ms
5,248 KB
testcase_25 AC 123 ms
18,208 KB
testcase_26 AC 86 ms
18,332 KB
testcase_27 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
 *    author:  otera
**/
#include<bits/stdc++.h>

namespace otera {
    template <typename T>
    struct Compressor {
        public:
            static constexpr int absent = -1;

            Compressor() : _xs(std::vector<T>{}) {}

            Compressor(const std::vector<T> &vs) {
                add(vs);
                build();
            }

            void add(const std::vector<T> &vs) {
                std::copy(vs.begin(), vs.end(), std::back_inserter(_xs));
            }

            void add(const T &e) {
                _xs.emplace_back(e);
            }

            void build() {
                std::sort(_xs.begin(), _xs.end());
                _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());
            }

            int size() const {
                return _xs.size();
            }

            bool has_key(const T &e) const {
                return std::binary_search(_xs.begin(), _xs.end(), e);
            }

            std::vector<int> get(const std::vector<T> &vs) const {
                std::vector<int> res;
                std::transform(vs.begin(), vs.end(), std::back_inserter(res), [&](const T &e) {
                    return get(e);
                });
                return res;
            }

            int get(const T &e, int default_value = absent) const {
                const int id = min_geq_index(e);
                return id != size() and _xs[id] == e ? id : default_value;
            }

            const T &operator[](int compressed_index) const {
                return _xs[compressed_index];
            }

            T min_gt(const T &e, const T &default_value) const {
                auto it = std::upper_bound(_xs.begin(), _xs.end(), e);
                return it == _xs.end() ? default_value : *it;
            }
            T min_geq(const T &e, const T &default_value) const {
                auto it = std::lower_bound(_xs.begin(), _xs.end(), e);
                return it == _xs.end() ? default_value : *it;
            }
            T max_lt(const T &e, const T &default_value) const {
                auto it = std::lower_bound(_xs.begin(), _xs.end(), e);
                return it == _xs.begin() ? default_value : *std::prev(it);
            }
            T max_leq(const T &e, const T &default_value) const {
                auto it = std::upper_bound(_xs.begin(), _xs.end(), e);
                return it == _xs.begin() ? default_value : *std::prev(it);
            }
            int min_gt_index(const T &e) const {
                return std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();
            }
            int min_geq_index(const T &e) const {
                return std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();
            }
            int max_lt_index(const T &e) const {
                return int(std::lower_bound(_xs.begin(), _xs.end(), e)- _xs.begin()) - 1;
            }
            int max_leq_index(const T &e) const {
                return int(std::upper_bound(_xs.begin(), _xs.end(), e)- _xs.begin()) - 1;
            }
        private:
            std::vector<T> _xs;
    };
} // namespace otera

#include<atcoder/segtree>
using namespace std;

#define int long long

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using int128_t = __int128_t;
#define repa(i, n) for(int i = 0; i < n; ++ i)
#define repb(i, a, b) for(int i = a; i < b; ++ i)
#define repc(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)
#define rep1a(i, n) for(int i = 0; i <= n; ++ i)
#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)
#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)
#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)
#define rev_repa(i, n) for(int i=n-1;i>=0;i--)
#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)
#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)
#define rev_rep1a(i, n) for(int i=n;i>=1;i--)
#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)
#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(), c.rend()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define si(c) (int)(c).size()
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
#define kth_bit(x, k) ((x>>k)&1)
#define unless(A) if(!(A))
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U> using umap = unordered_map<T, U>;
template<class T> void scan(T& a){ cin >> a; }
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ cout << ' '; }
template<class T> void print(const T& a){ cout << a; }
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }
int out(){ cout << '\n'; return 0; }
template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...)
#define dump(...)
#endif

struct io_setup {
    io_setup(int precision = 20) {
        ios::sync_with_stdio(false);
        cin.tie(0);
        cout << fixed << setprecision(precision);
    }
} io_setup_ {};

const int inf = 1'000'000'007;

int op(int a, int b) {
    return max(a, b);
}

int e() {
    return 0;
}

int val;

bool f(int x) {
    return x < val;
}

void solve() {
    INT(n);
    VEC(int, a, n);
    VEC(int, b, n);
    otera::Compressor<int> bs(b);
    int sz = si(bs);
    vvc<int> g(sz);
    rep(i, n) {
        g[bs.get(b[i])].eb(i);
    }
    atcoder::segtree<int, op, e> seg(a);
    rep(i, sz) {
        for(int id: g[i]) {
            if(a[id] > b[id]) {
                out("No");
                return;
            }
            val = b[id];
            int left = seg.min_left<f>(id + 1);
            int right = seg.max_right<f>(id); 
            if(left != 0 and seg.prod(left - 1, id + 1) == b[id]) continue;
            if(right != n and seg.prod(id, right + 1) == b[id]) continue;
            out("No");
            return;
        }
        for(int id: g[i]) {
            seg.set(id, inf);
        }
    }
    out("Yes");
}

signed main() {
    int testcase = 1;
    in(testcase);
    while(testcase--) solve();
    return 0;
}
0