oj.uz

답안 #614062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
614062 2022-07-30T17:42:43 Z HediChehaidar Power Plant (JOI20_power) C++17
47 / 100
 123 ms 5304 KB 
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define dte  tuple<double , double , double>
using namespace std;
const int INF = 1000*1000*1000; // 1 e 9
const int MOD = 1e9 + 7;//998244353 ;
const double EPS = 0.000000001; // 1 e -9
const ll inf = (ll)1e18;

int n;
vi adj[(int)2e5 + 10];
int p[(int)2e5 + 10];
int down[(int)2e5 + 10];
bool add[(int)2e5 + 10];
int s[(int)2e5 + 10];
int sub[(int)2e5 + 10];

int ans = 0;
void dfs(int pos , int par){
    sub[pos] = s[pos];
    for(auto c : adj[pos]){
        if(c != par){
            dfs(c , pos);
            sub[pos] += sub[c];
        }
    }
    if(sub[pos] == 1) {
        down[pos] = 1; return ;
    }
    for(auto c : adj[pos]){
        if(c != par){
            if(sub[c] == sub[pos]){
                down[pos] = down[c]; add[pos] = add[c]; return;
            }
            if(s[pos] && sub[pos] == sub[c] + 1){
                add[pos] = true;
                down[pos] = down[c] + 1 - add[c];
                ans = max(ans , down[pos] );
                if(down[pos] != 2) down[pos]--;
                return;
            }
            down[pos] += down[c];
            if(add[c]) down[pos]--;
        }
    }
    if(s[pos]) down[pos]--;
}
int main(){
    //ifstream fin ("testing.txt");
    //ofstream fout ("output.txt");
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n;
    if(n > 2020) return 0;
    for(int i = 0 ; i < n - 1 ; i++){
        int a , b; cin>>a>>b; adj[a].pb(b); adj[b].pb(a);
    }
    /*for(int i = 1 ; i <= n ; i++) {
        cout << i << " : "; for(auto c : adj[i]) cout << c << " ";
        cout << "\n";
    }*/
    string ch; cin>>ch; for(int i = 1 ; i <= n ; i++) s[i] = ch[i - 1] == '1';
    for(int i = 1 ; i <= n ; i++){
        for(int j = 1 ; j <= n ; j++){
            add[j] = false; down[j] = sub[j] = 0;
        }
        dfs(i , 0);
        for(int j = 1 ; j <= n ; j++) ans = max(ans , down[j]);
        //if(i == 1) for(int j = 1 ; j <= n ; j++) cout << down[j] << " ";
        //cout << ans << "\n";
    }
    cout << ans << "\n";
    return 0;
}

/*
    Think of : BS / DFS / BFS / SSSP / SCC / MSP / MAX FLOW / TOPSORT / LCA / MATRIX / DP(bitmask) / 2 POINTERS / SEG TREE / MATH / UN FIND / MO / HLD
    Read the statement CAREFULLY !!
    Make a GREADY APPROACH !!!! (start from highest / lowest)
    Make your own TESTS !!
    Be careful from CORNER CASES !
*/

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4912 KB Output is correct
3 Correct 3 ms 5040 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4920 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 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 4 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct

Subtask #2
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4912 KB Output is correct
3 Correct 3 ms 5040 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4920 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 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 4 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 98 ms 5112 KB Output is correct
23 Correct 103 ms 5112 KB Output is correct
24 Correct 103 ms 5116 KB Output is correct
25 Correct 102 ms 5108 KB Output is correct
26 Correct 98 ms 5076 KB Output is correct
27 Correct 90 ms 5116 KB Output is correct
28 Correct 82 ms 5124 KB Output is correct
29 Correct 108 ms 5292 KB Output is correct
30 Correct 123 ms 5292 KB Output is correct
31 Correct 79 ms 5076 KB Output is correct
32 Correct 91 ms 5120 KB Output is correct
33 Correct 99 ms 5116 KB Output is correct
34 Correct 101 ms 5076 KB Output is correct
35 Correct 95 ms 5076 KB Output is correct
36 Correct 87 ms 5076 KB Output is correct
37 Correct 80 ms 5120 KB Output is correct
38 Correct 92 ms 5108 KB Output is correct
39 Correct 113 ms 5204 KB Output is correct
40 Correct 122 ms 5204 KB Output is correct
41 Correct 112 ms 5204 KB Output is correct
42 Correct 118 ms 5152 KB Output is correct
43 Correct 107 ms 5076 KB Output is correct
44 Correct 89 ms 5168 KB Output is correct
45 Correct 88 ms 5148 KB Output is correct
46 Correct 88 ms 5148 KB Output is correct
47 Correct 87 ms 5144 KB Output is correct
48 Correct 86 ms 5212 KB Output is correct
49 Correct 105 ms 5204 KB Output is correct
50 Correct 81 ms 5076 KB Output is correct
51 Correct 80 ms 5152 KB Output is correct
52 Correct 90 ms 5076 KB Output is correct
53 Correct 81 ms 5172 KB Output is correct
54 Correct 84 ms 5156 KB Output is correct
55 Correct 86 ms 5136 KB Output is correct
56 Correct 62 ms 5076 KB Output is correct
57 Correct 107 ms 5292 KB Output is correct
58 Correct 58 ms 5120 KB Output is correct
59 Correct 52 ms 5120 KB Output is correct
60 Correct 99 ms 5304 KB Output is correct
61 Correct 55 ms 5116 KB Output is correct
62 Correct 104 ms 5292 KB Output is correct
63 Correct 73 ms 5076 KB Output is correct

Subtask #3
0.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4912 KB Output is correct
3 Correct 3 ms 5040 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 2 ms 4920 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 4948 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 4 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 98 ms 5112 KB Output is correct
23 Correct 103 ms 5112 KB Output is correct
24 Correct 103 ms 5116 KB Output is correct
25 Correct 102 ms 5108 KB Output is correct
26 Correct 98 ms 5076 KB Output is correct
27 Correct 90 ms 5116 KB Output is correct
28 Correct 82 ms 5124 KB Output is correct
29 Correct 108 ms 5292 KB Output is correct
30 Correct 123 ms 5292 KB Output is correct
31 Correct 79 ms 5076 KB Output is correct
32 Correct 91 ms 5120 KB Output is correct
33 Correct 99 ms 5116 KB Output is correct
34 Correct 101 ms 5076 KB Output is correct
35 Correct 95 ms 5076 KB Output is correct
36 Correct 87 ms 5076 KB Output is correct
37 Correct 80 ms 5120 KB Output is correct
38 Correct 92 ms 5108 KB Output is correct
39 Correct 113 ms 5204 KB Output is correct
40 Correct 122 ms 5204 KB Output is correct
41 Correct 112 ms 5204 KB Output is correct
42 Correct 118 ms 5152 KB Output is correct
43 Correct 107 ms 5076 KB Output is correct
44 Correct 89 ms 5168 KB Output is correct
45 Correct 88 ms 5148 KB Output is correct
46 Correct 88 ms 5148 KB Output is correct
47 Correct 87 ms 5144 KB Output is correct
48 Correct 86 ms 5212 KB Output is correct
49 Correct 105 ms 5204 KB Output is correct
50 Correct 81 ms 5076 KB Output is correct
51 Correct 80 ms 5152 KB Output is correct
52 Correct 90 ms 5076 KB Output is correct
53 Correct 81 ms 5172 KB Output is correct
54 Correct 84 ms 5156 KB Output is correct
55 Correct 86 ms 5136 KB Output is correct
56 Correct 62 ms 5076 KB Output is correct
57 Correct 107 ms 5292 KB Output is correct
58 Correct 58 ms 5120 KB Output is correct
59 Correct 52 ms 5120 KB Output is correct
60 Correct 99 ms 5304 KB Output is correct
61 Correct 55 ms 5116 KB Output is correct
62 Correct 104 ms 5292 KB Output is correct
63 Correct 73 ms 5076 KB Output is correct
64 Incorrect 2 ms 4948 KB Output isn't correct
65 Halted 0 ms 0 KB -