oj.uz

답안 #867446

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867446 2023-10-28T11:56:29 Z sleepntsheep 바이오칩 (IZhO12_biochips) C++17
0 / 100
 2000 ms 13016 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 200050
using ll = long long;

int n, m, a[N], timer, dp[2][N];
vector<int> g[N];
vector<tuple<int, int, int>> v;

void dfs(int u)
{
    int in = timer++;
    for (auto v : g[u]) dfs(v);
    int out = timer++;
    v.emplace_back(out, in, a[u]);
}

void schedule()
{
    for (int j = 1; j <= m; ++j)
    {
        for (auto i = 1; i <= n; ++i)
        {
            auto it = partition_point(ALL(v), [&](auto it){ return get<0>(it) < get<1>(v[i]); });
            dp[j&1][i] = max(dp[j&1][i-1], dp[!(j&1)][it-v.begin()] + get<2>(v[i]));
        }
    }
}

int main()
{
    ShinLena;
    cin >> n >> m;
    for (int p, i = 1; i <= n; ++i) cin >> p >> a[i], g[p].push_back(i);
    v={{-1e9,0,0}};dfs(0);
    sort(ALL(v));
    schedule();
    cout << dp[m&1][n];
    return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 6744 KB Output isn't correct
2 Incorrect 1 ms 6748 KB Output isn't correct
3 Incorrect 1 ms 6748 KB Output isn't correct
4 Incorrect 25 ms 7072 KB Output isn't correct
5 Incorrect 35 ms 7024 KB Output isn't correct
6 Incorrect 49 ms 7024 KB Output isn't correct
7 Execution timed out 2025 ms 11472 KB Time limit exceeded
8 Execution timed out 2048 ms 13016 KB Time limit exceeded
9 Execution timed out 2036 ms 11724 KB Time limit exceeded
10 Execution timed out 2061 ms 11720 KB Time limit exceeded