結果

問題 No.1640 簡単な色塗り
ユーザー rniyarniya
提出日時 2021-08-06 22:12:16
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 192 ms / 2,000 ms
コード長 6,402 bytes
コンパイル時間 2,681 ms
コンパイル使用メモリ 215,064 KB
実行使用メモリ 23,016 KB
最終ジャッジ日時 2023-09-12 02:10:05
合計ジャッジ時間 14,842 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 63 ms
18,872 KB
testcase_05 AC 79 ms
23,016 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 102 ms
14,868 KB
testcase_11 AC 78 ms
12,864 KB
testcase_12 AC 67 ms
11,664 KB
testcase_13 AC 182 ms
20,932 KB
testcase_14 AC 178 ms
20,840 KB
testcase_15 AC 51 ms
9,324 KB
testcase_16 AC 57 ms
10,764 KB
testcase_17 AC 141 ms
17,728 KB
testcase_18 AC 9 ms
4,428 KB
testcase_19 AC 67 ms
11,484 KB
testcase_20 AC 105 ms
14,392 KB
testcase_21 AC 73 ms
12,444 KB
testcase_22 AC 6 ms
4,376 KB
testcase_23 AC 117 ms
15,388 KB
testcase_24 AC 23 ms
6,580 KB
testcase_25 AC 69 ms
11,764 KB
testcase_26 AC 127 ms
16,464 KB
testcase_27 AC 45 ms
8,864 KB
testcase_28 AC 188 ms
20,072 KB
testcase_29 AC 130 ms
16,688 KB
testcase_30 AC 10 ms
5,700 KB
testcase_31 AC 79 ms
20,584 KB
testcase_32 AC 81 ms
18,764 KB
testcase_33 AC 53 ms
14,196 KB
testcase_34 AC 56 ms
16,112 KB
testcase_35 AC 33 ms
11,976 KB
testcase_36 AC 10 ms
5,628 KB
testcase_37 AC 14 ms
6,548 KB
testcase_38 AC 67 ms
18,240 KB
testcase_39 AC 27 ms
10,040 KB
testcase_40 AC 22 ms
9,220 KB
testcase_41 AC 54 ms
15,848 KB
testcase_42 AC 37 ms
11,792 KB
testcase_43 AC 30 ms
10,940 KB
testcase_44 AC 37 ms
11,604 KB
testcase_45 AC 22 ms
8,944 KB
testcase_46 AC 12 ms
6,004 KB
testcase_47 AC 8 ms
4,928 KB
testcase_48 AC 70 ms
17,736 KB
testcase_49 AC 5 ms
4,380 KB
testcase_50 AC 2 ms
4,380 KB
testcase_51 AC 2 ms
4,376 KB
testcase_52 AC 192 ms
22,988 KB
testcase_53 AC 185 ms
23,008 KB
07_evil_01.txt AC 511 ms
43,156 KB
07_evil_02.txt AC 825 ms
63,540 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    return os << '}';
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; i++) cin >> A[i] >> B[i], A[i]--, B[i]--;

    vector<set<int>> deg(N);
    for (int i = 0; i < N; i++) {
        deg[A[i]].emplace(i);
        deg[B[i]].emplace(i);
    }

    vector<int> ans(N, -1);
    vector<bool> ok(N, false);
    set<int> unused;
    queue<int> que;
    for (int i = 0; i < N; i++) {
        int sz = deg[i].size();
        unused.emplace(i);
        if (sz == 0) {
            cout << "No" << '\n';
            return 0;
        }
        if (sz == 1) que.emplace(i);
    }

    auto det = [&](int e, int x) {
        debug(e, x, unused);
        assert(unused.count(e));
        assert(A[e] == x || B[e] == x);
        ans[e] = x;
        int other = A[e] + B[e] - x;
        deg[other].erase(e);
        unused.erase(e);
        ok[x] = true;
        if (ok[other]) return;
        if (deg[other].empty()) {
            cout << "No" << '\n';
            exit(0);
        }
        if (deg[other].size() == 1) que.emplace(other);
    };

    while (!unused.empty()) {
        while (!que.empty()) {
            int v = que.front();
            que.pop();
            debug(v);
            int nxt = *deg[v].begin();
            det(nxt, v);
        }
        if (unused.empty()) break;
        {
            int nxt = *unused.begin();
            if (!ok[A[nxt]])
                det(nxt, A[nxt]);
            else if (!ok[B[nxt]])
                det(nxt, B[nxt]);
            else {
                cout << "No" << '\n';
                return 0;
            }
        }
        debug(unused);
    }

    cout << "Yes" << '\n';
    for (int& x : ans) cout << x + 1 << '\n';
    return 0;
}
0