oj.uz

답안 #90728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90728 2018-12-24T05:54:33 Z mirbek01 바이오칩 (IZhO12_biochips) C++17
100 / 100
 751 ms 21028 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 3e5 + 2;

int n, m, rt, a[N], tin[N], tout[N], timer;
long long dp[2][N], x[N];
vector <int> g[N];

void dfs(int v){
      tin[v] = ++  timer;
      for(int to : g[v]){
            dfs(to);
      }
      tout[v] = timer;
}

int main(){
      scanf("%d %d", &n, &m);

      for(int i = 1; i <= n; i ++){
            int p;
            scanf("%d %lld", &p, x + i);
            if(!p)
                  rt = i;
            else {
                  g[p].push_back(i);
            }
      }

      dfs(rt);

      fill(dp[1], dp[1] + n + 2, -1e18);

      for(int i = 1; i <= n; i ++){
            dp[1][tout[i]] = max(x[i], dp[1][tout[i]]);
      }

      for(int i = 2; i <= m; i ++){
            int cur = i % 2;
            int pre = cur ^ 1;
            fill(dp[cur], dp[cur] + n + 2, -1e18);
            for(int j = 1; j <= n; j ++)
                  dp[pre][j] = max(dp[pre][j], dp[pre][j - 1]);
            for(int j = 1; j <= n; j ++){
                  dp[cur][tout[j]] = max(dp[cur][tout[j]], dp[pre][tin[j] - 1] + x[j]);
            }
      }

      long long ans = 0;

      for(int i = 1; i <= n; i ++)
            ans = max(ans, dp[m % 2][i]);

      cout << ans << endl;
}

Compilation message

biochips.cpp: In function 'int main()':
biochips.cpp:20:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d %d", &n, &m);
       ~~~~~^~~~~~~~~~~~~~~~~
biochips.cpp:24:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %lld", &p, x + i);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 7416 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 6 ms 7448 KB Output is correct
4 Correct 13 ms 8036 KB Output is correct
5 Correct 14 ms 8192 KB Output is correct
6 Correct 16 ms 8236 KB Output is correct
7 Correct 342 ms 15024 KB Output is correct
8 Correct 358 ms 16604 KB Output is correct
9 Correct 563 ms 19020 KB Output is correct
10 Correct 751 ms 21028 KB Output is correct