제출 #1236009

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236009		kaltspielerhy	Magic Tree (CEOI19_magictree)	C++20	0 / 100	506 ms	1114112 KiB

magictree

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INFINI = 1e18;
vector<vector<int>> recolte;
vector<int> parents;
vector<pair<int, int>> fruits;
vector<vector<int>> inverse;
vector<int> result;
int N, M, K;


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M >> K;
    recolte.assign(N+1, vector<int>(K+1, 0));
    parents.assign(N+1, -1);
    fruits.assign(N+1, {-1, -1});
    inverse.assign(N+1, vector<int>());
    result.assign(N+1, -1);

    for (int iArete = 2; iArete <= N; iArete++) {
        cin >> parents[iArete];
        inverse[parents[iArete]].push_back(iArete);
    }

    int resFinal = 0;
    for (int iFruit = 1; iFruit <= M; iFruit++) {
        int noeud, jour, jus;
        cin >> noeud >> jour >> jus;
        fruits[noeud] = {jour, jus};
        resFinal += jus;
    }

    cout << resFinal << '\n';
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17