제출 #1280063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280063		sasde	Unique Cities (JOI19_ho_t5)	C++20	64 / 100	534 ms	58272 KiB

joi2019_ho_t5

#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time   cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
 return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int h[N],node,m,S,T,c[N],dp[N],ans[N];

struct segsum {
    int n;
    vector<ii> st;
    ii merge(ii u,ii v){
        ii t;
        if(v.fi==u.fi)t={u.fi,u.se+v.se};
        if(v.fi>u.fi)t=u;
        if(v.fi<u.fi)t=v;
        return t;
    }
    vector<int> lazy;
    segsum() {};
    segsum(int _n): n(_n), st(n * 4 + 5), lazy(n * 4 + 5, 0) {};
    void build(int id, int l, int r) {
        if (l == r) {
            st[id] = {0,1};
            return;
        }
        int mid = (l + r) >> 1;
        build(id << 1, l, mid);
        build(id << 1 | 1, mid + 1, r);
        st[id] = merge(st[id << 1] , st[id << 1 | 1]);
    }

    void down(int id, int l, int r) {
        if (lazy[id] == 0) return;
        int mid = (l + r) >> 1;
        lazy[id << 1] += lazy[id];
        lazy[id << 1 | 1] += lazy[id];
        st[id << 1].fi += lazy[id] ;
        st[id << 1 | 1].fi += lazy[id] ;
        lazy[id] = 0;
    }

    void update(int id, int l, int r, int u, int v, int val) {
        if (r < u || l > v||u>v) return;
        if (l >= u && r <= v) {
            st[id].fi += val;
            lazy[id] += val;
            return;
        }
        down(id, l, r);
        int mid = (l + r) >> 1;
        update(id << 1, l, mid, u, v, val);
        update(id << 1 | 1, mid + 1, r, u, v, val);
        st[id] =merge( st[id << 1] , st[id << 1 | 1]);
    }

    ii get(int id, int l, int r, int u, int v) {
        if (r < u || l > v) return {1e9,1e9};
        if (l >= u && r <= v) return st[id];
        down(id, l, r);
        int mid = (l + r) >> 1;
        return merge(get(id << 1, l, mid, u, v) , get(id << 1 | 1, mid + 1, r, u, v));
    }
}seg;

vector<int>ver[N];
void dfs(int u,int cha){
    dp[u]=0;
    for(auto v:ver[u]){
        if(v==cha)continue;
        h[v]=h[u]+1;
        dfs(v,u);
        dp[u]=max(dp[u],dp[v]+1);
    }
}
void find(){
    dfs(1,-1);
    S=T=1;
    for(int i=1;i<=node;++i){
        if(h[S]<h[i])S=i;
    }
    h[S]=0;
    dfs(S,-1);
    for(int i=1;i<=node;++i){
        if(h[T]<h[i])T=i;
    }
}
void tinh(int u,int cha){
    if(dp[u]<h[u]){
        ii x=seg.get(1,1,node,1,h[u]-dp[u]);
        if(x.fi==0)
        ans[u]=max(ans[u],x.se);
    }
    vector<int>tab;
    tab.emb(-1);
    int max1=0,max2=0;
    for(auto v:ver[u]){
        if(v==cha)continue;
        if(dp[max1]<dp[v]){
            max2=max1;
            max1=v;
        }
        else if(dp[max2]<dp[v])max2=v;
    }
    if(max1){
            seg.update(1,1,node,h[u]-dp[max2],h[u],1);
            tinh(max1,u);
            seg.update(1,1,node,h[u]-dp[max2],h[u],-1);

    }
    for(auto v:ver[u]){
        if(v==cha||v==max1)continue;
        int x=dp[max1];
        if(x!=-1){
            seg.update(1,1,node,h[u]-dp[max1],h[u],1);
        }
        tinh(v,u);
        if(x!=-1){
            seg.update(1,1,node,h[u]-dp[max1],h[u],-1);
        }
    }
}
void giai(int S){
    h[S]=0;
    seg=segsum(node);
    seg.build(1,1,node);
    dfs(S,-1);
    tinh(S,-1);
}
bool M2;
void solve(){
    cin >> node >> m;
    for(int i=1;i<node;++i){
        int u,v;
        cin >> u >> v;
        ver[u].emb(v);
        ver[v].emb(u);
    }
    dp[0]=-1;
    for(int i=1;i<=node;++i)cin >> c[i];
    find();
    giai(S);
    // cout<<'\n';
    giai(T);
    for(int i=1;i<=node;++i)cout << (m==1?(ans[i]>0):ans[i])<<"\n";
}
main()
{
  srand(time(0));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    #define task "aws"
    if(fopen(task".inp","r")){
      freopen(task".inp","r",stdin);
      freopen(task".out","w",stdout);
    }
    int t=1;
 //   cin >> t;
while(t--){
    solve();
}
look_memory;
look_time;
}

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t5.cpp:171:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  171 | main()
      | ^~~~
joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:179:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  179 |       freopen(task".inp","r",stdin);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:180:14: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  180 |       freopen(task".out","w",stdout);
      |       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 32 / 32
• Subtask 3: 32 / 32
• Subtask 4: 0 / 32