結果
問題 | No.1640 簡単な色塗り |
ユーザー | kiyoshi0205 |
提出日時 | 2021-08-06 22:23:29 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 108 ms / 2,000 ms |
コード長 | 3,881 bytes |
コンパイル時間 | 2,907 ms |
コンパイル使用メモリ | 193,828 KB |
実行使用メモリ | 19,656 KB |
最終ジャッジ日時 | 2023-09-12 02:23:44 |
合計ジャッジ時間 | 13,915 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 42 ms
15,320 KB |
testcase_05 | AC | 48 ms
19,584 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 53 ms
12,792 KB |
testcase_11 | AC | 40 ms
10,916 KB |
testcase_12 | AC | 33 ms
10,168 KB |
testcase_13 | AC | 100 ms
17,900 KB |
testcase_14 | AC | 108 ms
17,884 KB |
testcase_15 | AC | 28 ms
7,988 KB |
testcase_16 | AC | 34 ms
9,324 KB |
testcase_17 | AC | 84 ms
15,428 KB |
testcase_18 | AC | 6 ms
4,376 KB |
testcase_19 | AC | 39 ms
10,324 KB |
testcase_20 | AC | 53 ms
12,560 KB |
testcase_21 | AC | 38 ms
10,840 KB |
testcase_22 | AC | 4 ms
4,384 KB |
testcase_23 | AC | 63 ms
13,544 KB |
testcase_24 | AC | 13 ms
5,964 KB |
testcase_25 | AC | 37 ms
10,260 KB |
testcase_26 | AC | 69 ms
14,184 KB |
testcase_27 | AC | 25 ms
8,116 KB |
testcase_28 | AC | 101 ms
16,944 KB |
testcase_29 | AC | 81 ms
14,076 KB |
testcase_30 | AC | 11 ms
5,420 KB |
testcase_31 | AC | 87 ms
19,112 KB |
testcase_32 | AC | 76 ms
16,960 KB |
testcase_33 | AC | 46 ms
12,500 KB |
testcase_34 | AC | 66 ms
14,804 KB |
testcase_35 | AC | 45 ms
12,736 KB |
testcase_36 | AC | 10 ms
5,408 KB |
testcase_37 | AC | 14 ms
6,464 KB |
testcase_38 | AC | 85 ms
17,444 KB |
testcase_39 | AC | 26 ms
9,400 KB |
testcase_40 | AC | 30 ms
9,324 KB |
testcase_41 | AC | 63 ms
15,112 KB |
testcase_42 | AC | 33 ms
10,368 KB |
testcase_43 | AC | 38 ms
10,632 KB |
testcase_44 | AC | 34 ms
10,416 KB |
testcase_45 | AC | 24 ms
8,608 KB |
testcase_46 | AC | 10 ms
5,676 KB |
testcase_47 | AC | 7 ms
4,872 KB |
testcase_48 | AC | 88 ms
18,000 KB |
testcase_49 | AC | 4 ms
4,376 KB |
testcase_50 | AC | 2 ms
4,380 KB |
testcase_51 | AC | 1 ms
4,380 KB |
testcase_52 | AC | 98 ms
19,656 KB |
testcase_53 | AC | 95 ms
19,532 KB |
07_evil_01.txt | AC | 302 ms
36,100 KB |
07_evil_02.txt | AC | 492 ms
52,772 KB |
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; using datas=pair<ll,ll>; using ddatas=pair<long double,long double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end()) #define endl "\n" #define popcount __builtin_popcountll #define eb emplace_back #define print(x) cout<<x<<endl #define printyes print("Yes") #define printno print("No") #define printYES print("YES") #define printNO print("NO") #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) constexpr ll mod=1000000007; // constexpr ll mod=998244353; constexpr ll inf=1LL<<60; constexpr long double eps=1e-9; const long double PI=acosl(-1); template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";} template<class T> ostream& operator<<(ostream& os,const vector<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const set<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;} #ifdef DEBUG void debugg(){cout<<endl;} template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);} #define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__) #else #define debug(...) (void(0)) #endif inline void startupcpp(void) noexcept{ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(15); } int main(){ startupcpp(); int i,j=0,a,b,N; cin>>N; vec ab(N,0),ans(N,0),vis(N,0); vector<set<int>> edgelist(N); rep(i,N){ cin>>a>>b; edgelist[--a].emplace(i); edgelist[--b].emplace(i); ab[i]=a^b; } queue<int> que; rep(i,N){ if(edgelist[i].size()==1)que.emplace(i); } do{ while(!que.empty()){ a=que.front();que.pop(); debug(a,edgelist[a]); if(edgelist[a].size()==0){ printno; return 0; } i=*edgelist[a].begin(); edgelist[a].erase(edgelist[a].begin()); vis[a]=1; ans[i]=a+1; b=ab[i]^a; edgelist[b].erase(i); if(edgelist[b].size()==1)que.emplace(b); } while(j<N&&vis[j])++j; if(j<N)que.emplace(j); else{ printyes; rep(i,N)print(ans[i]); return 0; } debug(ans); }while(1); }