結果
| 問題 |
No.1002 Twotone
|
| コンテスト | |
| ユーザー |
 沙耶花
|
| 提出日時 | 2021-03-04 22:52:49 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,862 ms / 5,000 ms |
| コード長 | 6,177 bytes |
| コンパイル時間 | 3,681 ms |
| コンパイル使用メモリ | 244,920 KB |
| 最終ジャッジ日時 | 2025-01-19 10:13:00 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 33 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:263:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
263 | scanf("%d %d %d",&u,&v,&c);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000
struct Data{
array<int,3> a;
Data(){
rep(i,3)a[i] = Inf;
}
void add(int x){
if(x==Inf)return;
rep(i,3){
if(a[i]==x)return;
}
rep(i,3){
if(a[i]==Inf){
a[i] = x;
break;
}
}
sort(a.begin(),a.end());
}
};
template <class S, S (*op)(S, S), S (*e)()>
struct sparse_table{
vector<S> v;
int _n;
int sz;
sparse_table() : sparse_table(0) {}
sparse_table(int n) : sparse_table(std::vector<S>(n, e())) {}
sparse_table(const std::vector<S>& x) : _n(int(x.size())) {
sz = x.size();
for(int i=0;true;i++){
if((1<<i)>_n){
sz = i;
break;
}
}
v.resize(sz*_n,e());
for(int i=0;i<_n;i++){
v[i] = x[i];
}
for(int i=1;i<sz;i++){
for(int j=0;j<_n+1-(1<<i);j++){
int temp = j+(1<<(i-1));
v[i*_n+j] = op(v[(i-1)*_n+j],v[(i-1)*_n+temp]);
}
}
}
S prod(int l,int r){
int x = 31-__builtin_clz(r-l);
return op(v[_n*x+l],v[_n*x+r-(1<<x)]);
}
};
struct centroid_tree{
vector<vector<int>> E;
vector<int> cnt;
int r;
vector<int> pos;
vector<vector<int>> bind;
vector<int> ind;
vector<pair<int,int>> par;
centroid_tree(vector<vector<int>> argE){
int n = argE.size();
E.resize(n,vector<int>());
cnt.resize(n);
r = go(0,argE);
pos.resize(n);
bind.resize(n);
par.resize(n,make_pair(-1,-1));
dfs(r,-1,E);
build(r,0);
}
int go(int a,vector<vector<int>> &argE){
dfs(a,-1,argE);
int sz = cnt[a];
int ret = dfs2(a,-1,argE,sz);
rep(i,argE[ret].size()){
int to = argE[ret][i];
argE[to].erase(find(argE[to].begin(),argE[to].end(),ret));
int g = go(to,argE);
E[ret].push_back(g);
}
argE[ret].clear();
return ret;
}
void dfs(int cur,int p,vector<vector<int>> &argE){
cnt[cur] = 1;
rep(i,argE[cur].size()){
int to = argE[cur][i];
if(to==p)continue;
dfs(to,cur,argE);
cnt[cur] += cnt[to];
}
}
int dfs2(int cur,int p,vector<vector<int>> &argE,int sz){
int ret = -1;
int m = 0;
rep(i,argE[cur].size()){
int to = argE[cur][i];
if(to==p)continue;
ret = dfs2(to,cur,argE,sz);
if(ret!=-1)return ret;
m = max(m,cnt[to]);
}
if(sz-cnt[cur]<=sz/2 && m<=sz/2){
ret = cur;
}
return ret;
}
void build(int cur,int d){
int x = cur;
pos[cur] = ind.size();
bind[cur].push_back(ind.size());
ind.push_back(cur);
rep(i,E[cur].size()){
int to = E[cur][i];
int x = to;
bind[cur].push_back(ind.size());
par[to] = make_pair(cur,i+1);
build(to,d+1);
}
bind[cur].push_back(ind.size());
}
};
struct HLD{
vector<int> sz,parent,depth,root,pos;
vector<int> arr;
HLD(vector<vector<int>> &E){
sz.resize(E.size(),1);
parent.resize(E.size(),0);
depth.resize(E.size(),0);
root.resize(E.size(),0);
pos.resize(E.size(),0);
dfs(0,-1,E);
dfs2(0,-1,E,0);
}
void dfs(int now,int p,vector<vector<int>> &E){
parent[now] = p;
if(p==-1){
depth[now] = 0;
}
else{
depth[now] = depth[p]+1;
}
for(int i=0;i<E[now].size();i++){
int to = E[now][i];
if(to==p)continue;
dfs(to,now,E);
sz[now] += sz[to];
}
}
void dfs2(int now,int p,vector<vector<int>> &E,int r){
pos[now] = arr.size();
arr.push_back(now);
root[now] = r;
int maxi = 0;
int ind = -1;
for(int i=0;i<E[now].size();i++){
int to = E[now][i];
if(to==p)continue;
if(maxi<sz[to]){
maxi = sz[to];
ind = to;
}
}
if(ind==-1)return;
dfs2(ind,now,E,r);
for(int i=0;i<E[now].size();i++){
int to = E[now][i];
if(to==p||to==ind)continue;
dfs2(to,now,E,to);
}
}
vector<pair<int,int>> query(int u,int v){
vector<pair<int,int>> ret;
int t = 0;
while(root[u]!=root[v]){
if(depth[root[u]] <= depth[root[v]]){
ret.insert(ret.begin()+t,{pos[root[v]], pos[v]});
v = parent[root[v]];
}
else{
ret.insert(ret.begin()+t,{pos[u],pos[root[u]]});
u = parent[root[u]];
t++;
}
}
ret.insert(ret.begin()+t,{pos[u],pos[v]});
return ret;
}
int lca(int u,int v){
for(;;v=parent[root[v]]){
if(pos[u]>pos[v])swap(u,v);
if(root[u]==root[v])return u;
}
}
int get_distance(int u,int v){
return depth[u] + depth[v] - 2 * depth[lca(u,v)];
}
};
Data op(Data a,Data b){
rep(i,3){
a.add(b.a[i]);
}
return a;
}
Data e(){
return Data();
}
int main(){
int n,k;
cin>>n>>k;
vector<Data> D(2*n-1);
vector<vector<int>> E(n);
vector<vector<int>> E2(2*n-1);
rep(i,n-1){
int u,v,c;
scanf("%d %d %d",&u,&v,&c);
u--;v--;c--;
E[u].push_back(v);
E[v].push_back(u);
E2[u].push_back(n+i);
E2[v].push_back(n+i);
E2[n+i].push_back(u);
E2[n+i].push_back(v);
D[n+i].add(c);
}
HLD H(E2);
{
vector<Data> D2(2*n-1);
rep(i,2*n-1){
D2[H.pos[i]] = D[i];
}
swap(D,D2);
}
centroid_tree C(E);
sparse_table<Data,op,e> seg(D);
long long ans = 0LL;
rep(i,n){
long long cnt1all = 0LL;
map<int,long long> cnt1,cnt2;
map<pair<int,int>,long long> cntp;
long long I = 0LL;
rep(j,C.bind[i].size()-1){
vector<Data> V;
for(int k=C.bind[i][j];k<C.bind[i][j+1];k++){
auto r = H.query(i,C.ind[k]);
Data t;
rep(l,r.size()){
int a = r[l].first,b = r[l].second;
if(a>b)swap(a,b);
t = op(t,seg.prod(a,b+1));
}
V.push_back(t);
}
rep(k,V.size()){
if(V[k].a[0]==Inf)continue;
if(V[k].a.back()!=Inf)continue;
if(V[k].a[1]==Inf){
int x = V[k].a[0];
ans += cnt1all;
if(cnt1.count(x))ans -= cnt1[x];
if(cnt2.count(x))ans += cnt2[x];
}
else{
int x = V[k].a[0],y = V[k].a[1];
ans += I;
if(cnt1.count(x))ans += cnt1[x];
if(cnt1.count(y))ans += cnt1[y];
if(cntp.count(make_pair(x,y)))ans += cntp[make_pair(x,y)];
}
}
rep(k,V.size()){
if(V[k].a[0]==Inf){
I++;
continue;
}
if(V[k].a.back()!=Inf)continue;
if(V[k].a[1]==Inf){
int x = V[k].a[0];
cnt1[x]++;
cnt1all++;
}
else{
int x = V[k].a[0],y = V[k].a[1];
cnt2[x]++;
cnt2[y]++;
cntp[make_pair(x,y)]++;
}
}
}
}
cout<<ans<<endl;
return 0;
}