oj.uz

답안 #1012351

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012351 2024-07-02T03:25:35 Z DucNguyen2007 Mag (COCI16_mag) C++14
24 / 120
 362 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define fi first
#define se second
const int maxN=1e6+5;
const ll inf=2e18;
ll n,a[maxN+1],dp[maxN+1][2];
vector<ll> adj[maxN+1],vec[maxN+1];
void dfs(ll u,ll p)
{
    for(auto v:adj[u])
    {
        if(v!=p)
        {
            vec[u].push_back(v);
        }
    }
    vector<vector<ll>> f(vec[u].size()+1,vector<ll>(2));
    for(int i=0;i<=vec[u].size();i++)
    {
        f[i][0]=f[i][1]=-inf;
    }
    f[0][0]=f[0][1]=(a[u]==1);
    ll mx=0;
    for(int i=0;i<vec[u].size();i++)
    {
        ll v=vec[u][i];
        dfs(v,u);
        if(a[u]!=1)
        {
            f[i+1][0]=f[i+1][1]=0;
        }
        else
        {
            f[i+1][0]=max(f[i][0],dp[v][0]+1);
            f[i+1][1]=max(f[i][1],dp[v][0]+mx);
        }
        mx=max(mx,f[i+1][0]);
    }
    dp[u][0]=f[vec[u].size()][0];
    dp[u][1]=f[vec[u].size()][1];
}
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ld mn=(ld)inf;
    ll sl,val;
    cin>>n;
    for(int i=1;i<n;i++)
    {
        ll u,v;
        cin>>u>>v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        if(mn>a[i])
        {
            mn=a[i];
            val=a[i];
            sl=1;
        }
    }
    dfs(1,0);
    for(int i=1;i<=n;i++)
    {
        ld cur=(ld)1.0*max(dp[i][0],dp[i][1]);
        if(cur==0)
        {
            continue;
        }
        ld tmp=(ld)1.0*1/cur;
        //cout<<i<<" "<<cur<<'\n';
        if(mn>tmp)
        {
            mn=tmp;
            val=1;
            sl=max(dp[i][0],dp[i][1]);
        }
    }
    cout<<val<<"/"<<sl;
}

Compilation message

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

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 49756 KB Output is correct
2 Correct 8 ms 49756 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 49752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 347 ms 232296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 49756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 327 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 332 ms 148708 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 286 ms 163888 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 58704 KB Output is correct
2 Incorrect 362 ms 150564 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 277 ms 148316 KB Output is correct
2 Incorrect 309 ms 149540 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 298 ms 150356 KB Output is correct
2 Correct 216 ms 97732 KB Output is correct