oj.uz

Submission #502511

# Submission time Handle Problem Language Result Execution time Memory
502511 2022-01-06T07:32:35 Z InternetPerson10 Magic Tree (CEOI19_magictree) C++17
3 / 100
 149 ms 7388 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> adj(n);
    vector<ll> weight(n);
    vector<int> day(n);
    bool isLine = true;
    for(int i = 1; i < n; i++) {
        int x;
        cin >> x;
        x--;
        adj[i].push_back(x);
        adj[x].push_back(i);
        if(x != i-1) isLine = false;
    }
    int maxWeight = -1, maxDay = -1, maxAdj = -1;
    for(int i = 0; i < m; i++) {
        int v, d, w;
        cin >> v >> d >> w;
        v--;
        weight[v] = w;
        day[v] = d;
        maxWeight = max(maxWeight, w);
        maxDay = max(maxDay, d);
        maxAdj = max(maxAdj, (int)adj[v].size());
    }
    ll ans = 0;
    if(isLine && maxWeight == 1) { // Longest increasing subsequence
        reverse(day.begin(), day.end());
        vector<int> day2;
        for(int d : day) if(d) day2.push_back(d);
        map<int, int> m;
        m[0] = 0;
        for(int i = 0; i < day2.size(); i++) {
            int w = day2[i];
            auto p = m.upper_bound(w);
            p--;
            m[w] = (*p).second + 1;
        }
        for(auto p : m) {
            ans = max(ans, (ll)p.second);
        }
    }
    else if(n <= 20 && k <= 20 && maxWeight == 1) {
        
    }
    else if(maxAdj == 1) {
        for(int w : weight) ans += w;
    }
    else if(k <= 2) {

    }
    else if(k <= 20 && maxAdj == 1) {

    }
    else if(m <= 1000) {

    }
    else if(maxWeight == 1) {

    }
    else {

    }
    cout << ans << '\n';
}

Compilation message

magictree.cpp: In function 'int main()':
magictree.cpp:39:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int i = 0; i < day2.size(); i++) {
      |                        ~~^~~~~~~~~~~~~

Subtask #1
0 / 6.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 7092 KB Output is correct
2 Correct 56 ms 6880 KB Output is correct
3 Correct 109 ms 7388 KB Output is correct
4 Correct 96 ms 7244 KB Output is correct
5 Correct 110 ms 7328 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 300 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

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

Subtask #5
0 / 16.0

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

Subtask #6
0 / 13.0

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

Subtask #7
0 / 22.0

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

Subtask #8
0 / 17.0

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