結果
問題 | No.1817 Reversed Edges |
ユーザー | PCTprobability |
提出日時 | 2022-01-21 22:06:10 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 73 ms / 2,000 ms |
コード長 | 4,189 bytes |
コンパイル時間 | 4,629 ms |
コンパイル使用メモリ | 269,108 KB |
実行使用メモリ | 18,304 KB |
最終ジャッジ日時 | 2024-11-26 00:18:48 |
合計ジャッジ時間 | 7,260 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
8,192 KB |
testcase_01 | AC | 6 ms
8,064 KB |
testcase_02 | AC | 6 ms
8,064 KB |
testcase_03 | AC | 6 ms
8,320 KB |
testcase_04 | AC | 6 ms
8,192 KB |
testcase_05 | AC | 5 ms
8,192 KB |
testcase_06 | AC | 6 ms
8,192 KB |
testcase_07 | AC | 57 ms
13,184 KB |
testcase_08 | AC | 28 ms
10,624 KB |
testcase_09 | AC | 65 ms
13,056 KB |
testcase_10 | AC | 31 ms
11,008 KB |
testcase_11 | AC | 40 ms
11,904 KB |
testcase_12 | AC | 65 ms
14,080 KB |
testcase_13 | AC | 67 ms
13,952 KB |
testcase_14 | AC | 64 ms
13,952 KB |
testcase_15 | AC | 69 ms
14,080 KB |
testcase_16 | AC | 69 ms
14,208 KB |
testcase_17 | AC | 69 ms
14,208 KB |
testcase_18 | AC | 67 ms
14,208 KB |
testcase_19 | AC | 70 ms
13,952 KB |
testcase_20 | AC | 69 ms
14,080 KB |
testcase_21 | AC | 73 ms
14,080 KB |
testcase_22 | AC | 37 ms
13,492 KB |
testcase_23 | AC | 38 ms
13,500 KB |
testcase_24 | AC | 47 ms
18,304 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endifusing ll = long long;using ld = long double;using ull = unsigned long long;#define endl "\n"typedef pair<int,int> Pii;#define REP(i, n) for (int i = 0; i < (n); ++i)#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)#define ALL(x) begin(x), end(x)#define PB push_back#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(s) (s).begin(),(s).end()#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)#define drep(i, n) drep2(i, n, 0)#define rever(vec) reverse(vec.begin(), vec.end())#define sor(vec) sort(vec.begin(), vec.end())#define fi first#define se second#define pb push_back#define P pair<ll,ll>#define PQminll priority_queue<ll, vector<ll>, greater<ll>>#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>#define PQminP priority_queue<P, vector<P>, greater<P>>#define PQmaxP priority_queue<P,vector<P>,less<P>>#define NP next_permutation//typedef string::const_iterator State;//class ParseError {};//const ll mod = 1000000009;const ll mod = 998244353;//const ll mod = 1000000007;const ll inf = 4100000000000000000ll;const ld eps = ld(0.000000000001);const long double pi = 3.141592653589793;template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}void yes(bool a){cout<<(a?"yes":"no")<<endl;}void YES(bool a){cout<<(a?"YES":"NO")<<endl;}void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }template<class T>void print(T a){cout<<a<<endl;}template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}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<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1;} return ret; }vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }ll pop(ll x){return __builtin_popcountll(x);}ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}void cincout() {ios::sync_with_stdio(false);std::cin.tie(nullptr);cout<< fixed << setprecision(10);}ll dp[200000];vector<P> g[200000];ll ans=0;void dfs(ll a,ll b){for(auto e:g[a]){if(e.fi==b) continue;if(e.se==0) ans++;dfs(e.fi,a);}}void dfs2(ll a,ll b){for(auto e:g[a]){if(e.fi==b) continue;if(e.se) dp[e.fi]=dp[a]+1;else dp[e.fi]=dp[a]-1;dfs2(e.fi,a);}}int main(){cincout();ll n;cin>>n;for(int i=0;i<n-1;i++){ll a,b;cin>>a>>b;a--;b--;if(a>b) swap(a,b);g[a].pb({b,1});g[b].pb({a,0});}dfs(0,-1);dp[0]=ans;dfs2(0,-1);for(int i=0;i<n;i++) cout<<dp[i]<<endl;}