Submission #6912618


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
typedef long long ll;

int main() {
  ll N,W;
  cin >> N >> W;
  ll INF = 100000000000000;
  vector<ll> weight(110);
  vector<ll> value(110);
  vector<vector<ll>> dp(110, vector<ll>(100100,INF));
  
  for(ll i = 0;i<N;i++){
    cin >> value[i];
    cin >> weight[i];
  }
dp[0][0] = 0;
  rep(i,N){
    rep(sum_v,100100){
      if(sum_v-value[i] >=0){
        chmin(dp[i+1][sum_v],dp[i][sum_v-value[i]]+weight[i]);
      }
      chmin(dp[i+1][sum_v],dp[i][sum_v]);
    }
  }
    ll res = 0;
  for(ll sum_v = 0;sum_v<100100;sum_v++){
    if(dp[N][sum_v]<=W){
      res = max(res,sum_v);
    }
  }
  
cout << res << endl;
  
}

Submission Info

Submission Time
Task D - ナップサック問題
User ysdYSD
Language C++14 (GCC 5.4.1)
Score 0
Code Size 974 Byte
Status RE
Exec Time 141 ms
Memory 88560 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 0 / 34 0 / 33 0 / 33
Status
AC × 2
WA × 2
AC × 3
WA × 16
AC × 1
WA × 1
RE × 15
AC × 2
RE × 12
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 39 ms 87296 KB
subtask00_sample_2.txt WA 43 ms 87296 KB
subtask00_sample_3.txt WA 40 ms 87296 KB
subtask00_sample_4.txt AC 40 ms 87296 KB
subtask01_0.txt WA 43 ms 87296 KB
subtask01_1.txt WA 45 ms 87296 KB
subtask01_10.txt WA 43 ms 87296 KB
subtask01_11.txt WA 43 ms 87296 KB
subtask01_12.txt WA 43 ms 87296 KB
subtask01_13.txt WA 43 ms 87296 KB
subtask01_14.txt WA 43 ms 87296 KB
subtask01_2.txt WA 43 ms 87296 KB
subtask01_3.txt WA 43 ms 87296 KB
subtask01_4.txt WA 43 ms 87296 KB
subtask01_5.txt WA 43 ms 87296 KB
subtask01_6.txt AC 43 ms 87296 KB
subtask01_7.txt WA 43 ms 87296 KB
subtask01_8.txt WA 43 ms 87296 KB
subtask01_9.txt WA 43 ms 87296 KB
subtask02_0.txt RE 138 ms 87296 KB
subtask02_1.txt RE 137 ms 87296 KB
subtask02_10.txt RE 136 ms 87296 KB
subtask02_11.txt RE 136 ms 87296 KB
subtask02_12.txt RE 135 ms 87296 KB
subtask02_13.txt RE 137 ms 87296 KB
subtask02_14.txt RE 136 ms 87296 KB
subtask02_2.txt RE 137 ms 87296 KB
subtask02_3.txt RE 137 ms 87296 KB
subtask02_4.txt RE 138 ms 87296 KB
subtask02_5.txt RE 137 ms 87296 KB
subtask02_6.txt RE 137 ms 87296 KB
subtask02_7.txt RE 136 ms 87296 KB
subtask02_8.txt RE 136 ms 87296 KB
subtask02_9.txt RE 138 ms 87296 KB
subtask03_0.txt RE 136 ms 87296 KB
subtask03_1.txt RE 141 ms 87296 KB
subtask03_10.txt RE 137 ms 87296 KB
subtask03_11.txt RE 137 ms 87296 KB
subtask03_2.txt RE 139 ms 88560 KB
subtask03_3.txt RE 140 ms 87296 KB
subtask03_4.txt RE 138 ms 87424 KB
subtask03_5.txt RE 139 ms 87296 KB
subtask03_6.txt RE 137 ms 87296 KB
subtask03_7.txt RE 139 ms 87296 KB
subtask03_8.txt RE 137 ms 87296 KB
subtask03_9.txt RE 138 ms 87296 KB