結果

問題 No.1817 Reversed Edges
ユーザー mikam
提出日時 2022-01-22 17:31:37
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 125 ms / 2,000 ms
コード長 4,126 bytes
コンパイル時間 4,951 ms
コンパイル使用メモリ 263,320 KB
最終ジャッジ日時 2025-01-27 14:50:50
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void in(T&... a){(cin>> ... >> a);}
template<class T> void out(T& a){cout <<a<< '\n';}
template<class T,class... Ts> void out(const T&a, const Ts&... b){cout<< a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define pcnt __builtin_popcount
int ceil(int x,int y){return x/y+!!(x%y);}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
ostream &operator<< (ostream &os, const P &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
template<typename T> bool chmax(T &a, const T b) {if (a < b) {a = b; return true;} else return false; }
template<typename T> bool chmin(T &a, const T b) {if (a > b) {a = b; return true;} else return false; }
void yesno(bool ok){ cout<<(ok?"Yes":"No")<<endl;}
vector<P> dxdy{{1,0},{0,1},{-1,0},{0,-1}};
const int INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
template <class S, S (*merge)(S, S), S (*fv)(S, int, bool), S (*fe)(S, int, int, int), S (*e)()>
struct rerooting {
    int N;
    vector<vector<P>> G;
    vector<vector<S>> dp;
    vector<S> ans;
    rerooting(int n) : N(n) {
        G.resize(N); dp.resize(N); ans.resize(N);
    }
    void add_edge(int u, int v, int w = 1) {
        assert(0 <= u && u < N);
        assert(0 <= v && v < N);
        G[u].emplace_back(v, w);
    }
    S dfs1(int u, int p) {
        S res = e();
        int m = G[u].size();
        for (int i = 0; i < m; i++) {
            auto [v, w] = G[u][i];
            if (v == p) continue;
            dp[u][i] = dfs1(v, u);
            res = merge(res, fe(dp[u][i], u, v, w));
        }
        return fv(res, u, true);
    }
    void dfs2(int u, int p, S px) {
        int m = G[u].size();
        for (int i = 0; i < m; i++) {
            auto [v, _] = G[u][i];
            if (v == p) { dp[u][i] = px; break; }
        }
        vector<S> dp_R(m+1);
        dp_R[m] = e();
        for (int i = m; 0 < i; i--) {
            auto [v, w] = G[u][i-1];
            dp_R[i-1] = merge(fe(dp[u][i-1], u, v, w), dp_R[i]);
        }
        ans[u] = fv(dp_R[0], u, false);
        S dp_l = e();
        for (int i = 0; i < m; i++) {
            auto [v, w] = G[u][i];
            if (v != p) dfs2(v, u, fv(merge(dp_l, dp_R[i+1]), u, true));
            dp_l = merge(dp_l, fe(dp[u][i], u, v, w));
        }
    }
    vector<S> solve(){
        for(int u = 0;u < N; u++) dp[u].resize(G[u].size());
        dfs1(0,-1);
        dfs2(0,-1,e());
        return ans;
    }
};
using S = int;
S merge(S a, S b) { return a + b; };
S fv(S x, int u, bool is_root) {
    return x;
};
S fe(S x, int s, int t, int w) {
    return x + (s > t);
};
S e() { return 0; };
signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int n;cin>>n;
    rerooting<S, merge, fv, fe, e> re(n);
    rep(i,n-1){
        int u,v;cin>>u>>v;
        u--;v--;
        re.add_edge(u,v);
        re.add_edge(v,u);
    }
    for(auto e:re.solve())cout<<e<<"\n";
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0