oj.uz

답안 #773019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
773019 2023-07-04T14:06:53 Z davitmarg Power Plant (JOI20_power) C++17
47 / 100
 1468 ms 38888 KB 
/*
DavitMarg
In pr honky-tonk,
Down in Mexico
*/
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <random>
#include <chrono>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair    
#define PB push_back
#define all(v) v.begin(), v.end()
#define fastIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;

const int N = 500005;

int n;
string s;
vector<int> g[N];
int dp[N];

int dfs(int v, int p, bool start = false)
{
    dp[v] = s[v] - '0';
    int sum = 0;
    int mx = 0;
    for(int i = 0; i < g[v].size(); i++)
    {
        int to = g[v][i];
        if(to == p)
            continue;
        sum += dfs(to, v);
        mx = max(dp[to], mx);
    }
    dp[v] = max(dp[v], sum - (s[v] - '0'));
    if(start)
        dp[v] = max(dp[v], (s[v] - '0') + mx);
    return dp[v];
}

LL myRand()
{
    return ((LL)rand() << 16) + rand();
}

void solve()
{
    cin >> n;
    for(int i = 1; i <= n - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        g[a].PB(b);
        g[b].PB(a);
    }
    cin>>s;
    s = '#' + s;
    int ans = 0;

    vector<int> p;
    for(int i = 1; i <= n; i++)
        if(s[i] == '1')
            p.PB(i);

    srand(69);
    int k = 2000;

    if(n > 5000)
        k = 39;

    for(int i = 0; i < k; i++)
    {
        int v = p[myRand() % p.size()];
        ans = max(ans, dfs(v, -1, true));
    }
    cout<<ans<<endl;
}

int main()
{
    fastIO;
    int T = 1;
    //cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}

/*


cd /mnt/d/Davit/Projects/VSCode; g++ -std=c++17 -O2 -Wall -Wextra -Ddeath -Wshadow source.cpp -o orz; ./orz; rm orz

*/

Compilation message

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 12064 KB Output is correct
5 Correct 6 ms 12032 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 5 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 6 ms 12024 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 7 ms 11984 KB Output is correct
13 Correct 6 ms 12072 KB Output is correct
14 Correct 6 ms 12052 KB Output is correct
15 Correct 7 ms 11988 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct
17 Correct 7 ms 11988 KB Output is correct
18 Correct 6 ms 11988 KB Output is correct
19 Correct 6 ms 11988 KB Output is correct
20 Correct 6 ms 11988 KB Output is correct
21 Correct 6 ms 11996 KB Output is correct

Subtask #2
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 12064 KB Output is correct
5 Correct 6 ms 12032 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 5 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 6 ms 12024 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 7 ms 11984 KB Output is correct
13 Correct 6 ms 12072 KB Output is correct
14 Correct 6 ms 12052 KB Output is correct
15 Correct 7 ms 11988 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct
17 Correct 7 ms 11988 KB Output is correct
18 Correct 6 ms 11988 KB Output is correct
19 Correct 6 ms 11988 KB Output is correct
20 Correct 6 ms 11988 KB Output is correct
21 Correct 6 ms 11996 KB Output is correct
22 Correct 48 ms 12144 KB Output is correct
23 Correct 49 ms 12116 KB Output is correct
24 Correct 50 ms 12116 KB Output is correct
25 Correct 49 ms 12144 KB Output is correct
26 Correct 62 ms 12172 KB Output is correct
27 Correct 49 ms 12116 KB Output is correct
28 Correct 49 ms 12116 KB Output is correct
29 Correct 65 ms 12320 KB Output is correct
30 Correct 64 ms 12312 KB Output is correct
31 Correct 46 ms 12140 KB Output is correct
32 Correct 46 ms 12116 KB Output is correct
33 Correct 57 ms 12176 KB Output is correct
34 Correct 51 ms 12132 KB Output is correct
35 Correct 50 ms 12116 KB Output is correct
36 Correct 51 ms 12116 KB Output is correct
37 Correct 45 ms 12076 KB Output is correct
38 Correct 45 ms 12116 KB Output is correct
39 Correct 58 ms 12244 KB Output is correct
40 Correct 60 ms 12232 KB Output is correct
41 Correct 62 ms 12216 KB Output is correct
42 Correct 54 ms 12116 KB Output is correct
43 Correct 53 ms 12116 KB Output is correct
44 Correct 49 ms 12188 KB Output is correct
45 Correct 50 ms 12180 KB Output is correct
46 Correct 49 ms 12176 KB Output is correct
47 Correct 49 ms 12160 KB Output is correct
48 Correct 49 ms 12244 KB Output is correct
49 Correct 49 ms 12244 KB Output is correct
50 Correct 49 ms 12116 KB Output is correct
51 Correct 53 ms 12188 KB Output is correct
52 Correct 48 ms 12116 KB Output is correct
53 Correct 47 ms 12116 KB Output is correct
54 Correct 57 ms 12188 KB Output is correct
55 Correct 50 ms 12116 KB Output is correct
56 Correct 35 ms 12156 KB Output is correct
57 Correct 62 ms 12312 KB Output is correct
58 Correct 34 ms 12116 KB Output is correct
59 Correct 35 ms 12116 KB Output is correct
60 Correct 71 ms 12244 KB Output is correct
61 Correct 34 ms 12116 KB Output is correct
62 Correct 67 ms 12312 KB Output is correct
63 Correct 42 ms 12116 KB Output is correct

Subtask #3
0.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 12064 KB Output is correct
5 Correct 6 ms 12032 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 5 ms 11988 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 6 ms 12024 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 7 ms 11984 KB Output is correct
13 Correct 6 ms 12072 KB Output is correct
14 Correct 6 ms 12052 KB Output is correct
15 Correct 7 ms 11988 KB Output is correct
16 Correct 6 ms 11988 KB Output is correct
17 Correct 7 ms 11988 KB Output is correct
18 Correct 6 ms 11988 KB Output is correct
19 Correct 6 ms 11988 KB Output is correct
20 Correct 6 ms 11988 KB Output is correct
21 Correct 6 ms 11996 KB Output is correct
22 Correct 48 ms 12144 KB Output is correct
23 Correct 49 ms 12116 KB Output is correct
24 Correct 50 ms 12116 KB Output is correct
25 Correct 49 ms 12144 KB Output is correct
26 Correct 62 ms 12172 KB Output is correct
27 Correct 49 ms 12116 KB Output is correct
28 Correct 49 ms 12116 KB Output is correct
29 Correct 65 ms 12320 KB Output is correct
30 Correct 64 ms 12312 KB Output is correct
31 Correct 46 ms 12140 KB Output is correct
32 Correct 46 ms 12116 KB Output is correct
33 Correct 57 ms 12176 KB Output is correct
34 Correct 51 ms 12132 KB Output is correct
35 Correct 50 ms 12116 KB Output is correct
36 Correct 51 ms 12116 KB Output is correct
37 Correct 45 ms 12076 KB Output is correct
38 Correct 45 ms 12116 KB Output is correct
39 Correct 58 ms 12244 KB Output is correct
40 Correct 60 ms 12232 KB Output is correct
41 Correct 62 ms 12216 KB Output is correct
42 Correct 54 ms 12116 KB Output is correct
43 Correct 53 ms 12116 KB Output is correct
44 Correct 49 ms 12188 KB Output is correct
45 Correct 50 ms 12180 KB Output is correct
46 Correct 49 ms 12176 KB Output is correct
47 Correct 49 ms 12160 KB Output is correct
48 Correct 49 ms 12244 KB Output is correct
49 Correct 49 ms 12244 KB Output is correct
50 Correct 49 ms 12116 KB Output is correct
51 Correct 53 ms 12188 KB Output is correct
52 Correct 48 ms 12116 KB Output is correct
53 Correct 47 ms 12116 KB Output is correct
54 Correct 57 ms 12188 KB Output is correct
55 Correct 50 ms 12116 KB Output is correct
56 Correct 35 ms 12156 KB Output is correct
57 Correct 62 ms 12312 KB Output is correct
58 Correct 34 ms 12116 KB Output is correct
59 Correct 35 ms 12116 KB Output is correct
60 Correct 71 ms 12244 KB Output is correct
61 Correct 34 ms 12116 KB Output is correct
62 Correct 67 ms 12312 KB Output is correct
63 Correct 42 ms 12116 KB Output is correct
64 Correct 630 ms 20724 KB Output is correct
65 Correct 702 ms 20724 KB Output is correct
66 Correct 605 ms 20540 KB Output is correct
67 Correct 593 ms 20348 KB Output is correct
68 Correct 695 ms 19832 KB Output is correct
69 Correct 539 ms 19520 KB Output is correct
70 Correct 585 ms 19484 KB Output is correct
71 Correct 730 ms 19568 KB Output is correct
72 Correct 550 ms 19544 KB Output is correct
73 Correct 1438 ms 38760 KB Output is correct
74 Correct 1468 ms 38888 KB Output is correct
75 Correct 547 ms 20604 KB Output is correct
76 Correct 563 ms 20216 KB Output is correct
77 Correct 627 ms 20412 KB Output is correct
78 Correct 741 ms 20212 KB Output is correct
79 Correct 686 ms 19664 KB Output is correct
80 Correct 667 ms 19432 KB Output is correct
81 Correct 421 ms 20428 KB Output is correct
82 Correct 541 ms 20048 KB Output is correct
83 Incorrect 956 ms 30048 KB Output isn't correct
84 Halted 0 ms 0 KB -