제출 #295029

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
295029		thebes	무제 (POI11_ins)	C++14	70 / 100	1713 ms	131076 KiB

Main

#include <bits/stdc++.h>
using namespace std;

const int MN = 1e6+5;
int N, i, x, y, sz[MN], zs[MN], md[MN], mx[MN];
vector<int> adj[MN], dis;
long long ans[MN];

int dfs(int n,int p){
    sz[n] = 1;
    for(auto v : adj[n]){
        if(v==p) continue;
        sz[n] += dfs(v, n);
        mx[n] = max(mx[n], sz[v]);
    }
    return sz[n];
}

void acc(int n,int p,int d,int r){
    dis.push_back(d);
    md[r] = max(md[r], d);
    zs[r] ++;
    for(auto v : adj[n]){
        if(v==p) continue;
        acc(v, n, d+1, r);
    }
}

void dfs2(int n,int p){
    if(2*mx[n]<=N&&2*(N-sz[n])<=N){
        dis.clear();
        int mx = 0, hm = 0;
        for(auto v : adj[n]){
            zs[v] = md[v] = 0;
            acc(v, n, 1, v);
            if(zs[v]>N-zs[v]-1){
                hm = 1;
                mx = md[v];
            }
        }
        for(auto v : dis){
            ans[n] += 2*v;
            if(!hm) mx = max(mx, v);
        }
        ans[n] -= mx;
    }
    else ans[n] = -1;
    for(auto v : adj[n]){
        if(v==p) continue;
        dfs2(v, n);
    }
}

int main(){
    scanf("%d",&N);
    for(i=1;i<N;i++){
        scanf("%d%d",&x,&y);
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    dfs(1, 0); dfs2(1, 0);
    for(i=1;i<=N;i++)
        printf("%lld\n",ans[i]);
    return 0;
}

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

ins.cpp: In function 'int main()':
ins.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |     scanf("%d",&N);
      |     ~~~~~^~~~~~~~~
ins.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   57 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10