結果

問題 No.2301 Namorientation
ユーザー moharan627moharan627
提出日時 2023-05-12 23:20:41
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 641 ms / 3,000 ms
コード長 6,257 bytes
コンパイル時間 5,546 ms
コンパイル使用メモリ 321,296 KB
実行使用メモリ 80,512 KB
最終ジャッジ日時 2024-05-06 13:21:57
合計ジャッジ時間 22,248 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
35,200 KB
testcase_01 AC 26 ms
35,072 KB
testcase_02 AC 26 ms
35,200 KB
testcase_03 AC 27 ms
35,200 KB
testcase_04 AC 27 ms
35,200 KB
testcase_05 AC 26 ms
35,200 KB
testcase_06 AC 27 ms
35,072 KB
testcase_07 AC 26 ms
35,072 KB
testcase_08 AC 26 ms
35,200 KB
testcase_09 AC 27 ms
35,200 KB
testcase_10 AC 25 ms
35,072 KB
testcase_11 AC 26 ms
35,200 KB
testcase_12 AC 330 ms
49,280 KB
testcase_13 AC 298 ms
48,128 KB
testcase_14 AC 630 ms
58,624 KB
testcase_15 AC 384 ms
50,816 KB
testcase_16 AC 512 ms
55,168 KB
testcase_17 AC 346 ms
49,792 KB
testcase_18 AC 525 ms
55,808 KB
testcase_19 AC 255 ms
47,232 KB
testcase_20 AC 518 ms
55,552 KB
testcase_21 AC 360 ms
50,560 KB
testcase_22 AC 289 ms
80,512 KB
testcase_23 AC 296 ms
79,744 KB
testcase_24 AC 240 ms
72,320 KB
testcase_25 AC 185 ms
53,520 KB
testcase_26 AC 232 ms
59,000 KB
testcase_27 AC 626 ms
58,624 KB
testcase_28 AC 624 ms
58,752 KB
testcase_29 AC 641 ms
58,752 KB
testcase_30 AC 632 ms
58,624 KB
testcase_31 AC 637 ms
58,752 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__
pair<int,int> unused;
int Root=-1;
vector<bool> seen2(1010000,false);
vector<bool> seen(1010000,false);
vector<string> Ans(1010000);
map<pair<int,int>,int> Edge;
void dfs(const UnWeightedGraph &G,vector<bool> &seen, int u, int bef) {
    seen[u] = true;
    fore(v,G[u]) {
        if (!seen[v]) {
            dfs(G, seen,v,u);
        }
        else if(seen[v] && v!=bef && bef!=-1){
            Root = u;
            unused = {min(u,v),max(u,v)};
        }
    }
}
void dfs2(const UnWeightedGraph &G,vector<bool> &seen, int u) {
    seen[u] = true;
    fore(v,G[u]){
        if(unused.first==min(u,v) && unused.second == max(u,v))continue;
        if (!seen[v]) {
            if(u<v){
                Ans[Edge[{u,v}]]="<-";
            }
            else{
                Ans[Edge[{v,u}]]="->";
            }
            dfs2(G, seen,v);
        }
    }
}

int main()
{
    int N;cin >> N;
    UnWeightedGraph G(N);
    rep(i,N){
        int A,B;cin >> A >> B;
        A-=1;
        B-=1;
        Edge[{A,B}]=i;
        G[A].emplace_back(B);
        G[B].emplace_back(A);
    }
    dfs(G,seen,0,-1);
    if(unused.first==Root){
        Ans[Edge[unused]]="->";
    }
    else{
        Ans[Edge[unused]]="<-";
    }
    dfs2(G,seen2,Root);
    rep(i,N)cout << Ans[i] << "\n";
}

#else
//tie(a, b, c) = t
//repをllにしているので時間ギリギリならintに変換
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define rrep(i, n) for(long long int i = n-1; i >= 0; i--)
#define range(i, m, n) for(long long int i = m; i < n; i++)
#define fore(i,a) for(auto &i:a)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Sum(v) accumulate(all(v),0LL)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
const ll INF = 1e16;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll SN(char s){return ll(s-'0');}
ll SN(string s){return stoll(s);}
int alpN(char s){return int(s-'a');}
int AlpN(char s){return int(s-'A');}
int Nalp(int n){return char(n+97);}
int NAlp(int n){return char(n+65);}
using mint = modint;
using mint1 = modint1000000007;
using mint2 = modint998244353;
using pll = pair<long long, long long>;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){for(int i=0;i<(int)v.size();i++)o<<(i>0?" ":"")<<v[i];return o;}//vector空白区切り出力
ostream& operator<<(ostream& os, const mint1& N) {return os << N.val();}//mint出力。デフォはmint1
ostream& operator<<(ostream& os, const mint2& N) {return os << N.val();}
template<class T> bool contain(const std::string& s, const T& v) {
    return s.find(v) != std::string::npos;
}
ll max(int x,ll y){return max((ll)x,y);}
ll max(ll x,int y){return max(x,(ll)y);}
ll min(int x,ll y){return min((ll)x,y);}
ll min(ll x,int y){return min(x,(ll)y);}
template <typename T>
struct edge {
    int src, to;
    T cost;
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
    edge& operator=(const int& x) {
        to = x;
        return *this;
    }
    operator int() const { return to; }
};

template <typename T>
using Edges = vector<edge<T> >;
template <typename T>
using WeightedGraph = vector<Edges<T> >;
using UnWeightedGraph = vector<vector<int> >;
template <typename T>
using Matrix = vector<vector<T> >;

//unorderd_mapの拡張…https://qiita.com/hamamu/items/4d081751b69aa3bb3557
template<class T> size_t HashCombine(const size_t seed,const T &v){
    return seed^(std::hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));
}
/* pair用 */
template<class T,class S> struct std::hash<std::pair<T,S>>{
    size_t operator()(const std::pair<T,S> &keyval) const noexcept {
        return HashCombine(std::hash<T>()(keyval.first), keyval.second);
    }
};
/* vector用 */
template<class T> struct std::hash<std::vector<T>>{
    size_t operator()(const std::vector<T> &keyval) const noexcept {
        size_t s=0;
        for (auto&& v: keyval) s=HashCombine(s,v);
        return s;
    }
};
/* tuple用 */
template<int N> struct HashTupleCore{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{
        size_t s=HashTupleCore<N-1>()(keyval);
        return HashCombine(s,std::get<N-1>(keyval));
    }
};
template <> struct HashTupleCore<0>{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }
};
template<class... Args> struct std::hash<std::tuple<Args...>>{
    size_t operator()(const tuple<Args...> &keyval) const noexcept {
        return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
    }
};
ll ceil(ll a, ll b){
  return (a + b - 1) / b;
}
struct string_converter {
    char start = 0;
    char type(const char &c) const { return (islower(c) ? 'a' : isupper(c) ? 'A' : isdigit(c) ? '0' : 0); }
    int convert(const char &c) {
        if(!start) start = type(c);
        return c - start;
    }
    int convert(const char &c, const string &chars) { return chars.find(c); }
    template <typename T> auto convert(const T &v) {
        vector<decltype(convert(v[0]))> ret;
        ret.reserve(v.size());
        for(auto &&e : v) ret.emplace_back(convert(e));
        return ret;
    }
    template <typename T> auto convert(const T &v, const string &chars) {
        vector<decltype(convert(v[0], chars))> ret;
        ret.reserve(v.size());
        for(auto &&e : v) ret.emplace_back(convert(e, chars));
        return ret;
    }
    int operator()(const char &v, char s = 0) {
        start = s;
        return convert(v);
    }
    int operator()(const char &v, const string &chars) { return convert(v, chars); }
    template <typename T> auto operator()(const T &v, char s = 0) {
        start = s;
        return convert(v);
    }
    template <typename T> auto operator()(const T &v, const string &chars) { return convert(v, chars); }
} toint;
#endif
0