oj.uz

Submission #641798

# Submission time Handle Problem Language Result Execution time Memory
641798 2022-09-17T15:48:45 Z dattranxxx Jelly Flavours (IOI20_jelly) C++17
0 / 100
 94 ms 149836 KB 
#include "jelly.h"
#include <vector>
#include <algorithm>
using namespace std;
const int N = 2e3 + 5, M = 1e4 + 5;
using ii = pair<int, int>;
ii a[N], dp[N][M];
ii best(ii& u, ii& v) {
  if (u.first == v.first) return u.second < v.second ? u : v;
  return u.first > v.first ? u : v;
}
int n, X, Y;
int find_maximum_unique(int _x, int _y, std::vector<int> _a, std::vector<int> _b) {
	n = _a.size(), X = _x, Y = _y;
	for (int i = 1; i <= n; ++i)
	  a[i] = {_a[i-1], _b[i-1]};
	sort(a + 1, a + n + 1, [&](ii& u, ii& v) {
    return u.second < v.second;
  });
  for (int x = 0; x <= X; ++x)
    dp[0][x] = {0, 0};
  for (int i = 1; i <= n; ++i) for (int x = 0; x <= X; ++x) {
    dp[i][x] = dp[i-1][x];
    if (x >= a[i].first) {
      auto p = dp[i-1][x-a[i].first]; p.first++;
      dp[i][x] = best(dp[i][x], p);
    }
    if (dp[i-1][x].second + a[i].second <= Y) {
      auto p = dp[i-1][x]; p.first++; p.second += a[i].second;
      dp[i][x] = best(dp[i][x], p);
    }
  }
	return n;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 34276 KB 1st lines differ - on the 1st token, expected: '689', found: '1949'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 88 ms 149836 KB 1st lines differ - on the 1st token, expected: '62', found: '1936'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 94 ms 149672 KB 1st lines differ - on the 1st token, expected: '154', found: '1959'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB 1st lines differ - on the 1st token, expected: '8', found: '9'
2 Halted 0 ms 0 KB -