結果

問題 No.1768 The frog in the well knows the great ocean.
ユーザー suta28407928suta28407928
提出日時 2021-11-26 23:29:48
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 939 ms / 3,000 ms
コード長 7,121 bytes
コンパイル時間 2,405 ms
コンパイル使用メモリ 194,520 KB
実行使用メモリ 13,136 KB
最終ジャッジ日時 2023-09-12 05:59:43
合計ジャッジ時間 9,831 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 7 ms
4,376 KB
testcase_02 AC 7 ms
4,376 KB
testcase_03 AC 7 ms
4,376 KB
testcase_04 AC 6 ms
4,380 KB
testcase_05 AC 7 ms
4,376 KB
testcase_06 AC 253 ms
5,708 KB
testcase_07 AC 281 ms
7,140 KB
testcase_08 AC 241 ms
6,912 KB
testcase_09 AC 249 ms
5,632 KB
testcase_10 AC 257 ms
7,476 KB
testcase_11 AC 325 ms
7,728 KB
testcase_12 AC 252 ms
7,692 KB
testcase_13 AC 207 ms
7,668 KB
testcase_14 AC 234 ms
7,724 KB
testcase_15 AC 292 ms
7,804 KB
testcase_16 AC 368 ms
12,292 KB
testcase_17 AC 370 ms
12,176 KB
testcase_18 AC 369 ms
12,396 KB
testcase_19 AC 248 ms
12,168 KB
testcase_20 AC 354 ms
12,264 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 40 ms
4,376 KB
testcase_25 AC 939 ms
13,136 KB
testcase_26 AC 505 ms
12,028 KB
testcase_27 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC ta g("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
//#include <atcoder/lazysegtree>
//using namespace atcoder;
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 510000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-9;
//const int mod = 1e9 + 7;
const int mod = 998244353;

template<typename Monoid>
struct Segtree {
    using F = function<Monoid(Monoid, Monoid)>;
    int sz;
    vector<Monoid> seg;
    const F f;
    const Monoid M;

    Segtree(int n, const F f, const Monoid &M) : f(f), M(M){
        sz = 1;
        while(sz < n) sz <<= 1;
        seg.assign(2*sz, M);
    }

    void set(int k, const Monoid &x) {
        seg[k + sz] = x;
    }

    void build(){
        for(int k=sz-1; k>0; k--){
            seg[k] = f(seg[2*k], seg[2*k+1]);
        }
    }

    void update(int k, const Monoid &x){
        k += sz;
        seg[k] = x;
        while(k >>= 1){
            seg[k] = f(seg[2*k], seg[2*k+1]);
        }
    }

    Monoid query(int a, int b){
        Monoid L = M, R = M;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1){
            if(a & 1) L = f(L, seg[a++]);
            if(b & 1) R = f(seg[--b], R);
        }
        return f(L, R);
    }

    Monoid operator[](const int &k) const {
        return seg[k + sz];
    }

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

    template<typename C>
    int find_first(int a, const C &check){
        Monoid L = M;
        if(a <= 0){
            if(check(f(L, seg[1]))) return find_subtree(1,check,L,false);
            return -1;
        }
        int b = sz;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1){
            if(a & 1){
                Monoid nxt = f(L, seg[a]);
                if(check(nxt)) return find_subtree(a,check,L,false);
                L = nxt;
                ++a;
            }
        }
        return -1;
    }

    template<typename C>
    int find_last(int b, const C &check){
        Monoid R = M;
        if(b >= sz){
            if(check(f(seg[1], R))) return find_subtree(1,check,R,true);
            return -1;
        }
        int a = sz;
        for(b += sz; a < b; a >>= 1, b >>= 1){
            if(b & 1){
                Monoid nxt = f(seg[--b], R);
                if(check(nxt)) return find_subtree(b,check,R,true);
                R = nxt;
            }
        }
        return -1;
    }
};

template<typename T> struct BIT{
    vector<T> dat;
    ll sz;
    //all 1-indexed
    BIT(ll sz) : sz(sz){
        dat.assign(++sz, 0);
    }

    T sum(ll k){
        T ret = 0;
        for(++k; k > 0; k -= k & -k) ret += dat[k];
        return (ret);
    }

    void add(ll k, T x){
        for(++k; k < dat.size(); k += k & -k) dat[k] += x;
    }
    
    ll get(T k){
        if(k <= 0) return 0; 
        ll ret = 0;
        int n = 1; while(n < sz) n *= 2;
        for(int i=n/2; i>0; i/=2){
            if(ret+i < sz && dat[ret+i] < k){
                k -= dat[ret+i];
                ret += i;
            }
        }
        return ret;
    }
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t; cin >> t;
    while(t--){
        int n; cin >> n;
        vl a(n); rep(i,n) cin >> a[i];
        vl b(n); rep(i,n) cin >> b[i];
        Segtree<int> seg(n,[](int a, int b){return max(a,b);},0);
        BIT<int> bit(n);
        vpl c(n);
        rep(i,n){
            c[i].first = b[i];
            c[i].second = i;
        }
        sort(all(c));
        rep(i,n) seg.set(i,a[i]);
        seg.build();
        bool yes = true;
        int pre = b[c[0].second];
        vl ls;
        rep(i,n){
            int id = c[i].second;
            if(pre != b[id]){
                for(auto x : ls) bit.add(x,1);
                ls.clear();
                pre = b[id];
            }
            ls.push_back(id);
            if(a[id] == b[id]) continue;
            if(a[id] > b[id]){
                yes = false;
                break;
            }
            int l = id, r = n;
            while(r-l > 1){
                int mid = (l+r)/2;
                if(seg.query(id,mid) >= b[id]) r = mid;
                else l = mid; 
            }
            if(seg.query(id,r) == b[id] && bit.sum(r-1) - bit.sum(id) == 0) continue;
            l = 0, r = id;
            while(r-l > 1){
                int mid = (l+r)/2;
                if(seg.query(mid,id) >= b[id]) l = mid;
                else r = mid;
            }
            if(seg.query(l,id) == b[id] && bit.sum(id-1) - bit.sum(l-1) == 0) continue;
            yes = false;
            break;
        }
        if(yes) cout << "Yes\n";
        else cout << "No\n";
    }
}
0