Submission #607343


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);++i)
#define loop for(;;)
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
#define all(v) begin(v),end(v)
#define pb push_back
#define inf (1e9)
#define eps (1e-9)
using Integer = long long;
using Real = long double;
const Real PI = acosl(-1);
using P = pair<int, int>;

template<class S, class T> inline
ostream& operator<<(ostream&os, pair<S,T> p) {
  return os << '(' << p.first << ", " << p.second << ')';
}

template<class T, class U> inline
ostream& operator<<(ostream&os, tuple<T,U> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ')';
}

template<class S, class T, class U> inline
ostream& operator<<(ostream&os, tuple<S,T,U> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ", "
    << get<2>(t) << ')';
}

template<class T> inline
ostream& operator<<(ostream&os, set<T> v) {
  os << "(set";
  for (T item: v) os << ' ' << item;
  os << ")";
  return os;
}

template<class T> inline
ostream& operator<<(ostream&os, vector<T> v) {
  if (v.size() == 0) { return os << "(empty)"; }
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

template<class T> inline
istream& operator>>(istream&is, vector<T>&v) {
  rep (i, v.size()) is >> v[i];
  return is;
}

//           ^   >  v   <
int dx[] = { -1, 0, 1,  0 };
int dy[] = {  0, 1, 0, -1 };

using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
const string A = "Takahashi";
const string B = "Aoki";

constexpr int M = 200*1000+10;
Integer table[M];
int main() {

  int N,C; cin >> N >> C;
  assert(C<M);
  for (int i = 0; i <= C; ++i) {
    table[i] = - 1e9;
  }
  table[0] = 0;
  for (int i = 0; i < N; ++i) {
    int v, c;  cin >> v >> c;
    for (int k = C; k >= 0; --k) {
      if (c+k > C) continue;
      table[c+k] = max(table[c+k], table[k] + v);
    }
  }


Integer ans = table[0];
for (int k = 0; k <= C; ++k) {
  ans = max(ans, table[k]);
}
cout << ans << endl;

}

Submission Info

Submission Time
Task D - ナップサック問題
User cympfh
Language C++11 (GCC 4.9.2)
Score 33
Code Size 2166 Byte
Status RE
Exec Time 297 ms
Memory 1564 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 0 / 34 33 / 33 0 / 33
Status
AC × 2
RE × 2
AC × 3
RE × 16
AC × 17
AC × 1
RE × 13
Set Name Test Cases
Sample subtask00_sample_1.txt, subtask00_sample_2.txt, subtask00_sample_3.txt, subtask00_sample_4.txt
Subtask1 subtask01_0.txt, subtask01_1.txt, subtask01_10.txt, subtask01_11.txt, subtask01_12.txt, subtask01_13.txt, subtask01_14.txt, subtask01_2.txt, subtask01_3.txt, subtask01_4.txt, subtask01_5.txt, subtask01_6.txt, subtask01_7.txt, subtask01_8.txt, subtask01_9.txt, subtask00_sample_1.txt, subtask00_sample_2.txt, subtask00_sample_3.txt, subtask00_sample_4.txt
Subtask2 subtask02_0.txt, subtask02_1.txt, subtask02_10.txt, subtask02_11.txt, subtask02_12.txt, subtask02_13.txt, subtask02_14.txt, subtask02_2.txt, subtask02_3.txt, subtask02_4.txt, subtask02_5.txt, subtask02_6.txt, subtask02_7.txt, subtask02_8.txt, subtask02_9.txt, subtask00_sample_1.txt, subtask00_sample_3.txt
Subtask3 subtask03_0.txt, subtask03_1.txt, subtask03_10.txt, subtask03_11.txt, subtask03_2.txt, subtask03_3.txt, subtask03_4.txt, subtask03_5.txt, subtask03_6.txt, subtask03_7.txt, subtask03_8.txt, subtask03_9.txt, subtask00_sample_1.txt, subtask00_sample_4.txt
Case Name Status Exec Time Memory
subtask00_sample_1.txt AC 26 ms 916 KB
subtask00_sample_2.txt RE 280 ms 924 KB
subtask00_sample_3.txt AC 26 ms 796 KB
subtask00_sample_4.txt RE 280 ms 924 KB
subtask01_0.txt RE 278 ms 912 KB
subtask01_1.txt RE 278 ms 800 KB
subtask01_10.txt RE 278 ms 800 KB
subtask01_11.txt RE 277 ms 792 KB
subtask01_12.txt RE 280 ms 800 KB
subtask01_13.txt RE 283 ms 800 KB
subtask01_14.txt RE 288 ms 932 KB
subtask01_2.txt RE 280 ms 920 KB
subtask01_3.txt RE 279 ms 796 KB
subtask01_4.txt RE 281 ms 804 KB
subtask01_5.txt AC 25 ms 800 KB
subtask01_6.txt RE 278 ms 812 KB
subtask01_7.txt RE 284 ms 796 KB
subtask01_8.txt RE 280 ms 796 KB
subtask01_9.txt RE 280 ms 804 KB
subtask02_0.txt AC 78 ms 1564 KB
subtask02_1.txt AC 35 ms 924 KB
subtask02_10.txt AC 35 ms 804 KB
subtask02_11.txt AC 42 ms 928 KB
subtask02_12.txt AC 49 ms 1048 KB
subtask02_13.txt AC 26 ms 916 KB
subtask02_14.txt AC 30 ms 804 KB
subtask02_2.txt AC 67 ms 1432 KB
subtask02_3.txt AC 33 ms 800 KB
subtask02_4.txt AC 70 ms 1316 KB
subtask02_5.txt AC 30 ms 752 KB
subtask02_6.txt AC 61 ms 1304 KB
subtask02_7.txt AC 49 ms 1052 KB
subtask02_8.txt AC 34 ms 1044 KB
subtask02_9.txt AC 63 ms 1180 KB
subtask03_0.txt RE 279 ms 916 KB
subtask03_1.txt RE 279 ms 796 KB
subtask03_10.txt RE 280 ms 808 KB
subtask03_11.txt RE 283 ms 800 KB
subtask03_2.txt RE 289 ms 912 KB
subtask03_3.txt RE 290 ms 800 KB
subtask03_4.txt RE 280 ms 928 KB
subtask03_5.txt RE 297 ms 924 KB
subtask03_6.txt RE 278 ms 800 KB
subtask03_7.txt RE 285 ms 912 KB
subtask03_8.txt RE 283 ms 796 KB
subtask03_9.txt RE 289 ms 840 KB