답안 #735436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
735436 2023-05-04T06:31:21 Z alexdd Power Plant (JOI20_power) C++17
6 / 100
5 ms 5076 KB
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> con[200005];
int dp[200005];
bool iss[200005];
int mxm=0;
void dfs(int nod, int par)
{
    int sum=0,cntc=0;
    for(auto adj:con[nod])
    {
        if(adj!=par)
        {
            dfs(adj,nod);
            sum += dp[adj];
            cntc++;
        }
    }
    if(iss[nod])
    {
        dp[nod]=max(1, sum-1);
        if(cntc==1)
            mxm = max(mxm, sum+1);
    }
    else
    {
        dp[nod]=sum;
    }
    mxm = max(mxm, dp[nod]);
    //cout<<nod<<" "<<dp[nod]<<"\n";
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int a,b;
    cin>>n;
    for(int i=1;i<n;i++)
    {
        cin>>a>>b;
        con[a].push_back(b);
        con[b].push_back(a);
    }
    int cnt1=0;
    char ch;
    for(int i=1;i<=n;i++)
    {
        cin>>ch;
        if(ch=='1')
            iss[i]=1;
        else
            iss[i]=0;
        if(iss[i])
            cnt1++;
    }
    dfs(1,0);
    cout<<mxm;
    return 0;
}
/**

dp[i] = scorul maxim pe care il putem obtine daca nu avem nicio statie stricata

*/
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4928 KB Output is correct
4 Correct 5 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 4 ms 5024 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 5 ms 5028 KB Output is correct
14 Correct 4 ms 4948 KB Output is correct
15 Correct 4 ms 5024 KB Output is correct
16 Correct 3 ms 5024 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 5020 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4928 KB Output is correct
4 Correct 5 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 4 ms 5024 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 5 ms 5028 KB Output is correct
14 Correct 4 ms 4948 KB Output is correct
15 Correct 4 ms 5024 KB Output is correct
16 Correct 3 ms 5024 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 5020 KB Output is correct
22 Incorrect 4 ms 5076 KB Output isn't correct
23 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 5024 KB Output is correct
3 Correct 3 ms 4928 KB Output is correct
4 Correct 5 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 4 ms 5024 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 5 ms 5028 KB Output is correct
14 Correct 4 ms 4948 KB Output is correct
15 Correct 4 ms 5024 KB Output is correct
16 Correct 3 ms 5024 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 5020 KB Output is correct
22 Incorrect 4 ms 5076 KB Output isn't correct
23 Halted 0 ms 0 KB -