結果
問題 | No.2638 Initial fare |
ユーザー |
![]() |
提出日時 | 2024-02-19 22:40:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 231 ms / 2,000 ms |
コード長 | 3,814 bytes |
コンパイル時間 | 4,520 ms |
コンパイル使用メモリ | 254,996 KB |
最終ジャッジ日時 | 2025-02-19 17:24:04 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)#define rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--)#define repn(i,end) for(long long i = 0; i <= (long long)(end); i++)#define reps(i,start,end) for(long long i = start; i < (long long)(end); i++)#define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++)#define each(p,a) for(auto &p:a)typedef long long ll;typedef unsigned long long ull;typedef long double ld;typedef vector<long long> vll;typedef vector<pair<long long ,long long>> vpll;typedef vector<vector<long long>> vvll;typedef set<ll> sll;typedef map<long long , long long> mpll;typedef pair<long long ,long long> pll;typedef tuple<long long , long long , long long> tpl3;#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)#define all(a) (a).begin(),(a).end()#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );// << std::fixed << std::setprecision(10)const ll INF = 1LL << 60;const ld EPS = 1e-9;inline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}inline ll popcnt(ull a){ return __builtin_popcountll(a);}template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}template<typename T>std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}template<typename T>std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}template<class... T>void input(T&... a){(cin >> ... >> a);}void print(){cout << endl;}template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}template<class T> void pspace(const T& a){ cout << a << ' ';}void perr(){cerr << endl;}template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}void yes(bool i = true){ return print(i?"yes":"no"); }void Yes(bool i = true){ return print(i?"Yes":"No"); }void YES(bool i = true){ return print(i?"YES":"NO"); }//grid探索用vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;}const ll MOD9 = 998244353LL;const ll MOD10 = 1000000007LL;int main(){ios::sync_with_stdio(false);cin.tie(nullptr);LL(n);vvll g(n);rep(i,n-1){LL(u,v);u--;v--;g[u].push_back(v);g[v].push_back(u);}vector<ll> found(n,0);//n頂点vvll dp(n,vll(4));auto dfs = [&](auto dfs, ll v)->void{found[v] = 1;//gでグラフを受け取っているdp[v][0] = 1;for(auto &p:g[v]){if(found[p] == 0){dfs(dfs,p);rep(i,3){dp[v][i+1] += dp[p][i];}}}};dfs(dfs,0);ll ans = 0;rep(i,n){rep(j,3){ans += dp[i][j+1];}ans += dp[i][1] * (dp[i][1]-1)/2;if(dp[i][1] >= 2 && dp[i][2] >= 1){ans += (dp[i][1]-1) * dp[i][2];}// cout <<i << " " << ans << endl;}// cout << dp[0][1] << endl;// cout << dp[0][2] << endl;// cout << dp[0][3] << endl;cout << ans << endl;}