oj.uz

답안 #1028599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028599 2024-07-20T05:49:33 Z MMihalev Torrent (COI16_torrent) C++14
31 / 100
 2000 ms 24928 KB 
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<tuple>
#include<set>
#include<map>
#include<random>
#include<chrono>
#include<array>
using namespace std;
const int MAX_N=3e5+5;
vector<int>g[MAX_N];
int a,b;
int n;
int parent[MAX_N];
bool used[MAX_N];
void initdfs(int u,int par)
{
    for(int v:g[u])
    {
        if(v==par)continue;
        parent[v]=u;
        initdfs(v,u);
    }
}
void paint(int u)
{
    used[u]=1;
    for(int v:g[u])
    {
        if(v==parent[u])continue;
        paint(v);
    }
}
int dfs(int u,int par,bool wh)
{
    vector<int>mins;
    for(int v:g[u])
    {
        if(v==par or used[v]!=wh)continue;
        mins.push_back(dfs(v,u,wh));
    }
    if(mins.size()==0)return 0;
    sort(mins.rbegin(),mins.rend());
    int ans=0;
    for(int i=0;i<mins.size();i++)
    {
        ans=max(ans,mins[i]+i+1);
    }
    return ans;
}
signed main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>a>>b;
    for(int i=1;i<n;i++)
    {
        int u,v;
        cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    initdfs(a,0);
    int u=b;
    int ans=1e9;
    int z=-1;
    while(u!=a)
    {
        paint(u);
        ans=min(ans,max(dfs(a,0,0),dfs(b,0,1)));
        if(dfs(a,0,0)>dfs(b,0,1))
        {
            if(z!=0 && z!=-1)break;
            z=0;
        }
        else
        {
            if(z!=1 && z!=-1)break;
            z=1;
        }
        u=parent[u];
    }
    cout<<ans<<"\n";
    return 0;
}

Compilation message

torrent.cpp: In function 'int dfs(int, int, bool)':
torrent.cpp:51:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i=0;i<mins.size();i++)
      |                 ~^~~~~~~~~~~~

Subtask #1
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8792 KB Output is correct
2 Correct 5 ms 8796 KB Output is correct
3 Correct 7 ms 8800 KB Output is correct

Subtask #2
0 / 69.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2057 ms 24928 KB Time limit exceeded
2 Halted 0 ms 0 KB -