結果

問題 No.1640 簡単な色塗り
ユーザー 👑 tute7627tute7627
提出日時 2021-08-06 21:40:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 110 ms / 2,000 ms
コード長 9,348 bytes
コンパイル時間 2,846 ms
コンパイル使用メモリ 225,436 KB
実行使用メモリ 30,732 KB
最終ジャッジ日時 2024-06-29 14:51:10
合計ジャッジ時間 12,883 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 52 ms
18,792 KB
testcase_05 AC 57 ms
30,732 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 1 ms
5,376 KB
testcase_10 AC 40 ms
10,624 KB
testcase_11 AC 31 ms
9,344 KB
testcase_12 AC 30 ms
8,832 KB
testcase_13 AC 66 ms
14,592 KB
testcase_14 AC 68 ms
14,336 KB
testcase_15 AC 22 ms
7,296 KB
testcase_16 AC 27 ms
8,064 KB
testcase_17 AC 53 ms
12,544 KB
testcase_18 AC 5 ms
5,376 KB
testcase_19 AC 31 ms
8,576 KB
testcase_20 AC 40 ms
10,240 KB
testcase_21 AC 32 ms
8,960 KB
testcase_22 AC 5 ms
5,376 KB
testcase_23 AC 43 ms
11,008 KB
testcase_24 AC 12 ms
5,376 KB
testcase_25 AC 32 ms
8,704 KB
testcase_26 AC 54 ms
11,776 KB
testcase_27 AC 22 ms
7,040 KB
testcase_28 AC 67 ms
14,080 KB
testcase_29 AC 46 ms
11,776 KB
testcase_30 AC 9 ms
5,632 KB
testcase_31 AC 77 ms
22,656 KB
testcase_32 AC 56 ms
19,456 KB
testcase_33 AC 36 ms
15,104 KB
testcase_34 AC 54 ms
21,760 KB
testcase_35 AC 37 ms
16,128 KB
testcase_36 AC 10 ms
6,144 KB
testcase_37 AC 14 ms
8,064 KB
testcase_38 AC 69 ms
18,816 KB
testcase_39 AC 27 ms
10,624 KB
testcase_40 AC 23 ms
9,856 KB
testcase_41 AC 46 ms
16,384 KB
testcase_42 AC 28 ms
10,112 KB
testcase_43 AC 32 ms
12,288 KB
testcase_44 AC 28 ms
12,160 KB
testcase_45 AC 23 ms
11,008 KB
testcase_46 AC 11 ms
6,944 KB
testcase_47 AC 8 ms
5,760 KB
testcase_48 AC 65 ms
23,424 KB
testcase_49 AC 4 ms
5,376 KB
testcase_50 AC 2 ms
5,376 KB
testcase_51 AC 2 ms
5,376 KB
testcase_52 AC 107 ms
30,308 KB
testcase_53 AC 110 ms
25,088 KB
07_evil_01.txt AC 238 ms
28,504 KB
07_evil_02.txt AC 380 ms
40,968 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
  return ord;
}
ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
  Graph<T>ret(g.size());
  for(int i=0;i<g.size();i++){
    for(auto e:g[i]){
      int to = e.to;
      e.to = i;
      ret[to].push_back(e);
    }
  }
  return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v;
    T w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}
template<typename T>
struct Namori{
  const Graph<T>&g;
  int n;
  int edge_num=0;
  bool directed_forest = false;
  Namori(const Graph<T>&g, bool directed):g(g),n(g.size()){
    directed_forest = directed;
    int edge_num=0;
    for(auto &v:g)edge_num+=v.size();
    build();
  }
  vector<vector<int>>cycle;//連結成分の根となるサイクル サイクルではない場合も
  vector<int>vn,en;//連結成分の頂点数、辺数
  Graph<T>forest;
  vector<int>root;
  vector<int>cycle_number;//頂点が属するサイクル番号 サイクルに属さなければ-1
  void build(){
    dfs_used.assign(n,false);
    dfs_now.assign(n,false);
    dfs_ver.clear();
    root.assign(n,-1);
    for(int i=0;i<n;i++){
      if(dfs_used[i])continue;
      cycle.emplace_back();
      vn.push_back(0);
      en.push_back(0);
      build_dfs(i,-1,cycle.back());
      if(cycle.back().empty()){
        cycle.back().push_back(i);
      }
    }
    forest.resize(n);
    cycle_number.assign(n,-1);
    for(int i=0;i<cycle.size();i++){
      for(auto v:cycle[i])cycle_number[v]=i;
    }
    dfs_used.assign(n,false);
    for(int i=0;i<n;i++){
      if(cycle_number[i]!=-1)tree_dfs(i,vn[cycle_number[i]],en[cycle_number[i]],i);
    }
    for(int i=0;i<cycle.size();i++)en[i]>>=1;
  }
  void tree_dfs(int pos,int &vn,int &en,int r){
    vn++;
    dfs_used[pos]=true;
    root[pos]=r;
    for(auto e:g[pos]){
      en++;
      if(pos!=r&&dfs_used[e.to]&&!directed_forest)forest[pos].push_back(e);
      if(dfs_used[e.to]||cycle_number[e.to]!=-1)continue;
      forest[pos].push_back(e);
      tree_dfs(e.to,vn,en,r);
    }
  }
  vector<bool>dfs_used;
  vector<int>dfs_ver;
  vector<bool>dfs_now;
  void build_dfs(int pos, int par,vector<int>&cycle){
    dfs_used[pos]=true;
    dfs_now[pos]=true;
    dfs_ver.push_back(pos);
    bool multiple_par=false;
    for(auto to:g[pos]){
      if(dfs_now[to]&&cycle.empty()&&(to!=par||multiple_par)){
        for(auto v:dfs_ver){
          if(!cycle.empty()||v==to)cycle.push_back(v);
        }
      }
      if(to==par)multiple_par=true;
      if(dfs_used[to])continue;
      build_dfs(to,pos,cycle);
    }
    dfs_now[pos]=false;
    dfs_ver.pop_back();
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  auto g=readGraph<int>(n,n);
  Namori namori(g,true);
  rep(i,0,namori.en.size()){
    if(namori.en[i]!=namori.vn[i]){
      cout<<"No"<<endl;
      return 0;
    }
  }
  cout<<"Yes"<<endl;
  vector<ll>ret(n,-1);
  rep(i,0,n){
    for(auto e:namori.forest[i]){
      if(namori.cycle_number[e.to]==-1)ret[e.id]=e.to+1;
    }
  }
  vector<bool>used(n);
  for(auto &c:namori.cycle){
    rep(i,0,c.size()){
      for(auto e:g[c[i]]){
        if(!used[e.id]&&ret[e.id]==-1&&e.to==c[(i+1)%c.size()]){
          ret[e.id]=e.to+1;
          used[e.id]=true;
          break;
        }
      }
    }
  }
  rep(i,0,n)cout<<ret[i]<<endl;
  return 0;
}
0