oj.uz

답안 #773011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
773011 2023-07-04T14:03:35 Z davitmarg Power Plant (JOI20_power) C++17
47 / 100
 1110 ms 39060 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(6969);
    int k = 2000;

    if(n > 5000)
        k = 30;

    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 11988 KB Output is correct
3 Correct 7 ms 12032 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 12068 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 6 ms 11940 KB Output is correct
14 Correct 6 ms 11988 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 6 ms 11988 KB Output is correct
19 Correct 6 ms 12036 KB Output is correct
20 Correct 7 ms 11988 KB Output is correct
21 Correct 6 ms 12072 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 11988 KB Output is correct
3 Correct 7 ms 12032 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 12068 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 6 ms 11940 KB Output is correct
14 Correct 6 ms 11988 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 6 ms 11988 KB Output is correct
19 Correct 6 ms 12036 KB Output is correct
20 Correct 7 ms 11988 KB Output is correct
21 Correct 6 ms 12072 KB Output is correct
22 Correct 48 ms 12116 KB Output is correct
23 Correct 49 ms 12116 KB Output is correct
24 Correct 52 ms 12152 KB Output is correct
25 Correct 49 ms 12116 KB Output is correct
26 Correct 56 ms 12116 KB Output is correct
27 Correct 49 ms 12132 KB Output is correct
28 Correct 54 ms 12116 KB Output is correct
29 Correct 75 ms 12324 KB Output is correct
30 Correct 64 ms 12244 KB Output is correct
31 Correct 47 ms 12136 KB Output is correct
32 Correct 52 ms 12128 KB Output is correct
33 Correct 50 ms 12136 KB Output is correct
34 Correct 50 ms 12116 KB Output is correct
35 Correct 51 ms 12128 KB Output is correct
36 Correct 60 ms 12116 KB Output is correct
37 Correct 43 ms 12148 KB Output is correct
38 Correct 45 ms 12116 KB Output is correct
39 Correct 57 ms 12244 KB Output is correct
40 Correct 57 ms 12124 KB Output is correct
41 Correct 56 ms 12232 KB Output is correct
42 Correct 54 ms 12180 KB Output is correct
43 Correct 53 ms 12172 KB Output is correct
44 Correct 48 ms 12116 KB Output is correct
45 Correct 48 ms 12116 KB Output is correct
46 Correct 49 ms 12176 KB Output is correct
47 Correct 53 ms 12160 KB Output is correct
48 Correct 49 ms 12244 KB Output is correct
49 Correct 52 ms 12244 KB Output is correct
50 Correct 50 ms 12204 KB Output is correct
51 Correct 49 ms 12188 KB Output is correct
52 Correct 48 ms 12116 KB Output is correct
53 Correct 49 ms 12204 KB Output is correct
54 Correct 49 ms 12188 KB Output is correct
55 Correct 49 ms 12116 KB Output is correct
56 Correct 44 ms 12116 KB Output is correct
57 Correct 62 ms 12244 KB Output is correct
58 Correct 35 ms 12116 KB Output is correct
59 Correct 34 ms 12168 KB Output is correct
60 Correct 73 ms 12244 KB Output is correct
61 Correct 35 ms 12116 KB Output is correct
62 Correct 69 ms 12244 KB Output is correct
63 Correct 43 ms 12140 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 11988 KB Output is correct
3 Correct 7 ms 12032 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 12068 KB Output is correct
7 Correct 6 ms 11988 KB Output is correct
8 Correct 7 ms 11988 KB Output is correct
9 Correct 8 ms 11988 KB Output is correct
10 Correct 7 ms 11988 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 6 ms 11940 KB Output is correct
14 Correct 6 ms 11988 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 6 ms 11988 KB Output is correct
19 Correct 6 ms 12036 KB Output is correct
20 Correct 7 ms 11988 KB Output is correct
21 Correct 6 ms 12072 KB Output is correct
22 Correct 48 ms 12116 KB Output is correct
23 Correct 49 ms 12116 KB Output is correct
24 Correct 52 ms 12152 KB Output is correct
25 Correct 49 ms 12116 KB Output is correct
26 Correct 56 ms 12116 KB Output is correct
27 Correct 49 ms 12132 KB Output is correct
28 Correct 54 ms 12116 KB Output is correct
29 Correct 75 ms 12324 KB Output is correct
30 Correct 64 ms 12244 KB Output is correct
31 Correct 47 ms 12136 KB Output is correct
32 Correct 52 ms 12128 KB Output is correct
33 Correct 50 ms 12136 KB Output is correct
34 Correct 50 ms 12116 KB Output is correct
35 Correct 51 ms 12128 KB Output is correct
36 Correct 60 ms 12116 KB Output is correct
37 Correct 43 ms 12148 KB Output is correct
38 Correct 45 ms 12116 KB Output is correct
39 Correct 57 ms 12244 KB Output is correct
40 Correct 57 ms 12124 KB Output is correct
41 Correct 56 ms 12232 KB Output is correct
42 Correct 54 ms 12180 KB Output is correct
43 Correct 53 ms 12172 KB Output is correct
44 Correct 48 ms 12116 KB Output is correct
45 Correct 48 ms 12116 KB Output is correct
46 Correct 49 ms 12176 KB Output is correct
47 Correct 53 ms 12160 KB Output is correct
48 Correct 49 ms 12244 KB Output is correct
49 Correct 52 ms 12244 KB Output is correct
50 Correct 50 ms 12204 KB Output is correct
51 Correct 49 ms 12188 KB Output is correct
52 Correct 48 ms 12116 KB Output is correct
53 Correct 49 ms 12204 KB Output is correct
54 Correct 49 ms 12188 KB Output is correct
55 Correct 49 ms 12116 KB Output is correct
56 Correct 44 ms 12116 KB Output is correct
57 Correct 62 ms 12244 KB Output is correct
58 Correct 35 ms 12116 KB Output is correct
59 Correct 34 ms 12168 KB Output is correct
60 Correct 73 ms 12244 KB Output is correct
61 Correct 35 ms 12116 KB Output is correct
62 Correct 69 ms 12244 KB Output is correct
63 Correct 43 ms 12140 KB Output is correct
64 Correct 429 ms 20680 KB Output is correct
65 Correct 525 ms 20572 KB Output is correct
66 Correct 529 ms 20528 KB Output is correct
67 Correct 508 ms 20344 KB Output is correct
68 Correct 454 ms 19888 KB Output is correct
69 Correct 531 ms 19760 KB Output is correct
70 Correct 447 ms 19548 KB Output is correct
71 Correct 555 ms 19560 KB Output is correct
72 Correct 532 ms 19568 KB Output is correct
73 Correct 1057 ms 39060 KB Output is correct
74 Correct 1110 ms 38500 KB Output is correct
75 Correct 475 ms 20548 KB Output is correct
76 Correct 428 ms 20212 KB Output is correct
77 Correct 495 ms 20412 KB Output is correct
78 Correct 481 ms 22856 KB Output is correct
79 Correct 668 ms 22408 KB Output is correct
80 Correct 579 ms 22152 KB Output is correct
81 Correct 291 ms 23096 KB Output is correct
82 Correct 351 ms 22632 KB Output is correct
83 Incorrect 650 ms 32200 KB Output isn't correct
84 Halted 0 ms 0 KB -