#939748 (C++17) No.2594 Mix shake!!

提出ソース

結果

問題	No.2594 Mix shake!!
ユーザー	👑 Nachia
提出日時	2023-12-22 04:55:21
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	8,084 bytes
コンパイル時間	1,443 ms
コンパイル使用メモリ	125,028 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-27 11:16:58
合計ジャッジ時間	3,732 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,944 KB
testcase_18	AC	5 ms 6,940 KB
testcase_19	AC	5 ms 6,944 KB
testcase_20	AC	4 ms 6,940 KB
testcase_21	AC	2 ms 6,944 KB
testcase_22	AC	5 ms 6,944 KB
testcase_23	AC	5 ms 6,944 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	2 ms 6,940 KB
testcase_26	WA	-
testcase_27	AC	2 ms 6,944 KB
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	AC	5 ms 6,940 KB
testcase_33	AC	5 ms 6,940 KB
testcase_34	AC	5 ms 6,944 KB
testcase_35	WA	-
testcase_36	AC	5 ms 6,940 KB
testcase_37	WA	-
testcase_38	AC	5 ms 6,940 KB
testcase_39	WA	-
testcase_40	AC	5 ms 6,944 KB
testcase_41	WA	-
testcase_42	AC	6 ms 6,944 KB
testcase_43	WA	-
testcase_44	AC	5 ms 6,944 KB
testcase_45	WA	-
testcase_46	AC	6 ms 6,940 KB
testcase_47	WA	-
testcase_48	AC	5 ms 6,944 KB
testcase_49	WA	-
testcase_50	AC	5 ms 6,940 KB
testcase_51	WA	-
testcase_52	AC	6 ms 6,944 KB
testcase_53	WA	-
testcase_54	AC	5 ms 6,944 KB
testcase_55	AC	5 ms 6,944 KB
testcase_56	AC	2 ms 6,940 KB
testcase_57	AC	2 ms 6,944 KB
testcase_58	AC	2 ms 6,940 KB
testcase_59	AC	2 ms 6,940 KB
testcase_60	AC	2 ms 6,944 KB
testcase_61	AC	2 ms 6,940 KB
testcase_62	AC	2 ms 6,944 KB
testcase_63	AC	2 ms 6,944 KB
testcase_64	AC	2 ms 6,940 KB
testcase_65	AC	2 ms 6,944 KB
testcase_66	AC	6 ms 6,940 KB
testcase_67	AC	5 ms 6,940 KB
testcase_68	AC	5 ms 6,940 KB
testcase_69	AC	5 ms 6,940 KB
testcase_70	AC	6 ms 6,940 KB
testcase_71	AC	5 ms 6,940 KB
testcase_72	AC	2 ms 6,940 KB
testcase_73	AC	2 ms 6,940 KB
testcase_74	AC	2 ms 6,944 KB
testcase_75	AC	2 ms 6,940 KB
testcase_76	AC	2 ms 6,940 KB
testcase_77	AC	2 ms 6,940 KB
testcase_78	AC	2 ms 6,944 KB
testcase_79	AC	2 ms 6,944 KB
testcase_80	AC	6 ms 6,940 KB
testcase_81	AC	5 ms 6,944 KB
testcase_82	AC	5 ms 6,944 KB
testcase_83	AC	5 ms 6,944 KB
testcase_84	AC	5 ms 6,940 KB
testcase_85	AC	5 ms 6,940 KB
testcase_86	AC	5 ms 6,940 KB
testcase_87	AC	5 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#ifdef NACHIA
// #define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = priority_queue<A,vector<A>,greater<A>>;
using Modint = atcoder::static_modint<998244353>;

#include <iterator>
#include <functional>

template<class Elem> struct vec;

template<class Iter>
struct seq_view{
    using Ref = typename std::iterator_traits<Iter>::reference;
    using Elem = typename std::iterator_traits<Iter>::value_type;
    Iter a, b;
    Iter begin() const { return a; }
    Iter end() const { return b; }
    int size() const { return (int)(b-a); }
    seq_view(Iter first, Iter last) : a(first), b(last) {}
    seq_view sort() const { std::sort(a, b); return *this; }
    Ref& operator[](int x){ return *(a+x); }
    template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {
        ret x(size()); for(int i=0; i<size(); i++) x[i] = i;
        x().sort([&](int l, int r){ return f(a[l],a[r]); });
        return x;
    }
    template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }
    template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>
    ret rle(F eq = F()) const {
        auto x = ret();
        for(auto& a : (*this)){
            if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;
        } return x;
    }
    template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }
    Iter uni() const { return std::unique(a, b); }
    Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }
    Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }
    int lbi(const Elem& x) const { return lb(x) - a; }
    int ubi(const Elem& x) const { return ub(x) - a; }
    seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }
    template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }
    template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }
    template<class F> Iter when_true_to_false(F f) const {
        if(a == b) return a;
        return std::lower_bound(a, b, *a,
            [&](const Elem& x, const Elem&){ return f(x); });
    }
    seq_view same(Elem x) const { return { lb(x), ub(x) }; }
    template<class F> auto map(F f) const {
        vec<typename Iter::value_type> r;
        for(auto& x : *this) r.emp(f(x));
        return r;
    }
    Iter max() const { return std::max_element(a, b); }
    Iter min() const { return std::min_element(a, b); }
    template<class F = std::less<Elem>>
    Iter min(F f) const { return std::min_element(a, b, f); }
    seq_view rev() const { std::reverse(a, b); return *this; }
};

template<class Elem>
struct vec {
    using Base = typename std::vector<Elem>;
    using Iter = typename Base::iterator;
    using CIter = typename Base::const_iterator;
    using View = seq_view<Iter>;
    using CView = seq_view<CIter>;

    vec(){}
    explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}
    template <class I2> vec(I2 first, I2 last) : a(first, last) {}
    vec(std::initializer_list<Elem> il) : a(std::move(il)) {}
    vec(Base b) : a(std::move(b)) {}
    operator Base() const { return a; }

    Iter begin(){ return a.begin(); }
    CIter begin() const { return a.begin(); }
    Iter end(){ return a.end(); }
    CIter end() const { return a.end(); }
    int size() const { return a.size(); }
    bool empty() const { return a.empty(); }
    Elem& back(){ return a.back(); }
    const Elem& back() const { return a.back(); }
    vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }
    Iter operator()(int x){ return a.begin() + x; }
    CIter operator()(int x) const { return a.begin() + x; }
    View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }
    CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }
    View operator()(){ return (*this)(0,size()); }
    CView operator()() const { return (*this)(0,size()); }
    Elem& operator[](int x){ return a[x]; }
    const Elem& operator[](int x) const { return a[x]; }
    Base& operator*(){ return a; }
    const Base& operator*() const { return a; }
    vec& push(Elem args){
        a.push_back(std::move(args));
        return *this;
    }
    template<class... Args>
    vec& emp(Args &&... args){
        a.emplace_back(std::forward<Args>(args) ...);
        return *this;
    }
    template<class Range>
    vec& app(Range& x){ for(auto& v : a) emp(v); }
    Elem pop(){
        Elem x = std::move(a.back());
        a.pop_back(); return x;
    }
    bool operator==(const vec& r) const { return a == r.a; }
    bool operator!=(const vec& r) const { return a != r.a; }
    bool operator<(const vec& r) const { return a < r.a; }
    bool operator<=(const vec& r) const { return a <= r.a; }
    bool operator>(const vec& r) const { return a > r.a; }
    bool operator>=(const vec& r) const { return a >= r.a; }
    vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }
    template<class F> vec& filter(F f){
        int p = 0;
        for(int q=0; q<size(); q++) if(f(a[q])) std::swap(a[p++],a[q]);
        a.resize(p); return *this;
    }
private: Base a;
};

template<class IStr, class U, class T>
IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }
template<class IStr, class T>
IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }
template<class OStr, class T>
OStr& operator<<(OStr& os, const vec<T>& v){
    for(int i=0; i<v.size(); i++){
        if(i){ os << ' '; } os << v[i];
    } return os;
}
using i128 = __int128_t;

struct Item {
    i64 x, y;
};

Item operator+(Item l, Item r){ return { l.x + r.x, l.y + r.y }; }
Item operator-(Item l, Item r){ return { l.x - r.x, l.y - r.y }; }
bool operator<(Item l, Item r){ return (i128)l.x * r.y > (i128)l.y * r.x; }

bool verify(vector<Item> A, vector<Item> B){
    int an = A.size();
    int bn = B.size();
    rep(i,bn-1) if(B[i+1] < B[i]) return false;
    vector<Item> A2; A2.push_back({0,0});
    rep(i,an) A2.push_back(A2.back() + A[i]);
    vector<Item> B2; B2.push_back({0,0});
    rep(i,bn) B2.push_back(B2.back() + B[i]);
    int p = 0, q = 0;
    while(p < an && q < bn){
        if(A2[p+1].x < B2[q+1].x){
            if(B2[q+1] - B2[q] < A2[p+1] - B2[q]) return false;
            p++;
        } else {
            if(B2[q+1] - A2[p] < A2[p+1] - A2[p]) return false;
            q++;
        }
    }
    return true;
}


void testcase(){
    int N; cin >> N;
    vector<Item> A(N), B(N);
    {
        vector<Item> C(N), D(N);
        rep(i,N) cin >> C[i].x;
        rep(i,N) cin >> C[i].y;
        rep(i,N) cin >> D[i].x;
        rep(i,N) cin >> D[i].y;
        vector<int> I(N); rep(i,N) I[i] = i;
        sort(I.begin(), I.end(), [&](int l, int r){ return D[l] < D[r]; });
        rep(i,N) A[i] = C[I[i]];
        rep(i,N) B[i] = D[I[i]];
    }
    bool ans = false;
    rep(i,N) rep(j,i){
        auto A2 = A;
        auto B2 = B;
        A2[i] = A2[i] + A2[j]; A2[j] = {0,0};
        sort(A2.begin(), A2.end());
        sort(B2.begin(), B2.end());
        if(verify(A2, B2)) ans = true;
    }
    if(verify(A, B)) ans = true;
    cout << yn(ans) << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}

yukicoder

結果

テストケース

ソースコード