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

提出ソース

結果

問題	No.2594 Mix shake!!
ユーザー	tko919
提出日時	2023-12-23 04:15:34
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	48 ms / 2,000 ms
コード長	9,177 bytes
コンパイル時間	7,424 ms
コンパイル使用メモリ	411,500 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-27 12:05:14
合計ジャッジ時間	10,462 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,948 KB
testcase_18	AC	4 ms 6,940 KB
testcase_19	AC	4 ms 6,940 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 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,944 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	3 ms 6,944 KB
testcase_29	AC	2 ms 6,940 KB
testcase_30	AC	2 ms 6,944 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	5 ms 6,940 KB
testcase_33	AC	5 ms 6,940 KB
testcase_34	AC	47 ms 6,940 KB
testcase_35	AC	47 ms 6,944 KB
testcase_36	AC	48 ms 6,940 KB
testcase_37	AC	46 ms 6,940 KB
testcase_38	AC	47 ms 6,944 KB
testcase_39	AC	44 ms 6,944 KB
testcase_40	AC	47 ms 6,940 KB
testcase_41	AC	45 ms 6,944 KB
testcase_42	AC	47 ms 6,940 KB
testcase_43	AC	46 ms 6,940 KB
testcase_44	AC	48 ms 6,940 KB
testcase_45	AC	38 ms 6,940 KB
testcase_46	AC	46 ms 6,944 KB
testcase_47	AC	46 ms 6,940 KB
testcase_48	AC	47 ms 6,944 KB
testcase_49	AC	46 ms 6,940 KB
testcase_50	AC	46 ms 6,948 KB
testcase_51	AC	39 ms 6,940 KB
testcase_52	AC	46 ms 6,944 KB
testcase_53	AC	46 ms 6,940 KB
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,944 KB
testcase_59	AC	2 ms 6,944 KB
testcase_60	AC	2 ms 6,940 KB
testcase_61	AC	2 ms 6,940 KB
testcase_62	AC	2 ms 6,940 KB
testcase_63	AC	2 ms 6,940 KB
testcase_64	AC	2 ms 6,940 KB
testcase_65	AC	1 ms 6,940 KB
testcase_66	AC	5 ms 6,944 KB
testcase_67	AC	3 ms 6,940 KB
testcase_68	AC	5 ms 6,944 KB
testcase_69	AC	2 ms 6,944 KB
testcase_70	AC	5 ms 6,940 KB
testcase_71	AC	2 ms 6,944 KB
testcase_72	AC	2 ms 6,944 KB
testcase_73	AC	2 ms 6,940 KB
testcase_74	AC	2 ms 6,940 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	5 ms 6,944 KB
testcase_81	AC	2 ms 6,944 KB
testcase_82	AC	5 ms 6,940 KB
testcase_83	AC	2 ms 6,940 KB
testcase_84	AC	4 ms 6,940 KB
testcase_85	AC	2 ms 6,944 KB
testcase_86	AC	2 ms 6,940 KB
testcase_87	AC	3 ms 6,940 KB

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

ソースコード

raw source code

#line 1 "library/Template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) sort(ALL(v)),(v).erase(unique(ALL(v)),(v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v,x) int(lower_bound(ALL(v),(x))-(v).begin())
#define UB(v,x) int(upper_bound(ALL(v),(x))-(v).begin())

using ll=long long int;
using ull=unsigned long long;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<typename T,typename U>T ceil(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>T floor(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?x/y:(x-y+1)/y);}
template<typename T>int popcnt(T x){return __builtin_popcountll(x);}
template<typename T>int topbit(T x){return (x==0?-1:63-__builtin_clzll(x));}
template<typename T>int lowbit(T x){return (x==0?-1:__builtin_ctzll(x));}
#line 2 "library/Utility/fastio.hpp"
#include <unistd.h>

class FastIO{
    static constexpr int L=1<<16;
    char rdbuf[L];
    int rdLeft=0,rdRight=0;
    inline void reload(){
        int len=rdRight-rdLeft;
        memmove(rdbuf,rdbuf+rdLeft,len);
        rdLeft=0,rdRight=len;
        rdRight+=fread(rdbuf+len,1,L-len,stdin);
    }
    inline bool skip(){
        for(;;){
            while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;
            if(rdLeft==rdRight){
                reload();
                if(rdLeft==rdRight)return false;
            }
            else break;
        }
        return true;
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    inline bool _read(__int128_t& x){
        if(!skip())return false;
        if(rdLeft+40>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    inline bool _read(__uint128_t& x){
        if(!skip())return false;
        if(rdLeft+40>=rdRight)reload();
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        return true;
    }
    template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        if(rdbuf[rdLeft]!='.')return true;
        rdLeft++;
        T base=.1;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x+=base*(rdbuf[rdLeft++]^48);
            base*=.1;
        }
        if(neg)x=-x;
        return true;
    }
    inline bool _read(char& x){
        if(!skip())return false;
        if(rdLeft+1>=rdRight)reload();
        x=rdbuf[rdLeft++];
        return true;
    }
    inline bool _read(string& x){
        if(!skip())return false;
        for(;;){
            int pos=rdLeft;
            while(pos<rdRight and rdbuf[pos]>' ')pos++;
            x.append(rdbuf+rdLeft,pos-rdLeft);
            if(rdLeft==pos)break;
            rdLeft=pos;
            if(rdLeft==rdRight)reload();
            else break;
        }
        return true;
    }
    template<typename T>inline bool _read(vector<T>& v){
        for(auto& x:v){
            if(!_read(x))return false;
        }
        return true;
    }

    char wtbuf[L],tmp[50];
    int wtRight=0;
    inline void _write(const char& x){
        if(wtRight>L-32)flush();
        wtbuf[wtRight++]=x;
    }
    inline void _write(const string& x){
        for(auto& c:x)_write(c);
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){
        if(wtRight>L-32)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {
                switch (sizeof(x)) {
                case 2: _write("32768"); return;
                case 4: _write("2147483648"); return;
                case 8: _write("9223372036854775808"); return;
                }
            }
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    inline void _write(__int128_t x){
        if(wtRight>L-40)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    inline void _write(__uint128_t x){
        if(wtRight>L-40)flush();
        if(x==0){
            _write('0');
            return;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    inline void _write(double x){
        ostringstream oss;
        oss << fixed << setprecision(15) << double(x);
        string s = oss.str();
        _write(s);
    }
    template<typename T>inline void _write(const vector<T>& v){
        rep(i,0,v.size()){
            if(i)_write(' ');
            _write(v[i]);
        }
    }
public:
    FastIO(){}
    ~FastIO(){flush();}
    inline void read(){}
    template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){
        assert(_read(head));
        read(tail...); 
    }
    template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\n');}
    template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){
        _write(head);
        write<ln,true>(tail...); 
        if(space)_write(' ');
    }
    inline void flush(){
        fwrite(wtbuf,1,wtRight,stdout);
        wtRight=0;
    }
};

/**
 * @brief Fast IO
 */
#line 3 "sol.cpp"

#include <boost/multiprecision/cpp_int.hpp>
using fr = boost::multiprecision::cpp_rational;

FastIO io;
int main() {
    auto yes = [&] {
        io.write("Yes");
        exit(0);
    };
    auto no = [&] {
        io.write("No");
        exit(0);
    };

    int n;
    io.read(n);
    vector<ll> a(n), b(n), c(n), d(n);
    io.read(a, b, c, d);

    using P = pair<fr, fr>;
    vector<int> ord1(n), ord2(n);
    iota(ALL(ord1), 0);
    iota(ALL(ord2), 0);
    sort(ALL(ord1),
         [&](int i, int j) { return fr(b[i], a[i]) < fr(b[j], a[j]); });
    sort(ALL(ord2),
         [&](int i, int j) { return fr(d[i], c[i]) < fr(d[j], c[j]); });

    vector<P> L({{fr(0), fr(0)}}), U = L;
    for (auto &i : ord1) {
        fr x = L.back().first + fr(a[i]);
        fr y = L.back().second + fr(b[i]);
        L.push_back({x, y});
    }
    for (auto &i : ord2) {
        fr x = U.back().first + fr(c[i]);
        fr y = U.back().second + fr(d[i]);
        U.push_back({x, y});
    }

    rep(i, 0, SZ(U)) {
        rep(j, 0, SZ(L) - 1) {
            P pq = {L[j + 1].first - L[j].first, L[j + 1].second - L[j].second};
            P pr = {U[i].first - L[j].first, U[i].second - L[j].second};
            if (pq.first * pr.second - pq.second * pr.first < fr(0))
                no();
        }
    }

    if (ord1 == ord2)
        yes();

    cerr << "CP3" << '\n';
    fr x, y;
    rep(i, 0, n - 1) {
        auto [xi2, yi2] = L[i + 2];
        fr direct = (yi2 - y) / (xi2 - x);
        fr mx;
        rep(i, 0, SZ(U)) {
            if (x < U[i].first and U[i].first < xi2) {
            	fr slope=(U[i].second - y) / (U[i].first - x);
            	if(mx==0 or mx>slope)mx=slope;
            }
        }
        if (mx == fr(0) or direct <= mx)
            yes();

        // pass
        auto [xi1, yi1] = L[i + 1];
        fr nslope = (yi2 - yi1) / (xi2 - xi1);
        if (mx == nslope) {
            x = xi1, y = yi1;
            continue;
        }
        fr nx = (mx * x - nslope * xi1 - y + yi1) / (mx - nslope);
        fr ny = mx * (nx - x) + y;
        x = nx, y = ny;
        cerr << i << '\n';
    }
    no();
    return 0;
}

yukicoder

結果

テストケース

ソースコード