test/aoj/2891.test.cpp

• View this file on GitHub
• Last update: 2021-01-03 18:39:08+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2891

Depends on

• graph/cycle.cpp

Code

// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2891
#include <bits/stdc++.h>
using namespace std;

#define call_from_test
#include "../../graph/cycle.cpp"
#undef call_from_test

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n;
  cin>>n;

  UndirectedCycle G(n);
  for(int i=0;i<n;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    G.add_edge(u,v);
  }

  auto vs=G.build();
  unordered_set<int> namori(vs.begin(),vs.end());

  int q;
  cin>>q;
  for(int i=0;i<q;i++){
    int a,b;
    cin>>a>>b;
    a--;b--;
    cout<<1+(namori.count(a) and namori.count(b))<<'\n';
  }
  return 0;
}

#line 1 "test/aoj/2891.test.cpp"
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2891
#include <bits/stdc++.h>
using namespace std;

#define call_from_test
#line 1 "graph/cycle.cpp"

#line 3 "graph/cycle.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
template<bool directed>
struct Cycle{
  vector<int> used;
  vector<vector<int>> G;
  Cycle(int n_):used(n_,0),G(n_){}

  void add_edge(int u,int v){
    G[u].emplace_back(v);
    if(not directed) G[v].emplace_back(u);
  }

  vector<int> vs;
  int dfs(int v,int p){
    used[v]=1;
    vs.emplace_back(v);
    for(int u:G[v]){
      if((not directed) and u==p) continue;
      if(used[u]==2) continue;
      if(used[u]==1) return u;
      int res=dfs(u,v);
      if(~res) return res;
    }
    used[v]=2;
    vs.pop_back();
    return -1;
  }

  vector<int> build(){
    for(int i=0;i<(int)G.size();i++){
      if(used[i]) continue;
      int start=dfs(i,-1);
      if(start<0) continue;
      vs.erase(vs.begin(),find(vs.begin(),vs.end(),start));
      return vs;
    }
    return {};
  }
};
using DirectedCycle = Cycle<true>;
using UndirectedCycle = Cycle<false>;
//END CUT HERE
#ifndef call_from_test
//INSERT ABOVE HERE
signed main(){
  return 0;
}
#endif
#line 7 "test/aoj/2891.test.cpp"
#undef call_from_test

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n;
  cin>>n;

  UndirectedCycle G(n);
  for(int i=0;i<n;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    G.add_edge(u,v);
  }

  auto vs=G.build();
  unordered_set<int> namori(vs.begin(),vs.end());

  int q;
  cin>>q;
  for(int i=0;i<q;i++){
    int a,b;
    cin>>a>>b;
    a--;b--;
    cout<<1+(namori.count(a) and namori.count(b))<<'\n';
  }
  return 0;
}

Back to top page