#823091 (C++17) No.2173 Nightcord

提出ソース

結果

問題	No.2173 Nightcord
ユーザー	tko919
提出日時	2022-12-07 05:15:14
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,077 ms / 2,525 ms
コード長	9,593 bytes
コンパイル時間	2,745 ms
コンパイル使用メモリ	224,116 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-04-28 19:23:55
合計ジャッジ時間	16,485 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,812 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	1,075 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	3 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 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,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	89 ms 6,944 KB
testcase_15	AC	15 ms 6,944 KB
testcase_16	AC	3 ms 6,944 KB
testcase_17	AC	3 ms 6,944 KB
testcase_18	AC	3 ms 6,944 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	2 ms 6,944 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,944 KB
testcase_24	AC	2 ms 6,944 KB
testcase_25	AC	3 ms 6,940 KB
testcase_26	AC	2 ms 6,944 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	3 ms 6,944 KB
testcase_29	AC	3 ms 6,944 KB
testcase_30	AC	3 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	529 ms 6,944 KB
testcase_33	AC	992 ms 6,940 KB
testcase_34	AC	1,077 ms 6,940 KB
testcase_35	AC	520 ms 6,944 KB
testcase_36	AC	619 ms 6,940 KB
testcase_37	AC	936 ms 6,944 KB
testcase_38	AC	154 ms 6,944 KB
testcase_39	AC	499 ms 6,944 KB
testcase_40	AC	1,046 ms 6,940 KB
testcase_41	AC	641 ms 6,944 KB
testcase_42	AC	605 ms 6,940 KB
testcase_43	AC	74 ms 6,944 KB
testcase_44	AC	2 ms 6,940 KB
testcase_45	AC	226 ms 6,944 KB
testcase_46	AC	352 ms 6,940 KB
testcase_47	AC	316 ms 6,944 KB
testcase_48	AC	150 ms 6,944 KB
testcase_49	AC	9 ms 6,944 KB
testcase_50	AC	58 ms 6,940 KB
testcase_51	AC	346 ms 6,940 KB
testcase_52	AC	6 ms 6,944 KB
testcase_53	AC	373 ms 6,940 KB
testcase_54	AC	541 ms 6,940 KB
testcase_55	AC	115 ms 6,940 KB
testcase_56	AC	231 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()
using ll=long long int;
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;}
#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;
    }
    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 flush(){
        fwrite(wtbuf,1,wtRight,stdout);
        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;
    }
    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){
        if(space)_write(' ');
        _write(head);
        write<ln,true>(tail...); 
    }
};

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

#line 2 "library/Geometry/intCoord.hpp"
 
struct Point{
    ll X,Y;
    Point():X(0),Y(0){}
    Point(ll _X,ll _Y):X(_X),Y(_Y){}
    int pos()const{
        if(Y<0)return -1;
        if(Y==0 and X>=0)return 0;
        return 1;
    }
    Point& operator+=(const Point& p){
        X+=p.X;
        Y+=p.Y;
        return *this;
    }
    Point& operator-=(const Point& p){
        X-=p.X;
        Y-=p.Y;
        return *this;
    }
    Point& operator*=(const ll& t){
        X*=t,Y*=t;
        return *this;
    }
    Point& operator*=(const Point& p){
        ll NX=X*p.X-Y*p.Y,NY=X*p.Y+Y*p.X;
        X=NX,Y=NY;
        return *this;
    }
    Point operator+(const Point &p) const { return Point(*this) += p; }
    Point operator-(const Point &p) const { return Point(*this) -= p; }
    Point operator*(const ll &p) const { return Point(*this) *= p; }
    Point operator*(const Point &p) const { return Point(*this) *= p; }
    Point operator-() const { return Point(-X, -Y); }
    bool operator==(const Point &p) const { return X == p.X && Y == p.Y; }
    bool operator!=(const Point &p) const { return X != p.X || Y != p.Y; }
    bool operator<(const Point &p) const { return X == p.X ? Y < p.Y : X < p.X; }
};
struct Line{
    Point a,b;
    Line(){}
    Line(Point _a,Point _b):a(_a),b(_b){}
};
struct Segment:Line{
    Segment(){}
    Segment(Point _a,Point _b):Line(_a,_b){}
};
using Poly=vector<Point>;
 
ll dot(const Point &a, const Point &b) { return a.X * b.X + a.Y * b.Y; }
ll cross(const Point &a, const Point &b) { return a.X * b.Y - a.Y * b.X; }
ll norm(const Point& a){return a.X*a.X+a.Y*a.Y;}
bool cmp(const Point& a,const Point& b){
    if(a.pos()!=b.pos())return a.pos()<b.pos();
    return a.Y*b.X<a.X*b.Y;
}
 
int ccw(const Point& a,Point b,Point c){
    b-=a; c-=a;
    ll C=cross(b,c);
    if(C>0)return 1; //ccw
    if(C<0)return -1; //cw
    if(dot(b,c)<0)return 2; //c,a,b
    if(dot(b,b)<dot(c,c))return -2; //a,b,c
    return 0; //a,c,b
}
 
 
bool isOrthogonal(const Line& a,const Line& b){
    return dot(a.b-a.a,b.b-b.a)==0;
}
bool isParallel(const Line& a,const Line& b){
    return cross(a.b-a.a,b.b-b.a)==0;
}
bool isIntersect(const Segment& a,const Segment& b){
    return ccw(a.a,a.b,b.a)*ccw(a.a,a.b,b.b)<=0 and
        ccw(b.a,b.b,a.a)*ccw(b.a,b.b,a.b)<=0;
}
 
int isContained(const Poly& a,const Point& b){
    bool res=0;
    int n=a.size();
    rep(i,0,n){
        Point p=a[i]-b,q=a[(i+1)%n]-b;
        if(p.Y>q.Y)swap(p,q);
        if(p.Y<=0 and q.Y>0 and cross(p,q)>0)res^=1;
        if(cross(p,q)==0 and dot(p,q)<=0)return 1;
    }
    return (res?2:0);
}
Poly ConvexHull(Poly& a){
    int n=a.size(),k=0;
    if(n<=2)return a;
    sort(ALL(a),[](const Point& p,const Point& q){
        return (p.Y==q.Y?p.X<q.X:p.Y<q.Y);
    });
    Poly res(n*2);
    for(int i=0;i<n;res[k++]=a[i++]){
        while(k>=2 and cross(res[k-1]-res[k-2],a[i]-res[k-1])<0)k--;
    }
    for(int i=n-2,t=k+1;i>=0;res[k++]=a[i--]){
        while(k>=t and cross(res[k-1]-res[k-2],a[i]-res[k-1])<0)k--;
    }
    res.resize(k-1); return res;
}
 
/**
 * @brief Geometry(integer Coordinates)
 */
#line 5 "sol.cpp"

const ll base=2010101010LL;

bool solve(int N,int K,vector<int>& x,vector<int>& y,vector<int>& c){
    if(K==2){
        sort(ALL(c));
        if(c.front()==c.back())return false;
        else return true;
    }
    else if(K==3){
        Poly R,B;
        rep(i,0,N){
            if(c[i]==1)R.push_back(Point(x[i],y[i]));
            else B.push_back(Point(x[i],y[i]));
        }
        rep(_,0,2){
            if(B.size()>=2){
                rep(i,0,R.size()){
                    set<ll> done;
                    rep(j,0,B.size()){
                        Point d=B[j]-R[i];
                        int g=gcd(d.X,d.Y);
                        d.X/=g,d.Y/=g;
                        ll key=d.X*base+d.Y;
                        if(done.count(-key)){
                            return true;
                        }
                        done.insert(key);
                    }
                }
            }
            swap(R,B);
        }
        return false;
    }
    else{
        Poly R,B;
        rep(i,0,N){
            if(c[i]==1)R.push_back(Point(x[i],y[i]));
            else B.push_back(Point(x[i],y[i]));
        }
        R=ConvexHull(R),B=ConvexHull(B);
        rep(i,0,R.size())if(isContained(B,R[i])!=0){
            return true;
        }
        rep(i,0,B.size())if(isContained(R,B[i])!=0){
            return true;
        }
        rep(i,0,R.size())rep(j,0,B.size())if(isIntersect(Segment(R[i],R[(i+1)%R.size()]),Segment(B[j],B[(j+1)%B.size()]))){
            return true;
        }
        return false;
    }
}

FastIO io;
int main(){
    int N,K;
    io.read(N,K);
    vector<int> x(N),y(N),c(N);
    rep(i,0,N)io.read(x[i],y[i],c[i]);

    io.write(solve(N,K,x,y,c)?"Yes":"No");
    return 0;
}

yukicoder

結果

テストケース

ソースコード