oj.uz

답안 #58591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58591 2018-07-18T11:07:15 Z wilwxk Chase (CEOI17_chase) C++11
50 / 100
 4000 ms 179972 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=1e5+5;
const int MAXK=102;
vector<int> g[MAXN];
int pai[MAXN], v[MAXN];
long long soma[MAXN], dp[MAXN][MAXK][2];
int n, x;

void predfs(int cur, int p) {
    soma[cur]=0; pai[cur]=p;
    for(auto viz : g[cur]) {
        if(viz==p) continue;
        predfs(viz, cur);
        soma[cur]+=v[viz];
    }
}

long long fazdp(int cur, int k, int flag) {
    if(k<0||(k==0&&flag==0)) return 0;
    if(dp[cur][k][flag]!=-1) return dp[cur][k][flag];

    long long resp=0;
    if(flag) resp=soma[cur];
    for(auto viz : g[cur]) {
        if(viz==pai[cur]) continue;
        resp=max(resp, fazdp(viz, k, 0) + (flag ? soma[cur] : 0) );
        resp=max(resp, fazdp(viz, k-1, 1) + (flag ? soma[cur] : 0) );
    }

    //printf("%d %d %d -> %lld\n", cur, k, flag, resp);
    return dp[cur][k][flag]=resp;
}

int main() {
    scanf("%d %d", &n, &x);
    for(int i=1; i<=n; i++) scanf("%d", &v[i]);
    for(int i=0; i<n-1; i++) {
        int a, b; scanf("%d %d", &a, &b);
        g[a].push_back(b); g[b].push_back(a);
    }

    long long respf=0;
    for(int cur=1; cur<=1; cur++) {
            predfs(cur, cur);
            for(int i=1; i<=n; i++) for(int j=0; j<=x; j++) for(int k=0; k<2; k++) dp[i][j][k]=-1;
            for(int i=0; i<=x; i++) respf=max(respf, fazdp(cur, i, 0));
            for(int i=1; i<=x; i++) respf=max(respf, fazdp(cur, i-1, 1));
    }
    if(n<=1005) {
        for(int cur=2; cur<=n; cur++) {
            predfs(cur, cur); if(cur>=750) cur+=(rand()%3);
            for(int i=1; i<=n; i++) for(int j=0; j<=x; j++) for(int k=0; k<2; k++) dp[i][j][k]=-1;
            for(int i=0; i<=x; i++) respf=max(respf, fazdp(cur, i, 0));
            for(int i=1; i<=x; i++) respf=max(respf, fazdp(cur, i-1, 1));
        }
    }


    printf("%lld\n", respf);

}

Compilation message

chase.cpp: In function 'int main()':
chase.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &x);
     ~~~~~^~~~~~~~~~~~~~~~~
chase.cpp:38:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1; i<=n; i++) scanf("%d", &v[i]);
                             ~~~~~^~~~~~~~~~~~~
chase.cpp:40:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int a, b; scanf("%d %d", &a, &b);
                   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2828 KB Output is correct
4 Correct 5 ms 2828 KB Output is correct
5 Correct 5 ms 2828 KB Output is correct
6 Correct 6 ms 2996 KB Output is correct
7 Execution timed out 4041 ms 4508 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2813 ms 171312 KB Output is correct
2 Correct 2845 ms 173408 KB Output is correct
3 Correct 2000 ms 173408 KB Output is correct
4 Correct 261 ms 173628 KB Output is correct
5 Correct 3030 ms 175828 KB Output is correct
6 Correct 3310 ms 177956 KB Output is correct
7 Correct 3212 ms 179972 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2828 KB Output is correct
4 Correct 5 ms 2828 KB Output is correct
5 Correct 5 ms 2828 KB Output is correct
6 Correct 6 ms 2996 KB Output is correct
7 Execution timed out 4041 ms 4508 KB Time limit exceeded
8 Halted 0 ms 0 KB -