結果
問題 | No.1640 簡単な色塗り |
ユーザー | mai |
提出日時 | 2021-08-06 22:43:21 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,578 bytes |
コンパイル時間 | 3,036 ms |
コンパイル使用メモリ | 169,344 KB |
実行使用メモリ | 29,692 KB |
最終ジャッジ日時 | 2024-06-29 15:46:26 |
合計ジャッジ時間 | 15,555 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 81 ms
21,392 KB |
testcase_05 | AC | 90 ms
29,692 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 13 ms
6,400 KB |
testcase_31 | AC | 141 ms
24,408 KB |
testcase_32 | AC | 121 ms
22,380 KB |
testcase_33 | AC | 85 ms
16,732 KB |
testcase_34 | AC | 108 ms
21,540 KB |
testcase_35 | AC | 62 ms
14,548 KB |
testcase_36 | AC | 14 ms
6,656 KB |
testcase_37 | AC | 20 ms
8,148 KB |
testcase_38 | AC | 120 ms
21,380 KB |
testcase_39 | AC | 45 ms
11,608 KB |
testcase_40 | AC | 53 ms
11,652 KB |
testcase_41 | AC | 129 ms
19,464 KB |
testcase_42 | AC | 43 ms
11,884 KB |
testcase_43 | AC | 49 ms
13,488 KB |
testcase_44 | AC | 51 ms
13,444 KB |
testcase_45 | AC | 35 ms
11,284 KB |
testcase_46 | AC | 20 ms
7,040 KB |
testcase_47 | AC | 9 ms
5,888 KB |
testcase_48 | AC | 145 ms
25,040 KB |
testcase_49 | AC | 5 ms
5,376 KB |
testcase_50 | AC | 2 ms
5,376 KB |
testcase_51 | AC | 2 ms
5,376 KB |
testcase_52 | AC | 256 ms
28,348 KB |
testcase_53 | WA | - |
07_evil_01.txt | RE | - |
07_evil_02.txt | RE | - |
コンパイルメッセージ
main.cpp:146:13: warning: unqualified call to 'std::move' [-Wunqualified-std-cast-call] 146 | edges = move(es); | ^ | std:: 1 warning generated.
ソースコード
#pragma GCC optimize ("O3") #include <bits/stdc++.h> using namespace std; using ll = long long int; #define all(v) (v).begin(),(v).end() #define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt)) #define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt)) #define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt)) #define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt)) const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L; template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; } template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); } template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); } void bye(string s, int code = 0) { cout << s << endl; exit(code); } mt19937_64 randdev(8901016); template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr> inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); } template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr> inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }template<typename T> static ostream& operator<<(ostream& o, const std::vector<T>& v) { o << "[ "; for(const auto& e : v) o<<e<<' '; return o << ']'; } template <typename I> struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} }; template<typename I> static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) { o << "[ "; iterate(i,f.b,f.e) o<<*i<<' '; return o << ']'; } template <typename I> struct MyMatrixFormat{ const I& p; long long n, m; MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){} }; template<typename I> static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) { o<<'\n'; repeat(i,(f.n)) { repeat(j,f.m) o<<f.p[i][j]<<' '; o<<'\n'; } return o; } struct LOG_t { ~LOG_t() { cout << endl; } }; #define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ") #define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w)) #define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e)) #define FMTV(v) FMTR(v.begin(),v.end()) #define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w)) #if defined(_WIN32) || defined(_WIN64) #define getc_x _getc_nolock #define putc_x _putc_nolock #elif defined(__GNUC__) #define getc_x getc_unlocked #define putc_x putc_unlocked #else #define getc_x getc #define putc_x putc #endif class MaiScanner { FILE* fp_; constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); } public: inline MaiScanner(FILE* fp):fp_(fp){} template<typename T> void input_integer(T& var) noexcept { var = 0; T sign = 1; int cc = getc_x(fp_); for (; cc < '0' || '9' < cc; cc = getc_x(fp_)) if (cc == '-') sign = -1; for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_)) var = (var << 3) + (var << 1) + cc - '0'; var = var * sign; } inline int c() noexcept { return getc_x(fp_); } template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr> inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getc_x(fp_); for (; !isvisiblechar(cc); cc = getc_x(fp_)); for (; isvisiblechar(cc); cc = getc_x(fp_)) var.push_back(cc); return *this; } template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; class MaiPrinter { FILE* fp_; public: inline MaiPrinter(FILE* fp):fp_(fp){} template<typename T> void output_integer(T var) noexcept { if (var == 0) { putc_x('0', fp_); return; } if (var < 0) putc_x('-', fp_), var = -var; char stack[32]; int stack_p = 0; while (var) stack[stack_p++] = '0' + (var % 10), var /= 10; while (stack_p) putc_x(stack[--stack_p], fp_); } inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; } template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr> inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; } inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; } inline MaiPrinter& operator<<(const string& str) { const char* p = str.c_str(); const char* l = p + str.size(); while (p < l) putc_x(*p++, fp_); return *this; } template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; } }; MaiScanner scanner(stdin); MaiPrinter printer(stdout); class GraphE { public: using W_T = int; struct Edge { int u, v; W_T value; Edge(int from = 0, int to = 0, W_T value = 0) : u(from), v(to), value(value) {} inline int to(int _v) const { return _v == v ? u : v; } }; size_t n; vector<vector<int>> vertex_to; vector<Edge> edges; explicit GraphE(int n = 1) : n(n), vertex_to(n) {} inline size_t size() const noexcept { return n; } void resize(size_t _n) { vertex_to.resize(n = _n); } void connect(int from, int to, W_T val = 0) { vertex_to[(size_t)from].push_back((int)edges.size()); vertex_to[(size_t)to].push_back((int)edges.size()); edges.emplace_back(from, to, val); } void connect(vector<Edge>&& es) { edges = move(es); for (int i = 0; (size_t)i < edges.size(); ++i) { vertex_to[edges[i].u].push_back(i); vertex_to[edges[i].v].push_back(i); } } }; // int N; GraphE graph; // map<pair<int, int>, vector<pair<int, int>>> edges; // [(u,v)] = [](index, select) bool painted[100010]; // unused void update(int u, int v, int p){ // LOG << u << "<->" << v <<" : " << p; if (u > v) swap(u, v); for (auto& vv : edges[make_pair(u,v)]) { if (vv.second == -1) { vv.second = p; break; } } painted[p] = true; } bool vis1[100010]; int dfs(int i, vector<int>& g){ int a = 0; g.push_back(i); vis1[i] = true; for (auto ei : graph.vertex_to[i]) { auto to = graph.edges[ei].to(i); if (vis1[to]) continue; a += dfs(to, g); } return a + 1; } bool vis2[100010]; void paint(int i) { vis2[i] = true; for (auto ei : graph.vertex_to[i]) { auto& e = graph.edges[ei]; auto to = e.to(i); if (!e.value) { e.value = true; if (!painted[i]) { update(i, to, i); } else if (!painted[to]) { update(i, to, to); } paint(to); } } return; } int main() { scanner >> N; graph.resize(N); repeat(i, N) { int a, b; scanner >> a >> b; --a; --b; if (a > b) swap(a, b); graph.connect(a, b); edges[make_pair(a,b)].push_back(make_pair(i, -1)); } repeat(i, N) { if (vis1[i]) continue; vector<int> group; int n = dfs(i, group); int m = 0; int start = i; for (auto v : group) { int s = graph.vertex_to[v].size(); m += s; if (s == 1) start = v; } m /= 2; if (n != m) { bye("No"); } paint(start); } vector<int> sel(N); for (auto& kv : edges) { for (auto p : kv.second) { sel[p.first] = p.second + 1; } } printer << "Yes\n"; printer.join(all(sel), '\n'); return 0; }