結果

問題 No.629 グラフの中に眠る門松列
ユーザー maimai
提出日時 2017-05-05 15:28:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 4 ms / 4,000 ms
コード長 4,896 bytes
コンパイル時間 2,864 ms
コンパイル使用メモリ 205,848 KB
実行使用メモリ 4,372 KB
最終ジャッジ日時 2023-10-12 19:14:48
合計ジャッジ時間 3,780 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,352 KB
testcase_01 AC 1 ms
4,348 KB
testcase_02 AC 2 ms
4,352 KB
testcase_03 AC 2 ms
4,352 KB
testcase_04 AC 1 ms
4,352 KB
testcase_05 AC 1 ms
4,356 KB
testcase_06 AC 1 ms
4,352 KB
testcase_07 AC 2 ms
4,356 KB
testcase_08 AC 2 ms
4,348 KB
testcase_09 AC 1 ms
4,348 KB
testcase_10 AC 2 ms
4,372 KB
testcase_11 AC 1 ms
4,352 KB
testcase_12 AC 2 ms
4,348 KB
testcase_13 AC 1 ms
4,356 KB
testcase_14 AC 2 ms
4,348 KB
testcase_15 AC 1 ms
4,352 KB
testcase_16 AC 1 ms
4,352 KB
testcase_17 AC 2 ms
4,348 KB
testcase_18 AC 1 ms
4,356 KB
testcase_19 AC 1 ms
4,348 KB
testcase_20 AC 2 ms
4,348 KB
testcase_21 AC 4 ms
4,348 KB
testcase_22 AC 2 ms
4,348 KB
testcase_23 AC 3 ms
4,348 KB
testcase_24 AC 3 ms
4,352 KB
testcase_25 AC 4 ms
4,352 KB
testcase_26 AC 4 ms
4,356 KB
testcase_27 AC 4 ms
4,352 KB
testcase_28 AC 2 ms
4,348 KB
testcase_29 AC 3 ms
4,356 KB
testcase_30 AC 4 ms
4,348 KB
testcase_31 AC 4 ms
4,356 KB
testcase_32 AC 4 ms
4,352 KB
testcase_33 AC 4 ms
4,352 KB
testcase_34 AC 3 ms
4,352 KB
testcase_35 AC 3 ms
4,352 KB
testcase_36 AC 4 ms
4,352 KB
testcase_37 AC 3 ms
4,356 KB
testcase_38 AC 3 ms
4,348 KB
testcase_39 AC 3 ms
4,352 KB
testcase_40 AC 2 ms
4,352 KB
testcase_41 AC 2 ms
4,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"

#ifdef WINT_MIN
#define __MAI
#endif

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define upto(l,r) for(auto cnt=l;cnt<=r;++cnt)
#define downto(r,l) for(auti cnt=r;cnt>=l;--cnt)
#define BIGINT 0x7FFFFFFF
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0<u; u >>= 1, k++)s = (s << 1) | (u & 1); for (; 0<k--; s >>= 1)cout << (s & 1); } }template<typename T1, typename T2>
    ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

namespace {
    std::chrono::system_clock::time_point t;
    void tic() { t = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); }
    std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
}

#ifndef __MAI 
namespace {
    class MaiScanner {
    public:
        template<typename T>
        void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        void ign() { getchar_unlocked(); }
        MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
    };
}
MaiScanner scanner;
#else
#define scanner cin
#endif

inline bool kadomatu(int a, int b, int c) {
    return a != b&&b != c&&c != a && ((a<b && c<b) || (a>b && c>b));
}

class UndirectedGraphE {
public:
    size_t n;
    struct Edge {
        int u, v;
        Edge(int from = 0, int to = 0) :u(from), v(to) {}

        int to(int _v) { return _v == v ? u : v; }
    };
    vector<vector<int>> vertex_to;
    vector<Edge> edge;

    UndirectedGraphE(int n, int m = 5010) :n(n), vertex_to(n) { edge.reserve(m); }

    void connect(int from, int to) {
        vertex_to[from].push_back(edge.size()); // toto
        vertex_to[to].push_back(edge.size()); // fromfrom
        edge.emplace_back(from, to);
    }
    size_t degree(int v) {
        return vertex_to[v].size();
    }
    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
    }
};

int vertices[1010];

int width, height;
int m, n, kei;

void yes() {
    cout << "YES" << endl;
    exit(0);
}


int main() {
    int i, j, k;
    int x, y, z, a, b;

    scanner >> n >> m;

    UndirectedGraphE graph(n);

    repeat(n) {
        scanner >> vertices[cnt];
    }

    repeat(m) {
        scanner >> a >> b;
        --a; --b;
        graph.connect(a, b);
    }

    repeat(n) {
        const vector<int>& edges = graph.vertex_to[cnt];
        int size = edges.size();

        for (int i = 0; i < (size - 1); ++i) {
            auto e1 = graph.edge[edges[i]];
            for (int j = i + 1; j < size; ++j) {
                auto e2 = graph.edge[edges[j]];

                if (e1.u == e2.u) {
                    if (kadomatu(vertices[e1.v], vertices[e1.u], vertices[e2.v]))
                        yes();
                }
                else if (e1.u == e2.v) {
                    if (kadomatu(vertices[e1.v], vertices[e1.u], vertices[e2.u]))
                        yes();
                }
                else if (e1.v == e2.u) {
                    if (kadomatu(vertices[e1.u], vertices[e1.v], vertices[e2.v]))
                        yes();
                }
                else if (e1.v == e2.v) {
                    if (kadomatu(vertices[e1.u], vertices[e1.v], vertices[e2.u]))
                        yes();
                }
                
            }
        }
    }
    cout << "NO" << endl;


    return 0;
}
0