oj.uz

Submission #778362

# Submission time Handle Problem Language Result Execution time Memory
778362 2023-07-10T08:54:33 Z RecursiveCo Magic Tree (CEOI19_magictree) C++14
0 / 100
 28 ms 15272 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long int

vector<vector<int>> adjList;
vector<bool> visited;
vector<int> pos;
vector<int> W;
vector<vector<int>> dp;
int k;

void dfs(int v) {
    visited[v] = true;
    vector<int> cur(k, 0);
    int sum = 0;
    for (int con: adjList[v]) {
        if (!visited[con]) dfs(con);
        forto(k, i) cur[i] += dp[con][i];
        if (pos[v] != 1e18) sum += dp[con][pos[v]];
    }
    forto(k, i) {
        if (i >= pos[v]) cur[i] = max(cur[i], W[v] + sum);
    }
    forto(k, i) dp[v][i] = cur[i];
}

signed main() {
    improvePerformance;
    get(n);
    get(m);
    cin >> k;
    adjList.resize(n);
    visited.resize(n, false);
    pos.resize(n, 1e18);
    forto(n - 1, i) {
        get(cur);
        cur--;
        adjList[i + 1].push_back(cur);
        adjList[cur].push_back(i + 1);
    }
    forto(m, i) {
        get(v);
        get(d);
        get(w);
        v--;
        d--;
        pos[v] = d;
        W[v] = w;
    }
    dp.resize(n, vector<int>(k, 0));
    dfs(0);
    out(dp[0][k - 1]);
}

Compilation message

magictree.cpp: In function 'void dfs(long long int)':
magictree.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
magictree.cpp:33:9: note: in expansion of macro 'forto'
   33 |         forto(k, i) cur[i] += dp[con][i];
      |         ^~~~~
magictree.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
magictree.cpp:36:5: note: in expansion of macro 'forto'
   36 |     forto(k, i) {
      |     ^~~~~
magictree.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
magictree.cpp:39:5: note: in expansion of macro 'forto'
   39 |     forto(k, i) dp[v][i] = cur[i];
      |     ^~~~~
magictree.cpp: In function 'int main()':
magictree.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
magictree.cpp:44:5: note: in expansion of macro 'get'
   44 |     get(n);
      |     ^~~
magictree.cpp:10:23: warning: unnecessary parentheses in declaration of 'm' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
magictree.cpp:45:5: note: in expansion of macro 'get'
   45 |     get(m);
      |     ^~~
magictree.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
magictree.cpp:50:5: note: in expansion of macro 'forto'
   50 |     forto(n - 1, i) {
      |     ^~~~~
magictree.cpp:10:23: warning: unnecessary parentheses in declaration of 'cur' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
magictree.cpp:51:9: note: in expansion of macro 'get'
   51 |         get(cur);
      |         ^~~
magictree.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
magictree.cpp:56:5: note: in expansion of macro 'forto'
   56 |     forto(m, i) {
      |     ^~~~~
magictree.cpp:10:23: warning: unnecessary parentheses in declaration of 'v' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
magictree.cpp:57:9: note: in expansion of macro 'get'
   57 |         get(v);
      |         ^~~
magictree.cpp:10:23: warning: unnecessary parentheses in declaration of 'd' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
magictree.cpp:58:9: note: in expansion of macro 'get'
   58 |         get(d);
      |         ^~~
magictree.cpp:10:23: warning: unnecessary parentheses in declaration of 'w' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
magictree.cpp:59:9: note: in expansion of macro 'get'
   59 |         get(w);
      |         ^~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 28 ms 15272 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 25 ms 14912 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 3328 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -