oj.uz

답안 #344695

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
344695 2021-01-06T08:19:50 Z talant117408 바이오칩 (IZhO12_biochips) C++17
100 / 100
 293 ms 401844 KB 
/*
    Code written by Talant I.D.
*/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
 
//using namespace __gnu_pbds;
using namespace std;
 
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 2e5+7, M = 503;
int dp[N][M], cost[N], timer = 1;
pii previous[N];
vector <vector <int>> graph(N);

void dfs(int v, int p){
    int entering = timer;
    for(auto to : graph[v])
        if(to != p) dfs(to, v);
    
    previous[timer] = mp(entering, cost[v]);
    timer++;
}

int main(){
    do_not_disturb
    
    int n, m;
    cin >> n >> m;
    
    int root = 0;
    for(int i = 1; i <= n; i++){
        int x;
        cin >> x >> cost[i];
        if(x) graph[x].pb(i);
        else root = i;
    }
    
    dfs(root, root);
    
    for(int i = 0; i <= n; i++){
        for(int j = 1; j <= m; j++){
            dp[i][j] = -1e9;
        }
    }
    
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            dp[i][j] = max(dp[i-1][j], dp[previous[i].first-1][j-1]+previous[i].second);
        }
    }
    cout << dp[n][m];
    
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5228 KB Output is correct
4 Correct 16 ms 22912 KB Output is correct
5 Correct 17 ms 25088 KB Output is correct
6 Correct 19 ms 25068 KB Output is correct
7 Correct 223 ms 299756 KB Output is correct
8 Correct 229 ms 299884 KB Output is correct
9 Correct 268 ms 364012 KB Output is correct
10 Correct 293 ms 401844 KB Output is correct