結果

問題 No.2301 Namorientation
ユーザー noya2noya2
提出日時 2023-05-12 21:50:41
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,752 bytes
コンパイル時間 4,904 ms
コンパイル使用メモリ 275,344 KB
実行使用メモリ 20,520 KB
最終ジャッジ日時 2024-05-06 11:38:48
合計ジャッジ時間 13,612 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 WA -
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 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 WA -
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 WA -
testcase_13 AC 61 ms
12,416 KB
testcase_14 AC 148 ms
19,712 KB
testcase_15 AC 77 ms
14,320 KB
testcase_16 AC 110 ms
17,248 KB
testcase_17 AC 69 ms
13,440 KB
testcase_18 AC 113 ms
17,584 KB
testcase_19 AC 56 ms
11,776 KB
testcase_20 AC 116 ms
17,536 KB
testcase_21 AC 91 ms
14,196 KB
testcase_22 AC 74 ms
18,224 KB
testcase_23 AC 72 ms
18,032 KB
testcase_24 AC 61 ms
15,544 KB
testcase_25 AC 52 ms
16,476 KB
testcase_26 AC 68 ms
20,520 KB
testcase_27 WA -
testcase_28 AC 142 ms
19,604 KB
testcase_29 AC 147 ms
19,712 KB
testcase_30 AC 144 ms
19,604 KB
testcase_31 AC 143 ms
19,744 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,m,n) for (int i = m; i < int(n); ++i)
#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using pdd = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T> T rev(const T& str_or_vec){T res = str_or_vec; reverse(res.begin(),res.end()); return res; }
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T1, typename T2>void print(pair<T1,T2> a);
template<typename T>void print(vector<T> v);
template<typename T>void print(vector<vector<T>> v);
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", 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(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
void print(unsigned int a){ printf("%u", a); }
void print(unsigned long long a) { printf("%llu", a); }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
template<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}
template<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}
template<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}
void yes(){out("Yes");}
void no (){out("No");}
void yn (bool t){if(t)yes();else no();}
void fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}
void o(){out("!?");}

namespace noya2{

const int INF = 1001001007;
const long long mod1 = 998244353;
const long long mod2 = 1000000007;
const long long inf = 2e18;
const long double pi = 3.14159265358979323;
const long double eps = 1e-7;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

} // namespace noya2
using namespace noya2;

using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
void out(mint a){out(a.val());}
void out(vector<mint> a){vector<ll> b(a.size()); rep(i,a.size()) b[i] = a[i].val(); out(b);}
void out(vector<vector<mint>> a){for (auto v : a) out(v);}


void solve(){
    int n; cin >> n;
    vector<int> deg(n,0);
    vector<vector<P>> a(n);
    vector<P> es(n);
    rep(i,n){
        int u, v; cin >> u >> v; u--, v--;
        a[u].emplace_back(P(v,i));
        a[v].emplace_back(P(u,i));
        es[i] = P(u,v);
        deg[u]++, deg[v]++;
    }
    vector<int> vis(n,0);
    queue<int> que;
    rep(i,n) if (deg[i] == 1) que.push(i), vis[i] = 1;
    vector<int> ans(n);
    auto add = [&](int i, int u, int v){
        if (es[i].first == u) ans[i] = 0;
        else ans[i] = 1;
    };
    while (!que.empty()){
        int p = que.front(); que.pop();
        for (auto [q,i] : a[p]){
            if (vis[q] == 1) continue;
            add(i,p,q);
            if (--deg[q] == 1){
                vis[q] = 1;
                que.push(q);
            }
        }
    }
    int id = -1; //out(vis);
    rep(i,n) if (vis[i] == 0) id = i;
    while (true){
        int nxt = -1;
        for (auto [v,i] : a[id]){
            if (vis[v] == 1) continue;
            vis[v] = 1;
            add(i,id,v);
            nxt = v;
            break;
        }
        if (nxt == -1) break;
        id = nxt;
    }
    rep(i,n) out(ans[i] == 0 ? "->" : "<-");
}

int main(){
    fast_io();
    int t = 1; //cin >> t;
    while(t--) solve();
}
0