結果

問題 No.828 全方位神童数
ユーザー fumiphysfumiphys
提出日時 2019-08-13 23:24:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 858 ms / 2,000 ms
コード長 4,327 bytes
コンパイル時間 1,906 ms
コンパイル使用メモリ 178,524 KB
実行使用メモリ 40,320 KB
最終ジャッジ日時 2024-09-19 13:36:52
合計ジャッジ時間 12,289 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
8,064 KB
testcase_01 AC 4 ms
8,192 KB
testcase_02 AC 4 ms
8,064 KB
testcase_03 AC 23 ms
8,576 KB
testcase_04 AC 7 ms
8,192 KB
testcase_05 AC 16 ms
8,576 KB
testcase_06 AC 6 ms
8,192 KB
testcase_07 AC 6 ms
8,192 KB
testcase_08 AC 7 ms
8,192 KB
testcase_09 AC 5 ms
8,064 KB
testcase_10 AC 15 ms
8,448 KB
testcase_11 AC 6 ms
8,064 KB
testcase_12 AC 15 ms
8,448 KB
testcase_13 AC 59 ms
17,152 KB
testcase_14 AC 126 ms
27,520 KB
testcase_15 AC 46 ms
16,896 KB
testcase_16 AC 61 ms
18,304 KB
testcase_17 AC 50 ms
16,128 KB
testcase_18 AC 86 ms
20,480 KB
testcase_19 AC 168 ms
34,048 KB
testcase_20 AC 108 ms
27,520 KB
testcase_21 AC 135 ms
30,592 KB
testcase_22 AC 34 ms
13,992 KB
testcase_23 AC 20 ms
8,704 KB
testcase_24 AC 292 ms
12,672 KB
testcase_25 AC 91 ms
9,856 KB
testcase_26 AC 480 ms
16,512 KB
testcase_27 AC 311 ms
15,104 KB
testcase_28 AC 506 ms
16,512 KB
testcase_29 AC 436 ms
16,128 KB
testcase_30 AC 207 ms
12,544 KB
testcase_31 AC 207 ms
12,544 KB
testcase_32 AC 429 ms
16,384 KB
testcase_33 AC 466 ms
17,024 KB
testcase_34 AC 361 ms
15,360 KB
testcase_35 AC 324 ms
12,928 KB
testcase_36 AC 318 ms
14,208 KB
testcase_37 AC 232 ms
12,160 KB
testcase_38 AC 377 ms
13,568 KB
testcase_39 AC 675 ms
16,640 KB
testcase_40 AC 171 ms
12,032 KB
testcase_41 AC 158 ms
11,392 KB
testcase_42 AC 858 ms
17,280 KB
testcase_43 AC 146 ms
40,320 KB
testcase_44 AC 57 ms
20,608 KB
testcase_45 AC 84 ms
26,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
using ll = long long int;
using P = pair<int, int>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
ll S[200010];
bool vis[200010];
vector<int> edges[200010];
set<int> st;

void dfs1(int i){
  vector<int> tmp;
  vis[i] = true;
  while(sz(st) && (*st.begin()) < i){
    tmp.pb(*st.begin());
    st.erase(st.begin());
  }
  st.insert(i);
  for(auto e: edges[i]){
    if(!vis[e]){
      dfs1(e);
      while(sz(st) && (*st.begin()) < i)st.erase(st.begin());
    }
  }
  S[i] += sz(st);
  rep(i, sz(tmp))st.insert(tmp[i]);
}

void dfs2(int i){
  vector<int> tmp;
  vis[i] = true;
  while(sz(st) && (*st.begin()) < i){
    tmp.pb(*st.begin());
    st.erase(st.begin());
  }
  S[i] += sz(st);
  for(auto e: edges[i]){
    if(!vis[e]){
      dfs2(e);
      while(sz(st) && (*st.begin()) < i)st.erase(st.begin());
    }
  }
  st.insert(i);
  rep(i, sz(tmp))st.insert(tmp[i]);
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); vector<ll> r(n); cin >> r;
  rep(i, n - 1){
    INT(u); INT(v); u--; v--;
    edges[u].pb(v);
    edges[v].pb(u);
  }
  dfs1(0);
  rep(i, n)reverse(all(edges[i]));
  st.clear();
  fill(vis, vis + n, false);
  dfs2(0);
  ll res = 1; rep(i, n)res = res * ((r[i] + S[i]) % mod) % mod;
  cout << res << endl;
  return 0;
}
0