提交记录 9828


用户 题目 状态 得分 用时 内存 语言 代码长度
memset0 noi19c. 【NOI2019】序列 Wrong Answer 28 1.289 ms 2780 KB C++11 2.18 KB
提交时间 评测时间
2019-07-16 17:23:22 2020-08-01 01:55:02
// =================================
//   author: memset0
//   date: 2019.07.16 08:30:00
//   website: https://memset0.cn/
// =================================
#include <bits/stdc++.h>
#define ll long long
#define rep(i, l, r) for (int i = (l), i##ed = (r); i <= i##ed; ++i)
#define for_each(i, a) for (size_t i = 0, i##ed = a.size(); i < i##ed; ++i)
namespace ringo {

template <class T> inline void read(T &x) {
  x = 0; char c = getchar(); bool f = 0;
  while (!isdigit(c)) f ^= c == '-', c = getchar();
  while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
  if (f) x = -x;
}
template <class T> inline void print(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) print(x / 10);
  putchar('0' + x % 10);
}
template <class T> inline void print(T x, char c) { print(x), putchar(c); }
template <class T> inline void print(T a, int l, int r, std::string s = "") {
  if (s != "") std::cout << s << ": ";
  for (int i = l; i <= r; i++) print(a[i], " \n"[i == r]);
}

const int N = 2e5 + 10, M = 32;
ll f[M][M][M][M];
int T, n, m, p, a[N], b[N];

void gaygay() {

}

void main() {
  read(n), read(m), read(p), m -= p;
  if (n > 30) return gaygay();
  for (int i = 1; i <= n; i++) read(a[i]);
  for (int i = 1; i <= n; i++) read(b[i]);
  f[0][0][0][0] = 0;
  // printf("%d %d %d\n", n, m, p);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= i && j <= m; j++)
      for (int k = 0; k <= i && k <= m; k++)
        for (int l = 0; l <= i && l <= p; l++) {
          // printf("> %d %d %d %d\n", i, j, k, l);
          f[i][j][k][l] = f[i - 1][j][k][l];
          if (j) f[i][j][k][l] = std::max(f[i][j][k][l], f[i - 1][j - 1][k][l] + a[i]);
          if (k) f[i][j][k][l] = std::max(f[i][j][k][l], f[i - 1][j][k - 1][l] + b[i]);
          if (l) f[i][j][k][l] = std::max(f[i][j][k][l], f[i - 1][j][k][l - 1] + a[i] + b[i]);
          if (j && k) f[i][j][k][l] = std::max(f[i][j][k][l], f[i - 1][j - 1][k - 1][l] + a[i] + b[i]);
        }
  }
  print(f[n][m][m][p], '\n');
}

} signed main() {
#ifdef memset0
  freopen("sequence2.in", "r", stdin);
#else
  freopen("sequence.in", "r", stdin);
  freopen("sequence.out", "w", stdout);
#endif
  ringo::read(ringo::T);
  while (ringo::T--) {
    ringo::main();
  }
  return 0;
}

CompilationN/AN/ACompile OKScore: N/A

Testcase #157.41 us252 KBAcceptedScore: 4

Testcase #286.78 us348 KBAcceptedScore: 4

Testcase #390.99 us404 KBAcceptedScore: 4

Testcase #4174.9 us972 KBAcceptedScore: 4

Testcase #5275.73 us1 MB + 100 KBAcceptedScore: 4

Testcase #6565.12 us1 MB + 644 KBAcceptedScore: 4

Testcase #71.289 ms2 MB + 732 KBAcceptedScore: 4

Testcase #835.73 us44 KBWrong AnswerScore: 0

Testcase #935.14 us44 KBWrong AnswerScore: 0

Testcase #1035.24 us44 KBWrong AnswerScore: 0

Testcase #1133.97 us44 KBWrong AnswerScore: 0

Testcase #1234.75 us44 KBWrong AnswerScore: 0

Testcase #1334.54 us44 KBWrong AnswerScore: 0

Testcase #1434.57 us44 KBWrong AnswerScore: 0

Testcase #1533.97 us44 KBWrong AnswerScore: 0

Testcase #1635.09 us44 KBWrong AnswerScore: 0

Testcase #1733.86 us44 KBWrong AnswerScore: 0

Testcase #1834.2 us44 KBWrong AnswerScore: 0

Testcase #1933.72 us44 KBWrong AnswerScore: 0

Testcase #2034.15 us44 KBWrong AnswerScore: 0

Testcase #2134.47 us44 KBWrong AnswerScore: 0

Testcase #2234.7 us44 KBWrong AnswerScore: 0

Testcase #2334.29 us44 KBWrong AnswerScore: 0

Testcase #2435.05 us44 KBWrong AnswerScore: 0

Testcase #2534.09 us44 KBWrong AnswerScore: 0


Judge Duck Online | 评测鸭在线
Server Time: 2026-03-30 15:57:41 | Loaded in 2 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠