oj.uz

답안 #242299

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242299 2020-06-27T08:30:23 Z cheeheng Magic Tree (CEOI19_magictree) C++14
48 / 100
 2000 ms 823108 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> AdjList[100005];

int d[100005];
long long w[100005];
int L[100005];

long long subtreeSum[100005][25];

// subtree rooted at i, day x
void dfs1(int i, int x){
    long long ans = (d[i] == x)*w[i];
    for(int j: AdjList[i]){
        dfs1(j, x);
        ans += subtreeSum[j][x];
    }

    subtreeSum[i][x] = ans;
}

long long memo[100005][1005];

long long dfs2(int i, int k){
    if(k == 0){
        return 0;
    }else if(memo[i][k] != -1){
        return memo[i][k];
    }

    long long ans = 0;
    // delaying for 1 more day is acceptable
    //ans = dfs2(i, k-1);

    long long temp2 = 0;
    for(int j: AdjList[i]){
        // either choose to cut or do not cut
        long long tempVal = dfs2(j, k);
        if(d[j] <= k){
            tempVal = max(tempVal, w[j] + dfs2(j, d[j]));
        }

        temp2 += tempVal;
    }
    ans = max(ans, temp2);

    return memo[i][k] = ans;
}

int main(){
    int n, m, k;
    scanf("%d%d%d", &n, &m, &k);

    bool subtask3 = true;
    for(int i = 2; i <= n; i ++){
        int p;
        scanf("%d", &p);
        subtask3 &= (p == i-1);

        AdjList[p].push_back(i);
    }

    bool subtask2 = true;
    long long ans2 = 0;
    memset(d, -1, sizeof(d));
    vector<int> xingchen;
    for(int i = 1; i <= m; i ++){
        int x, y, z;
        scanf("%d%d%d", &x, &y, &z);
        subtask3 &= (z == 1);
        subtask2 &= AdjList[x].empty();
        d[x] = y;
        w[x] = z;
        ans2 += w[x];
        xingchen.push_back(d[x]);
    }
    sort(xingchen.begin(), xingchen.end());
    xingchen.erase(unique(xingchen.begin(), xingchen.end()), xingchen.end());

    for(int i = 1; i <= n; i ++){
        if(d[i] == -1){continue;}
        d[i] = 1+lower_bound(xingchen.begin(), xingchen.end(), d[i]) - xingchen.begin();
        //printf("d[%d]=%d\n", i, d[i]);
    }

    if(subtask2){
        printf("%lld", ans2);
        return 0;
    }

    if(subtask3){
        int lis = 0;
        /*for(int i = n; i >= 2; i --){
            printf("%d ", d[i]);
        }
        printf("\n");*/
        for(int i = n; i >= 2; i --){
            if(d[i] == -1){continue;}
            int pos = upper_bound(L, L+lis, d[i])-L;
            L[pos] = d[i];
            if(pos == lis){
                lis ++;
            }
        }
        printf("%d\n", lis);
        return 0;
    }else if((int)xingchen.size() <= 1001){
        k = xingchen.size();
        for(int i = 0; i <= k; i ++){
            dfs1(1, i);
        }

        memset(memo, -1, sizeof(memo));
        printf("%lld\n", dfs2(1, k));
        return 0;
    }else{
        throw;
    }

    return 0;
}

Compilation message

magictree.cpp: In function 'int main()':
magictree.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &p);
         ~~~~~^~~~~~~~~~
magictree.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &x, &y, &z);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 789880 KB Output is correct
2 Correct 366 ms 789800 KB Output is correct
3 Correct 369 ms 789880 KB Output is correct
4 Correct 369 ms 789752 KB Output is correct
5 Correct 6 ms 3072 KB Output is correct
6 Correct 6 ms 3072 KB Output is correct
7 Correct 6 ms 3072 KB Output is correct
8 Correct 396 ms 789772 KB Output is correct
9 Correct 370 ms 789752 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 5528 KB Output is correct
2 Correct 40 ms 5940 KB Output is correct
3 Correct 81 ms 4980 KB Output is correct
4 Correct 76 ms 4976 KB Output is correct
5 Correct 82 ms 5108 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3072 KB Output is correct
2 Correct 6 ms 3072 KB Output is correct
3 Correct 6 ms 3072 KB Output is correct
4 Correct 63 ms 7540 KB Output is correct
5 Correct 66 ms 7924 KB Output is correct
6 Correct 88 ms 7540 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 499 ms 812364 KB Output is correct
2 Correct 497 ms 812268 KB Output is correct
3 Correct 492 ms 816912 KB Output is correct
4 Correct 450 ms 810988 KB Output is correct
5 Correct 476 ms 823108 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 789880 KB Output is correct
2 Correct 366 ms 789800 KB Output is correct
3 Correct 369 ms 789880 KB Output is correct
4 Correct 369 ms 789752 KB Output is correct
5 Correct 6 ms 3072 KB Output is correct
6 Correct 6 ms 3072 KB Output is correct
7 Correct 6 ms 3072 KB Output is correct
8 Correct 396 ms 789772 KB Output is correct
9 Correct 370 ms 789752 KB Output is correct
10 Correct 761 ms 812260 KB Output is correct
11 Correct 652 ms 812272 KB Output is correct
12 Correct 661 ms 817004 KB Output is correct
13 Correct 464 ms 810992 KB Output is correct
14 Correct 61 ms 7552 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 933 ms 794216 KB Output is correct
2 Execution timed out 2086 ms 25080 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 789880 KB Output is correct
2 Correct 366 ms 789800 KB Output is correct
3 Correct 369 ms 789880 KB Output is correct
4 Correct 369 ms 789752 KB Output is correct
5 Correct 6 ms 3072 KB Output is correct
6 Correct 6 ms 3072 KB Output is correct
7 Correct 6 ms 3072 KB Output is correct
8 Correct 396 ms 789772 KB Output is correct
9 Correct 370 ms 789752 KB Output is correct
10 Correct 7 ms 3072 KB Output is correct
11 Correct 6 ms 3072 KB Output is correct
12 Correct 6 ms 3072 KB Output is correct
13 Correct 63 ms 7540 KB Output is correct
14 Correct 66 ms 7924 KB Output is correct
15 Correct 88 ms 7540 KB Output is correct
16 Correct 761 ms 812260 KB Output is correct
17 Correct 652 ms 812272 KB Output is correct
18 Correct 661 ms 817004 KB Output is correct
19 Correct 464 ms 810992 KB Output is correct
20 Correct 61 ms 7552 KB Output is correct
21 Runtime error 52 ms 3840 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 789880 KB Output is correct
2 Correct 366 ms 789800 KB Output is correct
3 Correct 369 ms 789880 KB Output is correct
4 Correct 369 ms 789752 KB Output is correct
5 Correct 6 ms 3072 KB Output is correct
6 Correct 6 ms 3072 KB Output is correct
7 Correct 6 ms 3072 KB Output is correct
8 Correct 396 ms 789772 KB Output is correct
9 Correct 370 ms 789752 KB Output is correct
10 Correct 46 ms 5528 KB Output is correct
11 Correct 40 ms 5940 KB Output is correct
12 Correct 81 ms 4980 KB Output is correct
13 Correct 76 ms 4976 KB Output is correct
14 Correct 82 ms 5108 KB Output is correct
15 Correct 7 ms 3072 KB Output is correct
16 Correct 6 ms 3072 KB Output is correct
17 Correct 6 ms 3072 KB Output is correct
18 Correct 63 ms 7540 KB Output is correct
19 Correct 66 ms 7924 KB Output is correct
20 Correct 88 ms 7540 KB Output is correct
21 Correct 499 ms 812364 KB Output is correct
22 Correct 497 ms 812268 KB Output is correct
23 Correct 492 ms 816912 KB Output is correct
24 Correct 450 ms 810988 KB Output is correct
25 Correct 476 ms 823108 KB Output is correct
26 Correct 761 ms 812260 KB Output is correct
27 Correct 652 ms 812272 KB Output is correct
28 Correct 661 ms 817004 KB Output is correct
29 Correct 464 ms 810992 KB Output is correct
30 Correct 61 ms 7552 KB Output is correct
31 Correct 933 ms 794216 KB Output is correct
32 Execution timed out 2086 ms 25080 KB Time limit exceeded
33 Halted 0 ms 0 KB -