#802283 (C++17) No.364 門松木

提出ソース

結果

問題	No.364 門松木
ユーザー	heno239
提出日時	2022-09-30 21:00:31
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	37 ms / 3,000 ms
コード長	7,160 bytes
コンパイル時間	2,123 ms
コンパイル使用メモリ	169,856 KB
実行使用メモリ	27,336 KB
最終ジャッジ日時	2024-06-02 04:16:21
合計ジャッジ時間	4,063 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 11,848 KB
testcase_01	AC	7 ms 11,716 KB
testcase_02	AC	6 ms 11,720 KB
testcase_03	AC	6 ms 11,720 KB
testcase_04	AC	6 ms 11,716 KB
testcase_05	AC	6 ms 11,716 KB
testcase_06	AC	6 ms 11,848 KB
testcase_07	AC	6 ms 11,720 KB
testcase_08	AC	29 ms 15,180 KB
testcase_09	AC	28 ms 15,176 KB
testcase_10	AC	28 ms 15,172 KB
testcase_11	AC	29 ms 15,304 KB
testcase_12	AC	26 ms 15,300 KB
testcase_13	AC	24 ms 15,048 KB
testcase_14	AC	23 ms 15,048 KB
testcase_15	AC	24 ms 15,048 KB
testcase_16	AC	24 ms 14,920 KB
testcase_17	AC	28 ms 15,052 KB
testcase_18	AC	30 ms 15,304 KB
testcase_19	AC	31 ms 15,820 KB
testcase_20	AC	30 ms 15,556 KB
testcase_21	AC	31 ms 15,300 KB
testcase_22	AC	24 ms 15,176 KB
testcase_23	AC	32 ms 17,996 KB
testcase_24	AC	32 ms 14,916 KB
testcase_25	AC	33 ms 18,248 KB
testcase_26	AC	32 ms 16,964 KB
testcase_27	AC	30 ms 15,428 KB
testcase_28	AC	28 ms 15,044 KB
testcase_29	AC	31 ms 17,612 KB
testcase_30	AC	31 ms 18,760 KB
testcase_31	AC	6 ms 11,720 KB
testcase_32	AC	6 ms 11,720 KB
testcase_33	AC	37 ms 27,336 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };
//-----------------------------------------


void solve(){
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	vector<vector<int>> G(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	//number of 3,number of child
	vector<P> dp(n);
	int ans = 0;
	function<void(int, int)> dfs = [&](int id, int fr) {
		for (int to : G[id])if (to != fr) {
			dfs(to, id);
		}
		vector<pair<int, P>> ups, dows;
		for (int to : G[id])if (to != fr) {
			if (a[to] < a[id]) {
				dows.push_back({ a[to],dp[to] });
			}
			else if(a[to]>a[id]){
				ups.push_back({ a[to],dp[to] });
			}
		}
		sort(all(ups));
		sort(all(dows));
		int sup = 0;
		int tmp = 0;
		rep(i, ups.size()) {
			sup += tmp; tmp++;
			int le = i;
			while (i + 1 < ups.size() && ups[i].first == ups[i + 1].first)i++;
			int ma = 0;
			Rep1(j, le, i) {
				int val = ups[j].second.first + ups[j].second.second;
				chmax(ma, val);
			}
			sup += ma;
		}
		chmax(ans, sup);
		int sdow = 0;
		tmp = 0;
		rep(i, dows.size()) {
			sdow += tmp; tmp++;
			int le = i;
			while (i + 1 < dows.size() && dows[i].first == dows[i + 1].first)i++;
			int ma = 0;
			Rep1(j, le, i) {
				int val = dows[j].second.first + dows[j].second.second;
				chmax(ma, val);
			}
			sdow += ma;
		}
		chmax(ans, sdow);
		if (fr >= 0&&a[fr]!=a[id]) {
			vector<pair<int, P>> vp;
			for (int to : G[id])if (to != fr) {
				if (a[to] != a[fr]) {
					if (a[id] < a[fr] && a[id] < a[to]) {
						vp.push_back({ a[to],dp[to] });
					}
					else if (a[id] > a[fr] && a[id] > a[to]) {
						vp.push_back({ a[to],dp[to] });
					}
				}
			}
			sort(all(vp));
			int sum = 0;
			int tmp = 0;
			rep(i, vp.size()) {
				int le = i;
				while (i + 1 < vp.size() && vp[i].first == vp[i + 1].first)i++;
				sum += tmp; tmp++;
				int ma = 0;
				Rep1(j, le, i) {
					int val = vp[j].second.first + vp[j].second.second;
					chmax(ma, val);
				}
				sum += ma;
			}
			dp[id] = { sum,tmp };
		}
	};
	dfs(0, -1);
	cout << ans << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	//cout << calc("101") << "\n";
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード