結果
| 問題 |
No.2634 Tree Distance 3
|
| ユーザー |
 owo_zzz
|
| 提出日時 | 2025-01-26 00:39:38 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 7,879 bytes |
| コンパイル時間 | 3,461 ms |
| コンパイル使用メモリ | 160,308 KB |
| 実行使用メモリ | 116,716 KB |
| 最終ジャッジ日時 | 2025-01-26 00:42:37 |
| 合計ジャッジ時間 | 174,598 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 WA * 1 |
| other | AC * 22 WA * 14 TLE * 33 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:265:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
265 | freopen(task".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp:266:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
266 | freopen(task".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp:270:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
270 | freopen(task1".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp:271:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
271 | freopen(task1".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx2,tune=native")
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <locale>
#include <map>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <unordered_set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <cstring>
#include <unordered_map>
#include <cmath>
#include <array>
#include <cassert>
#include <random>
#include <chrono>
using namespace std;
#define BIT(i,j) (((i)>>(j))&1LL)
#define MASK(i) (1LL<<(i))
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
#define fi first
#define se second
#define ull ungsigned long long
#define ll long long
#define ld long double
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int,int>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define REPDIS(i,be,en,j) for(int i = (be); i<=(en); i+=j)
#define REPD(i,be,en) for(int i = (be); i>=(en); i--)
#define REP(i,be,en) for(int i = (be); i<=(en); i++)
#define endl "\n"
#define MP make_pair
// #define int ll
//-----------------------------------------------------------------------------------------------//
inline void scan(){} template<typename F, typename... R> inline void scan(F &f,R&... r){cin>>f;scan(r...);}
inline void print(){} template<typename F, typename... R> inline void print(F f,R... r){cout<<f;print(r...);}
//-----------------------------------------------------------------------------------------------//
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
//------------------------------------------------------------------------------------------------//
const ll LINF = 1e18;
const int INF = 1e9;
const int LOG = 20;
const int MAXN = 2e5+7;
const int N = 1e2+3;
const int MOD = 1e9+7;
const int BASE = 1e5;
const ld EPS = 1e-9;
const ld PI = acos(-1);
const int OFFSET = 1e3;
//------------------------------------------------------------------------------------------------//
template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}
template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; }
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; }
//------------------------------------------------------------------------------------------------//
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
*/
struct segment_tree{
multiset<int> tam[MAXN];
int st[MAXN*4];
int n;
void update(int id, int l, int r, int pos, int val){
if(l>pos || r<pos) return ;
if(l==r){
st[id] = val;
return ;
}
int mid = (l+r)>>1;
update(id<<1,l,mid,pos,val);
update(id<<1|1,mid+1,r,pos,val);
st[id] = max(st[id<<1],st[id<<1|1]);
}
int get(int id, int l, int r, int lo, int hi){
if(l>hi || r<lo) return -INF;
if(l>=lo && r<=hi) return st[id];
int mid = (l+r)>>1;
return max(get(id<<1,l,mid,lo,hi),get(id<<1|1,mid+1,r,lo,hi));
}
void update(int pos, int val){
tam[pos].insert(val);
update(1,1,n,pos,*tam[pos].rbegin());
}
void rem(int pos, int val){
tam[pos].erase(tam[pos].find(val));
int x = -INF;
if(SZ(tam[pos])>0) x = *tam[pos].rbegin();
update(1,1,n,pos,x);
}
int get(int l, int r){
return get(1,1,n,l,r);
}
segment_tree(int _n = 0):n(_n){}
};
vi adj[MAXN];
int a[MAXN],res[MAXN],del[MAXN],child[MAXN],n;
segment_tree seg;
int dfs1(int u, int par){
child[u] = 1;
for(int &v:adj[u]){
if(del[v] || v==par) continue;
child[u] += dfs1(v,u);
}
return child[u];
}
int dfs2(int u, int par, int siz){
for(int &v:adj[u]){
if(v==par || del[v]) continue;
if(child[v]*2>siz) return dfs2(v,u,siz);
}
return u;
}
void update(int u, int par, int dis){
seg.update(a[u],dis);
for(int &v:adj[u]){
if(del[v] || v==par) continue;
update(v,u,dis+1);
}
}
void rem(int u, int par, int dis){
seg.rem(a[u],dis);
for(int &v:adj[u]){
if(del[v] || v==par) continue;
rem(v,u,dis+1);
}
}
void rem1(int u, int par){
if(SZ(seg.tam[a[u]])>0){
seg.tam[a[u]].clear();
seg.update(1,1,n,a[u],-INF);
}
for(int &v:adj[u]){
if(del[v] || v==par) continue;
rem1(v,u);
}
}
void solve(int u, int par, int dis){
maxi(res[u],dis+seg.get(a[u],n));
for(int &v:adj[u]){
if(del[v] || v==par) continue;
solve(v,u,dis+1);
}
}
void calc(int u){
int siz = dfs1(u,0);
u = dfs2(u,0,siz);
del[u] = 1;
update(u,0,0);
maxi(res[u],seg.get(a[u],n));
for(int &v:adj[u]){
if(del[v]) continue;
rem(v,u,1);
solve(v,u,1);
update(v,u,1);
}
rem1(u,0);
for(int &v:adj[u]){
if(del[v]) continue;
calc(v);
}
}
void solve(){
cin >> n;
vi compress;
for(int i = 1; i<=n; i++){
cin >> a[i];
compress.push_back(a[i]);
}
sort(ALL(compress));
compress.resize(unique(ALL(compress))-compress.begin());
for(int i = 1; i<=n; i++){
a[i] = upper_bound(ALL(compress),a[i])-compress.begin();
}
for(int i = 1; i<n; i++){
int u,v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
seg = segment_tree(n);
calc(1);
for(int i = 1; i<=n; i++) cout << res[i] << " ";
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define task "test"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
#define task1 "nothing"
if(fopen(task1".inp","r")){
freopen(task1".inp","r",stdin);
freopen(task1".out","w",stdout);
}
int test = 1;
while(test--){
solve();
}
cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";
return 0;
}
/** /\_/\
* (= ._.)
* / >TL \>AC
**/