#953663 (C++17) No.2634 Tree Distance 3

提出ソース

結果

問題	No.2634 Tree Distance 3
ユーザー	akiaa11
提出日時	2024-02-23 01:53:43
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	2,063 ms / 3,000 ms
コード長	5,286 bytes
コンパイル時間	4,513 ms
コンパイル使用メモリ	286,576 KB
実行使用メモリ	86,456 KB
最終ジャッジ日時	2024-09-29 04:41:48
合計ジャッジ時間	75,366 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,915 ms 77,604 KB
testcase_01	AC	1,950 ms 77,588 KB
testcase_02	AC	1,939 ms 77,596 KB
testcase_03	AC	1,928 ms 77,328 KB
testcase_04	AC	1,996 ms 77,480 KB
testcase_05	AC	1,207 ms 56,544 KB
testcase_06	AC	1,183 ms 56,648 KB
testcase_07	AC	1,167 ms 56,540 KB
testcase_08	AC	1,000 ms 68,880 KB
testcase_09	AC	990 ms 69,028 KB
testcase_10	AC	954 ms 68,676 KB
testcase_11	AC	881 ms 68,316 KB
testcase_12	AC	818 ms 67,472 KB
testcase_13	AC	435 ms 48,028 KB
testcase_14	AC	383 ms 46,724 KB
testcase_15	AC	419 ms 47,580 KB
testcase_16	AC	1,619 ms 74,460 KB
testcase_17	AC	834 ms 44,712 KB
testcase_18	AC	1,141 ms 52,820 KB
testcase_19	AC	1,341 ms 66,164 KB
testcase_20	AC	340 ms 24,164 KB
testcase_21	AC	1,277 ms 65,568 KB
testcase_22	AC	1,262 ms 67,160 KB
testcase_23	AC	1,295 ms 68,004 KB
testcase_24	AC	1,914 ms 81,312 KB
testcase_25	AC	1,956 ms 82,364 KB
testcase_26	AC	2,063 ms 86,456 KB
testcase_27	AC	1,180 ms 59,772 KB
testcase_28	AC	1,207 ms 60,780 KB
testcase_29	AC	1,245 ms 63,568 KB
testcase_30	AC	1,140 ms 56,740 KB
testcase_31	AC	1,175 ms 56,556 KB
testcase_32	AC	1,184 ms 56,612 KB
testcase_33	AC	505 ms 42,492 KB
testcase_34	AC	76 ms 11,392 KB
testcase_35	AC	263 ms 26,924 KB
testcase_36	AC	131 ms 16,816 KB
testcase_37	AC	313 ms 30,176 KB
testcase_38	AC	5 ms 6,816 KB
testcase_39	AC	5 ms 6,820 KB
testcase_40	AC	3 ms 6,820 KB
testcase_41	AC	3 ms 6,816 KB
testcase_42	AC	4 ms 6,820 KB
testcase_43	AC	429 ms 28,188 KB
testcase_44	AC	262 ms 19,660 KB
testcase_45	AC	1,586 ms 66,692 KB
testcase_46	AC	885 ms 45,568 KB
testcase_47	AC	1,804 ms 73,960 KB
testcase_48	AC	1,762 ms 77,796 KB
testcase_49	AC	1,813 ms 77,836 KB
testcase_50	AC	1,967 ms 78,188 KB
testcase_51	AC	1,770 ms 77,720 KB
testcase_52	AC	1,800 ms 77,788 KB
testcase_53	AC	6 ms 6,816 KB
testcase_54	AC	5 ms 6,820 KB
testcase_55	AC	5 ms 6,820 KB
testcase_56	AC	5 ms 6,816 KB
testcase_57	AC	5 ms 6,816 KB
testcase_58	AC	2 ms 6,820 KB
testcase_59	AC	1 ms 6,820 KB
testcase_60	AC	1,576 ms 75,852 KB
testcase_61	AC	1,540 ms 75,880 KB
testcase_62	AC	1,524 ms 75,812 KB
testcase_63	AC	490 ms 63,592 KB
testcase_64	AC	301 ms 43,344 KB
testcase_65	AC	447 ms 60,324 KB
testcase_66	AC	103 ms 21,120 KB
testcase_67	AC	82 ms 18,040 KB
testcase_68	AC	286 ms 45,076 KB
testcase_69	AC	280 ms 45,068 KB
testcase_70	AC	285 ms 45,064 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int op(int a, int b){return max(a, b);}
int e(){return -inf;}

int n;
veci a;
vector<veci> g;
veci solve(){
	cin>>n;
	a.resize(n);
	g.assign(n, {});
	rep(i, n) cin>>a[i];
	rep(i, n - 1){
		int b, c;cin>>b>>c;
		b--, c--;
		g[b].push_back(c);
		g[c].push_back(b);
	}
	veci dp(n), used(n);
	auto dfs = [&](auto f, int v, int p) -> void{
		dp[v] = 1;
		for(int nv : g[v]) if(nv != p && used[nv] == 0){
			f(f, nv, v);
			dp[v] += dp[nv];
		}
	};
	auto dfs2 = [&](auto f, int v, int p, int c) -> int{
		int u = 1;
		for(int nv : g[v]) if(used[nv] == 0){
			if(nv == p) u &= c >= 2 * (c - dp[v]);
			else u &= c >= 2 * dp[nv];
		}
		if(u) return v;
		for(int nv : g[v]) if(nv != p && used[nv] == 0){
			int r = f(f, nv, v, c);
			if(r != -1) return r;
		}
		return -1;
	};
	veci pr(n), sz(n);
	veci ls;
	vector<veci> g2(n);
	auto rec = [&](auto f, int v, int p) -> int{
		dfs(dfs, v, -1);
		int cent = dfs2(dfs2, v, -1, dp[v]);
		pr[cent] = p;
		sz[cent] = dp[v];
		used[cent] = 1;
		for(int nv : g[cent]) if(used[nv] == 0){
			g2[cent].push_back(f(f, nv, cent));
		}
		ls.push_back(cent);
		return cent;
	};
	rec(rec, 0, -1);
	veci dist(n);
	auto dfs3 = [&](auto f, int v, int p) -> void{
		for(int nv : g[v]) if(nv != p && used[nv] == 0){
			dist[nv] = dist[v] + 1;
			f(f, nv,  v);
		}
	};
	vector<veci> b(n);
	vecpii lr(n);
	veci ans(n);
	veci idx(n);
	auto rec2 = [&](auto f, int v) -> void{
		map<int, veci> mp;
		dist[v] = 0;
		dfs3(dfs3, v, -1);
		int cnt = 0;
		for(int nv : g2[v]){
			int l = cnt, r = cnt + b[nv].size();
			while(b[nv].size()){
				mp[a[b[nv].back()]].push_back(b[nv].back());
				b[v].push_back(b[nv].back());
				lr[b[nv].back()] = {l, r};
				idx[b[nv].back()] = cnt++;
				b[nv].pop_back();
			}
		}
		lr[v] = {cnt, cnt + 1};
		idx[v] = cnt++;
		b[v].push_back(v);
		mp[a[v]].push_back(v);
		segtree<int, op, e> sg(sz[v]);
		for(auto it = mp.rbegin(); it != mp.rend(); ++it){
			for(int nv : it->se)
					sg.set(idx[nv], dist[nv]);
			for(int nv : it->se){
				chmax(ans[nv], dist[nv] + max(sg.prod(0, lr[nv].fi), sg.prod(lr[nv].se, sz[v])));
			}
		}
		used[v] = 0;
	};
	rep(i, ls.size())
		rec2(rec2, ls[i]);
	return ans;
}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	auto r = solve();
	PrintR(r);
}

yukicoder

結果

テストケース

ソースコード