oj.uz

Submission #221939

# Submission time Handle Problem Language Result Execution time Memory
221939 2020-04-11T14:26:48 Z Haunted_Cpp Džumbus (COCI19_dzumbus) C++17
110 / 110
 908 ms 17400 KB 
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>

#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

using namespace std;

const int N = 1e3 + 5;
const int DUMMY = 0;
const long long INF = 1e15 + 5;

long long dp [N][N][2];
long long cost [N];
int sub [N];

vector<int> g [N];

bool vis [N];

void join (int node, int p = -1) {
  vis[node] = true;
  for (auto to : g[node]) {
    if (!vis[to]) {
      vis[to] = true;
      join (to, node);
    }
  }
}

// DP[NODE][SCORE][IS_VALID]
// IS_VALID Denotes if the current component ending at node i, has >= 2 nodes

void dfs (int node = 0, int p = -1) { 
  dp[node][0][0] = 0;
  sub[node] = 1;
  for (auto to : g[node]) {
    if (to == p) continue;
    dfs (to, node);
    sub[node] += sub[to];
    // USE
    for (int i = sub[node]; i >= 2; i--) {
      for (int j = i; j >= 0; j--) {
        dp[node][i][1] = min (dp[node][i][1], dp[node][i - j][1] + dp[to][j][1]);
        dp[node][i][1] = min (dp[node][i][1], dp[node][i - j][1] + dp[to][j][0]);
        if (i - j - 1 >= 0 && j - 1 >= 0) { 
          dp[node][i][1] = min (dp[node][i][1], dp[node][i - j - 1][0] + cost[node] + dp[to][j - 1][0] + cost[to]);
        }
        if (j - 1 >= 0) {
          dp[node][i][1] = min (dp[node][i][1], dp[node][i - j][1] + dp[to][j - 1][0] + cost[to]);
        }
        if (i - j - 1 >= 0) {
           dp[node][i][1] = min (dp[node][i][1], dp[node][i - j - 1][0] + cost[node] + dp[to][j][1]);
         }
      }
    }  
    // NOT USE
    for (int i = sub[node]; i >= 2; i--) {
      for (int j = i; j >= 0; j--) {
        dp[node][i][0] = min (dp[node][i][0], dp[node][i - j][0] + min (dp[to][j][0], dp[to][j][1]));
      }
    }
  }
}

int main () {
  int n, m;
  scanf ("%d %d", &n, &m);
  cost[0] = INF;
  for (int i = 1; i <= n; i++) scanf ("%lld", &cost[i]);
  for (int i = 0; i < m; i++) {
    int st, et;
    scanf ("%d %d", &st, &et);
    g[st].emplace_back(et);
    g[et].emplace_back(st);
  }
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      g[DUMMY].emplace_back(i);
      join (i);
    }
  }
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      dp[i][j][0] = dp[i][j][1] = INF;
    }
  }
  dfs ();
  int q;
  scanf ("%d", &q);
  while (q--) {
    int budget;
    scanf ("%d", &budget);
    int ans = 0;
    for (int i = N - 1; i >= 0; i--) {
      if (dp[0][i][0] <= budget) {
        ans = max (ans, i);
        break;
      }
    }
    printf ("%d\n", ans);
  }
  return 0;
}

Compilation message

dzumbus.cpp: In function 'int main()':
dzumbus.cpp:71:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d %d", &n, &m);
   ~~~~~~^~~~~~~~~~~~~~~~~
dzumbus.cpp:73:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (int i = 1; i <= n; i++) scanf ("%lld", &cost[i]);
                                ~~~~~~^~~~~~~~~~~~~~~~~~
dzumbus.cpp:76:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d %d", &st, &et);
     ~~~~~~^~~~~~~~~~~~~~~~~~~
dzumbus.cpp:93:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d", &q);
   ~~~~~~^~~~~~~~~~
dzumbus.cpp:96:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d", &budget);
     ~~~~~~^~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 426 ms 16128 KB Output is correct
2 Correct 600 ms 16376 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 426 ms 16128 KB Output is correct
2 Correct 600 ms 16376 KB Output is correct
3 Correct 793 ms 17272 KB Output is correct
4 Correct 478 ms 17400 KB Output is correct
5 Correct 481 ms 16760 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 17020 KB Output is correct
2 Correct 148 ms 16760 KB Output is correct
3 Correct 156 ms 16632 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 426 ms 16128 KB Output is correct
2 Correct 600 ms 16376 KB Output is correct
3 Correct 793 ms 17272 KB Output is correct
4 Correct 478 ms 17400 KB Output is correct
5 Correct 481 ms 16760 KB Output is correct
6 Correct 148 ms 17020 KB Output is correct
7 Correct 148 ms 16760 KB Output is correct
8 Correct 156 ms 16632 KB Output is correct
9 Correct 162 ms 17016 KB Output is correct
10 Correct 511 ms 17004 KB Output is correct
11 Correct 908 ms 16760 KB Output is correct