답안 #773017

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
773017	2023-07-04T14:06:08 Z	davitmarg	Power Plant (JOI20_power)	C++17	47 / 100	1375 ms	39160 KB

power

/*
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(6969);
    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	6 ms	12076 KB	Output is correct
3	Correct	6 ms	11988 KB	Output is correct
4	Correct	6 ms	11988 KB	Output is correct
5	Correct	6 ms	11988 KB	Output is correct
6	Correct	6 ms	11988 KB	Output is correct
7	Correct	7 ms	11988 KB	Output is correct
8	Correct	6 ms	11988 KB	Output is correct
9	Correct	7 ms	11976 KB	Output is correct
10	Correct	6 ms	11988 KB	Output is correct
11	Correct	6 ms	11988 KB	Output is correct
12	Correct	6 ms	12016 KB	Output is correct
13	Correct	6 ms	11988 KB	Output is correct
14	Correct	6 ms	12000 KB	Output is correct
15	Correct	6 ms	11988 KB	Output is correct
16	Correct	6 ms	11988 KB	Output is correct
17	Correct	6 ms	11988 KB	Output is correct
18	Correct	7 ms	12044 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	11988 KB	Output is correct

Subtask #2
41.0 / 41.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	11988 KB	Output is correct
2	Correct	6 ms	12076 KB	Output is correct
3	Correct	6 ms	11988 KB	Output is correct
4	Correct	6 ms	11988 KB	Output is correct
5	Correct	6 ms	11988 KB	Output is correct
6	Correct	6 ms	11988 KB	Output is correct
7	Correct	7 ms	11988 KB	Output is correct
8	Correct	6 ms	11988 KB	Output is correct
9	Correct	7 ms	11976 KB	Output is correct
10	Correct	6 ms	11988 KB	Output is correct
11	Correct	6 ms	11988 KB	Output is correct
12	Correct	6 ms	12016 KB	Output is correct
13	Correct	6 ms	11988 KB	Output is correct
14	Correct	6 ms	12000 KB	Output is correct
15	Correct	6 ms	11988 KB	Output is correct
16	Correct	6 ms	11988 KB	Output is correct
17	Correct	6 ms	11988 KB	Output is correct
18	Correct	7 ms	12044 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	11988 KB	Output is correct
22	Correct	49 ms	12116 KB	Output is correct
23	Correct	60 ms	12092 KB	Output is correct
24	Correct	49 ms	12160 KB	Output is correct
25	Correct	50 ms	12140 KB	Output is correct
26	Correct	48 ms	12116 KB	Output is correct
27	Correct	51 ms	12132 KB	Output is correct
28	Correct	51 ms	12116 KB	Output is correct
29	Correct	63 ms	12244 KB	Output is correct
30	Correct	64 ms	12316 KB	Output is correct
31	Correct	57 ms	12140 KB	Output is correct
32	Correct	45 ms	12080 KB	Output is correct
33	Correct	50 ms	12140 KB	Output is correct
34	Correct	50 ms	12116 KB	Output is correct
35	Correct	52 ms	12132 KB	Output is correct
36	Correct	71 ms	12128 KB	Output is correct
37	Correct	41 ms	12048 KB	Output is correct
38	Correct	45 ms	12116 KB	Output is correct
39	Correct	74 ms	12244 KB	Output is correct
40	Correct	58 ms	12244 KB	Output is correct
41	Correct	56 ms	12232 KB	Output is correct
42	Correct	67 ms	12116 KB	Output is correct
43	Correct	56 ms	12244 KB	Output is correct
44	Correct	49 ms	12116 KB	Output is correct
45	Correct	49 ms	12116 KB	Output is correct
46	Correct	51 ms	12116 KB	Output is correct
47	Correct	53 ms	12116 KB	Output is correct
48	Correct	47 ms	12244 KB	Output is correct
49	Correct	51 ms	12240 KB	Output is correct
50	Correct	52 ms	12200 KB	Output is correct
51	Correct	57 ms	12132 KB	Output is correct
52	Correct	55 ms	12156 KB	Output is correct
53	Correct	54 ms	12204 KB	Output is correct
54	Correct	55 ms	12188 KB	Output is correct
55	Correct	61 ms	12116 KB	Output is correct
56	Correct	40 ms	12136 KB	Output is correct
57	Correct	64 ms	12316 KB	Output is correct
58	Correct	36 ms	12116 KB	Output is correct
59	Correct	40 ms	12116 KB	Output is correct
60	Correct	73 ms	12244 KB	Output is correct
61	Correct	35 ms	12116 KB	Output is correct
62	Correct	78 ms	12308 KB	Output is correct
63	Correct	55 ms	12136 KB	Output is correct

Subtask #3
0.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	11988 KB	Output is correct
2	Correct	6 ms	12076 KB	Output is correct
3	Correct	6 ms	11988 KB	Output is correct
4	Correct	6 ms	11988 KB	Output is correct
5	Correct	6 ms	11988 KB	Output is correct
6	Correct	6 ms	11988 KB	Output is correct
7	Correct	7 ms	11988 KB	Output is correct
8	Correct	6 ms	11988 KB	Output is correct
9	Correct	7 ms	11976 KB	Output is correct
10	Correct	6 ms	11988 KB	Output is correct
11	Correct	6 ms	11988 KB	Output is correct
12	Correct	6 ms	12016 KB	Output is correct
13	Correct	6 ms	11988 KB	Output is correct
14	Correct	6 ms	12000 KB	Output is correct
15	Correct	6 ms	11988 KB	Output is correct
16	Correct	6 ms	11988 KB	Output is correct
17	Correct	6 ms	11988 KB	Output is correct
18	Correct	7 ms	12044 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	11988 KB	Output is correct
22	Correct	49 ms	12116 KB	Output is correct
23	Correct	60 ms	12092 KB	Output is correct
24	Correct	49 ms	12160 KB	Output is correct
25	Correct	50 ms	12140 KB	Output is correct
26	Correct	48 ms	12116 KB	Output is correct
27	Correct	51 ms	12132 KB	Output is correct
28	Correct	51 ms	12116 KB	Output is correct
29	Correct	63 ms	12244 KB	Output is correct
30	Correct	64 ms	12316 KB	Output is correct
31	Correct	57 ms	12140 KB	Output is correct
32	Correct	45 ms	12080 KB	Output is correct
33	Correct	50 ms	12140 KB	Output is correct
34	Correct	50 ms	12116 KB	Output is correct
35	Correct	52 ms	12132 KB	Output is correct
36	Correct	71 ms	12128 KB	Output is correct
37	Correct	41 ms	12048 KB	Output is correct
38	Correct	45 ms	12116 KB	Output is correct
39	Correct	74 ms	12244 KB	Output is correct
40	Correct	58 ms	12244 KB	Output is correct
41	Correct	56 ms	12232 KB	Output is correct
42	Correct	67 ms	12116 KB	Output is correct
43	Correct	56 ms	12244 KB	Output is correct
44	Correct	49 ms	12116 KB	Output is correct
45	Correct	49 ms	12116 KB	Output is correct
46	Correct	51 ms	12116 KB	Output is correct
47	Correct	53 ms	12116 KB	Output is correct
48	Correct	47 ms	12244 KB	Output is correct
49	Correct	51 ms	12240 KB	Output is correct
50	Correct	52 ms	12200 KB	Output is correct
51	Correct	57 ms	12132 KB	Output is correct
52	Correct	55 ms	12156 KB	Output is correct
53	Correct	54 ms	12204 KB	Output is correct
54	Correct	55 ms	12188 KB	Output is correct
55	Correct	61 ms	12116 KB	Output is correct
56	Correct	40 ms	12136 KB	Output is correct
57	Correct	64 ms	12316 KB	Output is correct
58	Correct	36 ms	12116 KB	Output is correct
59	Correct	40 ms	12116 KB	Output is correct
60	Correct	73 ms	12244 KB	Output is correct
61	Correct	35 ms	12116 KB	Output is correct
62	Correct	78 ms	12308 KB	Output is correct
63	Correct	55 ms	12136 KB	Output is correct
64	Correct	980 ms	20628 KB	Output is correct
65	Correct	1020 ms	20660 KB	Output is correct
66	Correct	902 ms	20536 KB	Output is correct
67	Correct	995 ms	20344 KB	Output is correct
68	Correct	885 ms	19888 KB	Output is correct
69	Correct	515 ms	19644 KB	Output is correct
70	Correct	803 ms	19552 KB	Output is correct
71	Correct	574 ms	19568 KB	Output is correct
72	Correct	573 ms	19600 KB	Output is correct
73	Correct	1309 ms	39160 KB	Output is correct
74	Correct	1375 ms	38332 KB	Output is correct
75	Correct	509 ms	20612 KB	Output is correct
76	Correct	546 ms	20208 KB	Output is correct
77	Correct	743 ms	20416 KB	Output is correct
78	Correct	612 ms	20208 KB	Output is correct
79	Correct	662 ms	19760 KB	Output is correct
80	Correct	743 ms	19432 KB	Output is correct
81	Correct	414 ms	20424 KB	Output is correct
82	Correct	588 ms	20068 KB	Output is correct
83	Incorrect	988 ms	30004 KB	Output isn't correct
84	Halted	0 ms	0 KB	-

답안 #773017

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 41.0 / 41.0

Subtask #3 0.0 / 53.0

Subtask #1
6.0 / 6.0

Subtask #2
41.0 / 41.0

Subtask #3
0.0 / 53.0