oj.uz

Submission #978690

# Submission time Handle Problem Language Result Execution time Memory
978690 2024-05-09T14:03:36 Z kunzaZa183 Feast (NOI19_feast) C++17
0 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 8;
int arr[maxn];
int dp[maxn][2], counti[maxn][2]; // 0 = closed, 1 = open
int32_t main()
{
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++)
    cin >> arr[i];
  int l = 0, r = 1e18;
  while (l < r)
  {
    int cost = (l + r) / 2;
    memset(counti, 0, sizeof counti);
    memset(dp, 0, sizeof dp);
    for (int i = 0; i < n; i++)
    {
      dp[i + 1][0] = dp[i][0];
      counti[i + 1][0] = counti[i][0];

      if ((dp[i + 1][0] < dp[i][0] - cost + arr[i]) || (dp[i+1][0] == dp[i][0] - cost + arr[i] && counti[i+1][0] > counti[i][0] + 1))
      {
        dp[i + 1][0] = dp[i][0] - cost + arr[i];
        counti[i + 1][0] = counti[i][0] + 1;
      }

      if ((dp[i + 1][0] < dp[i][1] - cost + arr[i]) || (dp[i + 1][0] == dp[i][1] - cost + arr[i] && counti[i + 1][0] > counti[i][1] + 1))
      {
        dp[i + 1][0] = dp[i][1] - cost + arr[i];
        counti[i + 1][0] = counti[i][1] + 1;
      }

      dp[i + 1][1] = dp[i][0] + arr[i];
      counti[i + 1][1] = counti[i][0];

      if ((dp[i + 1][1] < dp[i][1] + arr[i]) || (dp[i + 1][1] == dp[i][1] + arr[i] && counti[i][1]<counti[i+1][1]))
      {
        dp[i + 1][1] = dp[i][1] + arr[i];
        counti[i + 1][1] = counti[i][1];
      }
    }
    if (counti[n][0] <= k)
      r = cost;
    else if (counti[n][0] > k)
      l = cost + 1;
  }
  int cost = l;
  for (int i = 0; i < n; i++)
  {
    dp[i + 1][0] = dp[i][0];
    counti[i + 1][0] = counti[i][0];

    if ((dp[i + 1][0] < dp[i][0] - cost + arr[i]) || (dp[i + 1][0] == dp[i][0] - cost + arr[i] && counti[i + 1][0] > counti[i][0] + 1))
    {
      dp[i + 1][0] = dp[i][0] - cost + arr[i];
      counti[i + 1][0] = counti[i][0] + 1;
    }

    if ((dp[i + 1][0] < dp[i][1] - cost + arr[i]) || (dp[i + 1][0] == dp[i][1] - cost + arr[i] && counti[i + 1][0] > counti[i][1] + 1))
    {
      dp[i + 1][0] = dp[i][1] - cost + arr[i];
      counti[i + 1][0] = counti[i][1] + 1;
    }

    dp[i + 1][1] = dp[i][0] + arr[i];
    counti[i + 1][1] = counti[i][0];

    if ((dp[i + 1][1] < dp[i][1] + arr[i]) || (dp[i + 1][1] == dp[i][1] + arr[i] && counti[i][1] < counti[i + 1][1]))
    {
      dp[i + 1][1] = dp[i][1] + arr[i];
      counti[i + 1][1] = counti[i][1];
    }
  }
  if (counti[n][0] <= k)
    r = cost;
  else if (counti[n][0] > k)
    l = cost + 1;
  cout << dp[n][0] + l * counti[n][0] << "\n";
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -