oj.uz

Submission #1028510

# Submission time Handle Problem Language Result Execution time Memory
1028510 2024-07-20T03:11:05 Z vjudge1 Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll inf = 1e18;

int main()
{
  int n, a, b;
  cin >> n >> a >> b;
  vector<int> v(n);
  for(int i = 0; i < n; i ++)
    cin >> v[i];

  ll dp[1 + n][1 + b];
  for(int i = 0; i <= n; i ++)
    for(int j = 0; j <= b; j ++)
      dp[i][j] = inf;

  dp[0][0] = 0;
  for(int i = 1; i <= n; i ++)
    for(int j = 1; j <= i && j <= b; j++)
      {
	ll sm = 0; 
	for(int k = i; k >= j; k--)
	  {
	    sm += v[k - 1];
	    dp[i][j] = min(dp[i][j], dp[k - 1][j - 1] | sm);
	  }
      }

  cout << dp[n][b] << endl;
  return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -