結果
問題 | No.1640 簡単な色塗り |
ユーザー | keijak |
提出日時 | 2021-08-07 19:23:39 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,825 ms / 2,000 ms |
コード長 | 3,384 bytes |
コンパイル時間 | 2,544 ms |
コンパイル使用メモリ | 222,088 KB |
実行使用メモリ | 59,324 KB |
最終ジャッジ日時 | 2023-09-12 03:56:53 |
合計ジャッジ時間 | 30,722 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 2 ms
4,384 KB |
testcase_04 | AC | 117 ms
33,528 KB |
testcase_05 | AC | 158 ms
43,732 KB |
testcase_06 | AC | 2 ms
4,384 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,384 KB |
testcase_09 | AC | 2 ms
4,384 KB |
testcase_10 | AC | 186 ms
28,316 KB |
testcase_11 | AC | 152 ms
23,424 KB |
testcase_12 | AC | 130 ms
22,144 KB |
testcase_13 | AC | 347 ms
40,716 KB |
testcase_14 | AC | 340 ms
40,628 KB |
testcase_15 | AC | 84 ms
15,404 KB |
testcase_16 | AC | 106 ms
20,104 KB |
testcase_17 | AC | 271 ms
37,300 KB |
testcase_18 | AC | 15 ms
6,012 KB |
testcase_19 | AC | 125 ms
22,072 KB |
testcase_20 | AC | 176 ms
26,496 KB |
testcase_21 | AC | 158 ms
23,408 KB |
testcase_22 | AC | 10 ms
5,228 KB |
testcase_23 | AC | 202 ms
27,940 KB |
testcase_24 | AC | 42 ms
10,828 KB |
testcase_25 | AC | 133 ms
22,064 KB |
testcase_26 | AC | 260 ms
35,340 KB |
testcase_27 | AC | 82 ms
14,788 KB |
testcase_28 | AC | 337 ms
40,688 KB |
testcase_29 | AC | 255 ms
35,124 KB |
testcase_30 | AC | 54 ms
8,904 KB |
testcase_31 | AC | 1,528 ms
46,464 KB |
testcase_32 | AC | 1,143 ms
36,556 KB |
testcase_33 | AC | 536 ms
25,532 KB |
testcase_34 | AC | 697 ms
31,156 KB |
testcase_35 | AC | 435 ms
27,568 KB |
testcase_36 | AC | 58 ms
8,604 KB |
testcase_37 | AC | 92 ms
11,372 KB |
testcase_38 | AC | 1,455 ms
39,320 KB |
testcase_39 | AC | 230 ms
17,792 KB |
testcase_40 | AC | 250 ms
18,240 KB |
testcase_41 | AC | 737 ms
33,016 KB |
testcase_42 | AC | 324 ms
21,880 KB |
testcase_43 | AC | 321 ms
24,256 KB |
testcase_44 | AC | 309 ms
22,544 KB |
testcase_45 | AC | 194 ms
18,656 KB |
testcase_46 | AC | 67 ms
10,088 KB |
testcase_47 | AC | 34 ms
7,324 KB |
testcase_48 | AC | 1,179 ms
38,320 KB |
testcase_49 | AC | 12 ms
5,064 KB |
testcase_50 | AC | 2 ms
4,380 KB |
testcase_51 | AC | 2 ms
4,380 KB |
testcase_52 | AC | 1,448 ms
51,728 KB |
testcase_53 | AC | 1,825 ms
59,324 KB |
07_evil_01.txt | AC | 1,254 ms
87,844 KB |
07_evil_02.txt | TLE | - |
ソースコード
#include <bits/stdc++.h> #include <atcoder/maxflow> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template <typename T> inline int ssize(const T &a) { return (int)std::size(a); } template <typename T> std::istream &operator>>(std::istream &is, std::vector<T> &a) { for (auto &x : a) is >> x; return is; } template <typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) { return os << "(" << a.first << ", " << a.second << ")"; } template <typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template <typename T, typename = void> struct is_iterable : std::false_type {}; template <typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type {}; template <typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string_view>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } void print() { std::cout << "\n"; } template <class T> void print(const T &x) { std::cout << x << "\n"; } template <typename Head, typename... Tail> void print(const Head &head, Tail... tail) { std::cout << head << " "; print(tail...); } void read_from_cin() {} template <typename T, typename... Ts> void read_from_cin(T &value, Ts &...args) { std::cin >> value; read_from_cin(args...); } #define INPUT(type, ...) \ type __VA_ARGS__; \ read_from_cin(__VA_ARGS__) #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; auto solve() -> optional<vector<int>> { INPUT(int, n); atcoder::mf_graph<int> g(n + n + 2); int kSource = 2 * n; int kSink = 2 * n + 1; REP(i, n) { g.add_edge(kSource, i, 1); g.add_edge(n + i, kSink, 1); } set<pair<int, int>> es; REP(i, n) { INPUT(int, a, b); --a, --b; es.emplace(i, n + a); es.emplace(i, n + b); } for (auto [x, y] : es) { g.add_edge(x, y, 1); } auto mf = g.flow(kSource, kSink, n); DUMP(mf); if (mf != n) return nullopt; vector<int> ans(n); for (const auto &e : g.edges()) { if (e.from == kSource or e.to == kSink) continue; if (e.flow != 1) continue; int i = e.from; int j = e.to - n + 1; ans[i] = j; } return ans; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); auto ans = solve(); if (not ans) { print("No"); } else { print("Yes"); print_seq(ans.value(), "\n"); } }