oj.uz

답안 #136306

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136306 2019-07-25T06:09:06 Z BThero Chase (CEOI17_chase) C++17
40 / 100
 4000 ms 171208 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << '\n';

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;   
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MAXN = (int)1e5 + 5;
const ll INF = (ll)1e15;

vector<int> adj[MAXN];

ll dp[2][105][MAXN];

ll neigh[MAXN];

int arr[MAXN];

int n, lim;

void dfs(int v, int pr = -1) {
    for (int to : adj[v]) {
        if (to != pr) {
            for (int k = 0; k <= lim; ++k) {
                dp[0][k][to] = max(dp[1][k][v], dp[0][k][v]);
                dp[1][k + 1][to] = max(dp[0][k][v], dp[1][k][v]) + neigh[to] - arr[v];
            }
            
            dfs(to, v);
        }
    }
}

void solve() {
    scanf("%d %d", &n, &lim);
    
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &arr[i]);
    }
    
    for (int i = 1; i < n; ++i) {
        int u, v;
        scanf("%d %d", &u, &v);
        adj[u].pb(v);
        adj[v].pb(u);
        neigh[u] += arr[v];
        neigh[v] += arr[u];
    }
    
    for (int s = 0; s < 2; ++s) {
        for (int k = 0; k <= lim; ++k) {
            for (int j = 1; j <= n; ++j) {
                dp[s][k][j] = -INF;
            }
        }
    }
    
    ll ans = 0;
    
    for (int i = 1; i <= n; ++i) {
        dp[0][0][i] = 0;
        dp[1][1][i] = neigh[i];
        dfs(i);
        
        for (int s = 0; s < 2; ++s) {
            for (int k = 0; k <= lim; ++k) {
                for (int j = 1; j <= n; ++j) {
                    ans = max(ans, dp[s][k][j]);
                    dp[s][k][j] = -INF;
                }
            }
        }
    }
    
    printf("%lld\n", ans);
}

int main() {
    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

chase.cpp: In function 'void solve()':
chase.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &lim);
     ~~~~~^~~~~~~~~~~~~~~~~~~
chase.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~
chase.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 4 ms 2812 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 4 ms 2812 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 938 ms 5624 KB Output is correct
8 Correct 45 ms 2936 KB Output is correct
9 Correct 36 ms 2936 KB Output is correct
10 Correct 1102 ms 5528 KB Output is correct
11 Correct 312 ms 3628 KB Output is correct
12 Correct 91 ms 3192 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4110 ms 171208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 4 ms 2812 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 938 ms 5624 KB Output is correct
8 Correct 45 ms 2936 KB Output is correct
9 Correct 36 ms 2936 KB Output is correct
10 Correct 1102 ms 5528 KB Output is correct
11 Correct 312 ms 3628 KB Output is correct
12 Correct 91 ms 3192 KB Output is correct
13 Execution timed out 4110 ms 171208 KB Time limit exceeded
14 Halted 0 ms 0 KB -