結果
問題 | No.2301 Namorientation |
ユーザー |
|
提出日時 | 2023-05-12 21:55:27 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,890 bytes |
コンパイル時間 | 4,381 ms |
コンパイル使用メモリ | 265,152 KB |
最終ジャッジ日時 | 2025-02-12 22:39:16 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 6 WA * 24 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using namespace atcoder;typedef long long int ll;typedef long double ld;typedef vector<ll> vi;typedef vector<vi> vvi;typedef vector<vvi> vvvi;typedef vector<vvvi> vvvvi;typedef pair<ll,ll> pi;typedef pair<ll,pi> ppi;typedef pair<ll,ppi> pppi;typedef pair<ll,pppi> ppppi;#define FOR(i,l,r) for(ll i=l;i<r;i++)#define REP(i,n) FOR(i,0,n)#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)#define RREP(i,n) RFOR(i,0,n)#define ALL(x) x.begin(),x.end()#define F first#define S second#define BS(A,x) binary_search(ALL(A),x)#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())#define COU(A,x) (UB(A,x)-LB(A,x))#define sz(c) ((ll)(c).size())/*#include<boost/multiprecision/cpp_int.hpp>namespace mp=boost::multiprecision;using Bint=mp::cpp_int;*/template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}//*using mint=modint998244353;const ll mod=998244353;//*//*using mint=modint1000000007;const ll mod=1000000007;//*///using mint=modint;//*typedef vector<mint> vm;typedef vector<vm> vvm;typedef vector<vvm> vvvm;typedef vector<vvvm> vvvvm;ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}//*/int main(){ll N;cin>>N;vector<pi>es(N);cin>>es;vvi E(N);REP(i,N){es[i].F--;es[i].S--;E[es[i].F].emplace_back(es[i].S);E[es[i].S].emplace_back(es[i].F);}vi P(N,-1);P[0]=0;queue<ll>Q;Q.emplace(0);while(sz(Q)){ll v=Q.front();Q.pop();for(auto u:E[v])if(P[u]==-1){P[u]=v;Q.emplace(u);}}set<pi>S,ans;FOR(i,1,N){S.insert(pi(i,P[i]));S.insert(pi(P[i],i));}ll t=0;while(S.count(es[t]))t++;ll r=es[t].F;REP(i,N)P[i]=-1;P[r]=r;Q.emplace(r);while(sz(Q)){ll v=Q.front();Q.pop();for(auto u:E[v])if(P[u]==-1){P[u]=v;Q.emplace(u);}}t=0;while(S.count(es[t]))t++;ll u=es[t].F,v=es[t].S;ans.insert(pi(u,v));while(u!=r){ans.insert(pi(P[u],u));u=P[u];}while(v!=r){ans.insert(pi(v,P[v]));v=P[v];}REP(i,N)if(!ans.count(pi(P[i],i)))ans.insert(pi(i,P[i]));REP(i,N){if(ans.count(es[i]))cout<<"->"<<endl;else cout<<"<-"<<endl;}return 0;}