結果
問題 | No.1640 簡単な色塗り |
ユーザー | suta28407928 |
提出日時 | 2021-08-06 22:01:47 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 131 ms / 2,000 ms |
コード長 | 3,639 bytes |
コンパイル時間 | 2,872 ms |
コンパイル使用メモリ | 191,668 KB |
実行使用メモリ | 19,476 KB |
最終ジャッジ日時 | 2023-09-12 01:58:55 |
合計ジャッジ時間 | 14,330 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 83 ms
13,464 KB |
testcase_05 | AC | 87 ms
19,476 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 66 ms
9,524 KB |
testcase_11 | AC | 54 ms
8,272 KB |
testcase_12 | AC | 45 ms
7,480 KB |
testcase_13 | AC | 108 ms
12,792 KB |
testcase_14 | AC | 109 ms
12,660 KB |
testcase_15 | AC | 32 ms
6,552 KB |
testcase_16 | AC | 40 ms
7,000 KB |
testcase_17 | AC | 88 ms
11,216 KB |
testcase_18 | AC | 8 ms
4,376 KB |
testcase_19 | AC | 43 ms
7,484 KB |
testcase_20 | AC | 63 ms
9,116 KB |
testcase_21 | AC | 48 ms
8,128 KB |
testcase_22 | AC | 5 ms
4,376 KB |
testcase_23 | AC | 67 ms
9,708 KB |
testcase_24 | AC | 18 ms
4,900 KB |
testcase_25 | AC | 47 ms
7,732 KB |
testcase_26 | AC | 71 ms
10,376 KB |
testcase_27 | AC | 30 ms
6,156 KB |
testcase_28 | AC | 99 ms
12,236 KB |
testcase_29 | AC | 76 ms
10,228 KB |
testcase_30 | AC | 14 ms
4,980 KB |
testcase_31 | AC | 118 ms
16,108 KB |
testcase_32 | AC | 104 ms
14,920 KB |
testcase_33 | AC | 61 ms
11,548 KB |
testcase_34 | AC | 80 ms
14,772 KB |
testcase_35 | AC | 66 ms
12,052 KB |
testcase_36 | AC | 15 ms
5,092 KB |
testcase_37 | AC | 20 ms
6,360 KB |
testcase_38 | AC | 105 ms
15,044 KB |
testcase_39 | AC | 40 ms
8,268 KB |
testcase_40 | AC | 45 ms
8,300 KB |
testcase_41 | AC | 82 ms
13,072 KB |
testcase_42 | AC | 45 ms
8,568 KB |
testcase_43 | AC | 47 ms
9,380 KB |
testcase_44 | AC | 46 ms
9,688 KB |
testcase_45 | AC | 35 ms
8,304 KB |
testcase_46 | AC | 15 ms
5,588 KB |
testcase_47 | AC | 10 ms
4,612 KB |
testcase_48 | AC | 110 ms
16,772 KB |
testcase_49 | AC | 5 ms
4,376 KB |
testcase_50 | AC | 1 ms
4,376 KB |
testcase_51 | AC | 1 ms
4,376 KB |
testcase_52 | AC | 131 ms
19,004 KB |
testcase_53 | AC | 130 ms
17,036 KB |
07_evil_01.txt | AC | 282 ms
24,612 KB |
07_evil_02.txt | AC | 443 ms
35,628 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; #define DEBUG #ifdef DEBUG template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << '{'; for(int i = 0; i < (int)v.size(); i++) { if(i) { os << ','; } os << v[i]; } os << '}'; return os; } void debugg() { cerr << endl; } template <class T, class... Args> void debugg(const T &x, const Args &... args) { cerr << " " << x; debugg(args...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = (1<<30)-1; const ll linf = 1LL<<61; const int MAX = 510000; //int dy[8] = {0,1,0,-1,1,-1,-1,1}; //int dx[8] = {-1,0,1,0,1,-1,1,-1}; const double pi = acos(-1); const double eps = 1e-8; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ int sz = a.size(); for(auto itr = a.begin(); itr != a.end(); itr++){ cout << *itr; sz--; if(sz) cout << " "; } cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){ cout << a << " " << b << "\n"; } template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } void mark() {cout << "#" << "\n";} ll pcount(ll x) {return __builtin_popcountll(x);} //const int mod = 1e9 + 7; const int mod = 998244353; int main(){ int n; cin >> n; vector<vpl> G(n); vpl e(n); vl deg(n,0); rep(i,n){ int a,b; cin >> a >> b; a--; b--; G[a].emplace_back(b,i); G[b].emplace_back(a,i); e[i] = {a,b}; } vl ans(n,-1); vb visv(n,false), vise(n,false); vb b(n,false); auto dfs = [&](auto &&dfs, int u, int id) -> void { visv[u] = true; for(auto v : G[u]){ if(vise[v.second]) continue; vise[v.second] = true; if(visv[v.first]){ ans[v.second] = u; b[u] = true; continue; } dfs(dfs,v.first,u); if(b[v.first]){ ans[v.second] = u; b[u] = true; }else{ ans[v.second] = v.first; b[v.first] = true; } } }; rep(i,n){ if(visv[i]) continue; dfs(dfs,i,-1); } rep(i,n){ if(!b[i]){ cout << "No\n"; return 0; } } cout << "Yes\n"; rep(i,n) cout << ans[i]+1 << "\n"; }