제출 #247073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
247073		MKopchev	Untitled (POI11_ins)	C++14	100 / 100	1606 ms	127180 KiB

Main

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

const int nmax=1e6+42;

int n;
vector<int> adj[nmax];

long long sum=0;

int SZ[nmax];

int mx_depth[nmax];

int subtree[nmax];
int h[nmax];

void dfs_main(int node,int par,int d)
{
    h[node]=d;
    subtree[node]=1;

    for(auto k:adj[node])
        if(k!=par)
        {
            dfs_main(k,node,d+1);
            subtree[node]+=subtree[k];
        }
}
void dfs(int node,int par,int d)
{
    sum+=2*d;
    mx_depth[node]=d;

    SZ[node]=1;

    for(auto k:adj[node])
        if(k!=par)
        {
            dfs(k,node,d+1);
            SZ[node]+=SZ[k];
            mx_depth[node]=max(mx_depth[node],mx_depth[k]);
        }
}
long long ask(int node)
{
    sum=0;

    dfs(node,0,0);

    for(auto w:adj[node])
        if(SZ[w]*2==SZ[node])return sum-mx_depth[w];

    return sum-mx_depth[node];
}
int main()
{
    scanf("%i",&n);

    int u,v;

    for(int i=1;i<n;i++)
    {
        scanf("%i%i",&u,&v);
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    dfs_main(1,0,0);

    for(int i=1;i<=n;i++)
    {
        int MX=0;
        for(auto k:adj[i])
            if(h[i]<h[k])MX=max(MX,subtree[k]);
            else MX=max(MX,n-subtree[i]);

        if(2*MX>n)printf("-1\n");
        else printf("%lld\n",ask(i));
    }

    return 0;
}

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

ins.cpp: In function 'int main()':
ins.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&n);
     ~~~~~^~~~~~~~~
ins.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i",&u,&v);
         ~~~~~^~~~~~~~~~~~~~

• 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: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10