oj.uz

Submission #723679

# Submission time Handle Problem Language Result Execution time Memory
723679 2023-04-14T07:29:28 Z dxz05 Magic Tree (CEOI19_magictree) C++17
28 / 100
 1727 ms 791852 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define MP make_pair
const int N = 100500;

struct fenwick{
    vector<int> f;
    fenwick(int n){
        f.resize(n + 2);
    };
    void add(int i, int x){
        i++;
        while (i < (int)f.size()){
            f[i] = max(f[i], x);
            i += (-i) & i;
        }
    }
    int get(int i){
        i++;
        int res = 0;
        while (i > 0){
            res = max(res, f[i]);
            i -= (-i) & i;
        }
        return res;
    }
};

vector<int> g[N];

vector<vector<ll>> dp;
pair<int, int> fruit[N];

void dfs(int v){
    dp[v][fruit[v].first] = fruit[v].second;

    for (int u : g[v]){
        dfs(u);
    }

    for (int t = 1; t < dp[v].size(); t++){
        for (int u : g[v]){
            dp[v][t] += dp[u][t];
        }
    }

    for (int t = 1; t < dp[v].size(); t++) dp[v][t] = max(dp[v][t], dp[v][t - 1]);

}

int LIS(const vector<int> &a){
    int n = (int) a.size();
    fenwick f(2e5);
    int res = 0;
    for (int i = 0; i < n; i++){
        int _dp = f.get(a[i]) + 1;
        f.add(a[i], _dp);
        res = max(res, _dp);
    }
    return res;
}

void solve(){
    int n, m, k;
    cin >> n >> m >> k;

    ll sum = 0;
    bool sub3 = true;
    for (int i = 1; i < n; i++){
        int p;
        cin >> p;
        --p;
        if (p != i - 1) sub3 = false;
        g[p].push_back(i);
    }

    map<int, int> mp;

    vector<int> a(n);
    for (int i = 0; i < m; i++){
        int v, d, w;
        cin >> v >> d >> w;
        --v;
        mp[d];
        fruit[v] = MP(d, w);
        sum += w;
        a[v] = d;
        if (w != 1) sub3 = false;
    }

    if (sub3){
        cout << LIS(a) << endl;
        return;
    }

    mp[0];
    k = 0;
    for (auto &now : mp){
        now.second = ++k;
    }

    for (int i = 0; i < n; i++){
        fruit[i].first = mp[fruit[i].first];
    }

    if (k > 1000){
        cout << sum << endl;
        return;
    }

    dp.assign(n, vector<ll>(k + 1, 0));

    dfs(0);

    cout << dp[0].back() << endl;

}

int main() {
    ios_base::sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    solve();

    return 0;
}

Compilation message

magictree.cpp: In function 'void dfs(int)':
magictree.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int t = 1; t < dp[v].size(); t++){
      |                     ~~^~~~~~~~~~~~~~
magictree.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int t = 1; t < dp[v].size(); t++) dp[v][t] = max(dp[v][t], dp[v][t - 1]);
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Incorrect 2 ms 3412 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 6300 KB Output is correct
2 Correct 32 ms 7116 KB Output is correct
3 Correct 77 ms 7244 KB Output is correct
4 Correct 78 ms 7000 KB Output is correct
5 Correct 87 ms 7308 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 12516 KB Output is correct
2 Correct 70 ms 10920 KB Output is correct
3 Correct 57 ms 15280 KB Output is correct
4 Correct 36 ms 11172 KB Output is correct
5 Correct 51 ms 18640 KB Output is correct

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Incorrect 2 ms 3412 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 128056 KB Output is correct
2 Correct 676 ms 607576 KB Output is correct
3 Correct 706 ms 610596 KB Output is correct
4 Correct 895 ms 789080 KB Output is correct
5 Correct 1727 ms 787856 KB Output is correct
6 Correct 914 ms 789756 KB Output is correct
7 Correct 882 ms 791852 KB Output is correct

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Incorrect 2 ms 3412 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Incorrect 2 ms 3412 KB Output isn't correct
6 Halted 0 ms 0 KB -