oj.uz

Submission #546191

# Submission time Handle Problem Language Result Execution time Memory
546191 2022-04-06T15:44:03 Z Deepesson Power Plant (JOI20_power) C++17
47 / 100
 95 ms 12408 KB 
#include <bits/stdc++.h>
#define MAX 205000LL
typedef std::pair<int,int> pii;
std::vector<pii> con[MAX];
std::string valores;
bool existe[MAX*2];
int tab[MAX*2];
int count=0;
int explora(long long pos,long long prev,int ind){
    if(existe[ind])return tab[ind];
    existe[ind]=true;
    count++;
    int ans=0;
    if(valores[pos]=='1')ans=1;
    int soma=0;
    for(auto&x:con[pos]){
        if(x.first==prev)continue;
        soma+=explora(x.first,pos,x.second);
    }
    if(valores[pos]=='1')--soma;
    return tab[ind]=std::max(ans,soma);
}

int N;
int ans=0;
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);
    int cur=0;
    std::cin>>N;
    for(int i=1;i!=N;++i){
        int a,b;
        std::cin>>a>>b;
        --a;--b;
        con[a].push_back({b,cur++});
        con[b].push_back({a,cur++});
    }
    if(N==2e5)return 0;
    std::cin>>valores;
    for(int i=0;i!=N;++i){
        int tot=0;
        int other=0;
        for(auto&x:con[i]){
            int b = explora(x.first,i,x.second);
            if(valores[i]=='1')other=std::max(other,b+1);
            tot+=b;
        }
        assert(count<MAX*2);
        if(valores[i]=='1'){
            --tot;
            tot=std::max(tot,1);
        }
        ans=std::max(ans,tot);
        ans=std::max(ans,other);
    }
    assert(ans);
    std::cout<<ans<<"\n";
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 2 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 2 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5204 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 3 ms 5204 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5204 KB Output is correct
27 Correct 4 ms 5204 KB Output is correct
28 Correct 3 ms 5204 KB Output is correct
29 Correct 3 ms 5332 KB Output is correct
30 Correct 3 ms 5332 KB Output is correct
31 Correct 4 ms 5224 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5204 KB Output is correct
34 Correct 3 ms 5204 KB Output is correct
35 Correct 3 ms 5204 KB Output is correct
36 Correct 3 ms 5204 KB Output is correct
37 Correct 5 ms 5204 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5204 KB Output is correct
40 Correct 4 ms 5204 KB Output is correct
41 Correct 3 ms 5204 KB Output is correct
42 Correct 4 ms 5204 KB Output is correct
43 Correct 4 ms 5204 KB Output is correct
44 Correct 3 ms 5204 KB Output is correct
45 Correct 3 ms 5204 KB Output is correct
46 Correct 3 ms 5204 KB Output is correct
47 Correct 4 ms 5204 KB Output is correct
48 Correct 5 ms 5332 KB Output is correct
49 Correct 4 ms 5332 KB Output is correct
50 Correct 3 ms 5204 KB Output is correct
51 Correct 3 ms 5204 KB Output is correct
52 Correct 3 ms 5204 KB Output is correct
53 Correct 3 ms 5204 KB Output is correct
54 Correct 3 ms 5204 KB Output is correct
55 Correct 3 ms 5204 KB Output is correct
56 Correct 10 ms 5204 KB Output is correct
57 Correct 3 ms 5332 KB Output is correct
58 Correct 9 ms 5204 KB Output is correct
59 Correct 9 ms 5204 KB Output is correct
60 Correct 4 ms 5268 KB Output is correct
61 Correct 11 ms 5176 KB Output is correct
62 Correct 3 ms 5332 KB Output is correct
63 Correct 4 ms 5204 KB Output is correct

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 2 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5204 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 3 ms 5204 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5204 KB Output is correct
27 Correct 4 ms 5204 KB Output is correct
28 Correct 3 ms 5204 KB Output is correct
29 Correct 3 ms 5332 KB Output is correct
30 Correct 3 ms 5332 KB Output is correct
31 Correct 4 ms 5224 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5204 KB Output is correct
34 Correct 3 ms 5204 KB Output is correct
35 Correct 3 ms 5204 KB Output is correct
36 Correct 3 ms 5204 KB Output is correct
37 Correct 5 ms 5204 KB Output is correct
38 Correct 4 ms 5204 KB Output is correct
39 Correct 4 ms 5204 KB Output is correct
40 Correct 4 ms 5204 KB Output is correct
41 Correct 3 ms 5204 KB Output is correct
42 Correct 4 ms 5204 KB Output is correct
43 Correct 4 ms 5204 KB Output is correct
44 Correct 3 ms 5204 KB Output is correct
45 Correct 3 ms 5204 KB Output is correct
46 Correct 3 ms 5204 KB Output is correct
47 Correct 4 ms 5204 KB Output is correct
48 Correct 5 ms 5332 KB Output is correct
49 Correct 4 ms 5332 KB Output is correct
50 Correct 3 ms 5204 KB Output is correct
51 Correct 3 ms 5204 KB Output is correct
52 Correct 3 ms 5204 KB Output is correct
53 Correct 3 ms 5204 KB Output is correct
54 Correct 3 ms 5204 KB Output is correct
55 Correct 3 ms 5204 KB Output is correct
56 Correct 10 ms 5204 KB Output is correct
57 Correct 3 ms 5332 KB Output is correct
58 Correct 9 ms 5204 KB Output is correct
59 Correct 9 ms 5204 KB Output is correct
60 Correct 4 ms 5268 KB Output is correct
61 Correct 11 ms 5176 KB Output is correct
62 Correct 3 ms 5332 KB Output is correct
63 Correct 4 ms 5204 KB Output is correct
64 Incorrect 95 ms 12408 KB Output isn't correct
65 Halted 0 ms 0 KB -