結果

問題 No.2301 Namorientation
ユーザー abc23abc23
提出日時 2023-05-13 14:01:54
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 678 ms / 3,000 ms
コード長 7,576 bytes
コンパイル時間 6,458 ms
コンパイル使用メモリ 330,448 KB
実行使用メモリ 51,328 KB
最終ジャッジ日時 2024-11-29 07:04:44
合計ジャッジ時間 23,145 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 350 ms
25,624 KB
testcase_13 AC 314 ms
23,912 KB
testcase_14 AC 633 ms
41,656 KB
testcase_15 AC 399 ms
30,852 KB
testcase_16 AC 532 ms
36,984 KB
testcase_17 AC 365 ms
26,396 KB
testcase_18 AC 547 ms
37,544 KB
testcase_19 AC 301 ms
22,788 KB
testcase_20 AC 544 ms
37,456 KB
testcase_21 AC 400 ms
27,496 KB
testcase_22 AC 443 ms
51,328 KB
testcase_23 AC 449 ms
50,824 KB
testcase_24 AC 371 ms
43,620 KB
testcase_25 AC 316 ms
35,032 KB
testcase_26 AC 409 ms
42,048 KB
testcase_27 AC 678 ms
41,812 KB
testcase_28 AC 642 ms
41,816 KB
testcase_29 AC 649 ms
41,688 KB
testcase_30 AC 668 ms
41,688 KB
testcase_31 AC 641 ms
41,692 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__

class Namori{
public:
  int V;
  vector<vector<int> > G, graph;
  vector<int> deg, loop;
  vector<bool> flag;
  Namori(int node_size) : V(node_size), G(V), deg(V, 0), flag(V, false){}
	Namori() : Namori(0){}
  void add_edge(int u,int v){
    G[u].push_back(v), G[v].push_back(u);
    deg[u]++, deg[v]++;
  }
  void dfs(int u){
    loop.push_back(u);
    for(int v : G[u]){
    if(flag[v]) continue;
    flag[v] = true;
      dfs(v);
    }
  }
  void build(){
    graph.resize(V);
    queue<int> que;
    // 葉の頂点を que に突っ込む
    for(int i = 0; i < V; i++){
      if(deg[i] == 1){
        que.push(i);
        flag[i] = true;
      }
    }
    // 葉からサイクル上の頂点に向かって登っていく
    while(!que.empty()){
      int p = que.front();
      que.pop();
      for(int v : G[p]){
        if(flag[v]) continue;
        deg[v]--;
        //サイクルから端
        graph[v].push_back(p);
        //端からサイクル
        graph[p].push_back(v);
        if(deg[v] > 1) continue;
        que.push(v);
        flag[v] = true;
      }
    }
    // サイクル上の頂点を loop に格納
    for(int i = 0; i < V; i++){
      if(flag[i]) continue;
      flag[i] = true;
      dfs(i);
      break;
    }
  }
};

Namori namo;
V<int> loop,col;
V<P> ans;
void dfs1(int now,int p=-1){
	if(col[now])return ;
	col[now]=1;
	for(auto next:namo.G[now]){
		if(loop[next])continue;
		if(p==next)continue;
		ans.emplace_back(next,now);
		dfs1(next,now);
	}
	return ;
}
void dfs2(int now,int p){
	if(col[now])return ;
	col[now]=1;
	for(auto next:namo.G[now]){
		if(loop[next]==0)continue;
		if(p==next)continue;
		ans.emplace_back(now,next);
		dfs2(next,now);
		break;
	}
}
struct Solver {
void solve() {
	int n;cin>>n;
	namo=Namori (n);
	loop=col=V<int>(n);
	V<P> ab;
	rep(i,n){
		int a,b;cin>>a>>b;
		a--;b--;
		ab.emplace_back(a,b);
		namo.add_edge(a,b);
	}
	namo.build();
	rep(i,sz(namo.loop)){
		loop[namo.loop[i]]=1;
	}
	rep(i,sz(namo.loop)){
		dfs1(namo.loop[i]);
	}

	col=V<int>(n);
	rep(i,n){
		if(loop[i]==0)continue;
		dfs2(i,-1);
		break;
	}
	ans.emplace_back(INF,INF);
	sort(all(ans));
	// cout<<ans<<endl;
	rep(i,n){
		auto x=lower_bound(all(ans),ab[i]);
		if(*x==ab[i]){
			cout<<"->"<<endl;
			// cout<<i<<" "<<ab[i]<<" "<<"->"<<endl;
		}
		else{
			// cout<<i<<" "<<ab[i]<<" "<<"<-"<<endl;
			cout<<"<-"<<endl;
		}
		
	}
}};

signed main() {
	int ts = 1;
	// scanf("%lld",&ts);
	rep(ti,ts) {
		Solver solver;
		solver.solve();
	}
	return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;

const int INF = 1001001001;
const long long INFL = 3e18;
const int MAX = 2e6+5;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define allr(x) x.rbegin(),x.rend() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

template<typename T> using V = vector<T>;
template<typename T> using max_heap = priority_queue<T>;
template<typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
template<typename T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(all(a));a.erase(unique(all(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}
template<typename T>T vgcd(T m, T n) {return std::gcd(m, n);}
template<typename T, typename... Args>T vgcd(T a, Args... args) {return vgcd(a, vgcd(args...));}

void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
// void print(int a){ printf("%d", a); }
void print(unsigned a){ printf("%u", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(unsigned long long a){ printf("%llu", a); }
void print(char a){ printf("%c", a); }
void print(char *a){ printf("%s", a); }
void print(const char *a){ printf("%s", a); }
void print(double a){ printf("%.15f", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<typename T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }
template<typename T> void print(const vector<T>&);
template<typename T, size_t size> void print(const array<T, size>&);
template<typename T, typename L> void print(const pair<T, L>& p);
template<typename T, size_t size> void print(const T (&)[size]);
template<typename T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T, typename L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }
template<typename T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }
template<typename T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<typename T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<typename Head, typename... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }


ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
assert(check(ok));
	while (abs(ok - ng) > 1) {
		auto x = (ng + ok) / 2;
		if (check(x))
			ok = x;
		else
			ng = x;
	}
	return ok;
}

#endif
0