結果

問題 No.2301 Namorientation
ユーザー jabeejabee
提出日時 2023-05-14 13:38:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,535 bytes
コンパイル時間 4,447 ms
コンパイル使用メモリ 282,760 KB
最終ジャッジ日時 2025-02-13 00:30:43
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 2
other WA * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------
ll n;
vector<ll>a,b;
vector<string>ans;
Graph g;
map<P,ll>mp;
vector<ll>v;
vector<ll>c;
ll s;
void dfs(ll from, ll par){
    v.push_back(from);
    if(from == b[s])c = v;
    for(auto to:g[from]){
        if(par == to)continue;
        dfs(to,from);
    }
    v.pop_back();
}
string make_ans(ll idx){
    if(idx < 0) return "<-";
    else return  "->";
}
void _main() {
    
    cin >> n;
    a.resize(n);
    b.resize(n);
    ans.resize(n,"");
    dsu d(n);
    g.resize(n);
    rep(i,0,n){
        cin >> a[i] >> b[i];
        a[i]--; b[i]--;
        
        if(d.same(a[i],b[i])){
            s = i;
            ans[s] = "<-";
        }else{
          d.merge(a[i],b[i]);
          g[a[i]].push_back(b[i]);
          g[b[i]].push_back(a[i]);
          mp[{a[i],b[i]}] = (i+1);
        mp[{b[i],a[i]}] = (i+1) * -1;
        }
    }
    ll now = a[s];
    
    dfs(a[s],-1);
    
    vector<ll>seen(n,0);
  //  cout << a[s] << " " << b[s] << endl;
   // rep(i,0,c.size())cout << c[i]+1 << " ";
   // cout << endl;

    if(c.size() == 0){
        c.push_back(a[s]);
        c.push_back(b[s]);
    }
    if(c.size()){
    rep(i,0,c.size()-1){
        ll idx = mp[{c[i],c[i+1]}];
        seen[c[i]] = 1;
        seen[c[i+1]] = 1; 
        ans[abs(idx)-1] = make_ans(idx);
    }
    ll iidx = mp[{c.back(),c[0]}];
  if(iidx != 0)  ans[abs(iidx)-1] = make_ans(iidx);
   }

   g[a[s]].push_back(b[s]);
   g[b[s]].push_back(a[s]);
   set<ll>c_st;
   rep(i,0,c.size())c_st.insert(c[i]);
   vector<ll>dig(n,0);
   rep(i,0,n)dig[i] = g[i].size();
   rep(i,0,n){
 //  if(i == 1 || i == 15)cout << i << " " << dig[0] << " " << dig[1] << " " << dig[15] << endl;
   
    if(dig[i] != 1)continue;
    seen[i] = 1;
    set<ll>used;
    used.insert(i);
    queue<ll>q;
    q.push(i);
    
    while(q.size()){
        ll from = q.front();
     //   if(i == 1 || i == 15)cout << from << " " << dig[from] << endl;
        q.pop();
        if(c_st.count(from))continue;
        for(auto to:g[from]){
            if(used.count(to))continue;
            dig[from]--;
            dig[to]--;
            if(dig[to] == 1){
                q.push(to);
            used.insert(to);
            }
            ll idx = mp[{from,to}];
          //  if(abs(idx) == 14)cout << i << " " << from << " " << to << endl;
            if(idx < 0) ans[abs(idx)-1] = "<-";
            else ans[abs(idx)-1] = "->";
        }
    }
   }    
   
    rep(i,0,n){
        cout << i+1 << " " << ans[i] << "\n";
    }
}
0