Submission #607979
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;
vector<int> vs, cs;
Integer vsum=0, csum=0;
rep (i, N) {
int v, c; cin >> v >> c;
vsum += v;
csum += c;
vs.push_back(v);
cs.push_back(c);
}
if (csum <= C) {
cout << vsum << endl;
return 0;
}
if (csum < M) { // DP respect to cost
trace(2);
rep(i, M) table[i] = - 2e9;
table[0] = 0;
for (int i = 0; i < N; ++i) {
int c=cs[i];
int v=vs[i];
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;
return 0;
}
if (vsum < M) { // DP respect to value
trace(3);
rep(i,M) table[i] = 2e9;
table[0] = 0;
for (int i = 0; i < N; ++i) {
int c=cs[i];
int v=vs[i];
for (int k = M; k >= 0; --k) {
if (v+k >=M)continue;
table[v+k] = min(table[v+k], table[k] + c);
}
}
int ans = 0;
rep (k,M){
if (table[k] <= C) ans = max(ans, k);
}
cout << ans << endl;
return 0;
}
return 1;
}
Submission Info
Submission Time |
|
Task |
D - ナップサック問題 |
User |
cympfh |
Language |
C++11 (GCC 4.9.2) |
Score |
66 |
Code Size |
2955 Byte |
Status |
RE |
Exec Time |
147 ms |
Memory |
2468 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Subtask3 |
Score / Max Score |
0 / 0 |
0 / 34 |
33 / 33 |
33 / 33 |
Status |
|
|
|
|
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 |
29 ms |
2332 KB |
subtask00_sample_2.txt |
RE |
26 ms |
924 KB |
subtask00_sample_3.txt |
AC |
28 ms |
2336 KB |
subtask00_sample_4.txt |
AC |
33 ms |
2336 KB |
subtask01_0.txt |
RE |
26 ms |
800 KB |
subtask01_1.txt |
RE |
24 ms |
920 KB |
subtask01_10.txt |
RE |
26 ms |
804 KB |
subtask01_11.txt |
RE |
24 ms |
796 KB |
subtask01_12.txt |
RE |
26 ms |
800 KB |
subtask01_13.txt |
RE |
25 ms |
804 KB |
subtask01_14.txt |
RE |
26 ms |
924 KB |
subtask01_2.txt |
RE |
28 ms |
928 KB |
subtask01_3.txt |
RE |
25 ms |
928 KB |
subtask01_4.txt |
RE |
24 ms |
796 KB |
subtask01_5.txt |
AC |
26 ms |
800 KB |
subtask01_6.txt |
AC |
42 ms |
2456 KB |
subtask01_7.txt |
RE |
27 ms |
764 KB |
subtask01_8.txt |
RE |
26 ms |
924 KB |
subtask01_9.txt |
RE |
24 ms |
804 KB |
subtask02_0.txt |
AC |
81 ms |
2264 KB |
subtask02_1.txt |
AC |
35 ms |
2344 KB |
subtask02_10.txt |
AC |
38 ms |
2340 KB |
subtask02_11.txt |
AC |
44 ms |
2464 KB |
subtask02_12.txt |
AC |
51 ms |
2464 KB |
subtask02_13.txt |
AC |
26 ms |
792 KB |
subtask02_14.txt |
AC |
30 ms |
2340 KB |
subtask02_2.txt |
AC |
68 ms |
2336 KB |
subtask02_3.txt |
AC |
35 ms |
2468 KB |
subtask02_4.txt |
AC |
69 ms |
2340 KB |
subtask02_5.txt |
AC |
33 ms |
2336 KB |
subtask02_6.txt |
AC |
63 ms |
2464 KB |
subtask02_7.txt |
AC |
49 ms |
2460 KB |
subtask02_8.txt |
AC |
36 ms |
2364 KB |
subtask02_9.txt |
AC |
61 ms |
2460 KB |
subtask03_0.txt |
AC |
120 ms |
2332 KB |
subtask03_1.txt |
AC |
120 ms |
2460 KB |
subtask03_10.txt |
AC |
119 ms |
2344 KB |
subtask03_11.txt |
AC |
119 ms |
2336 KB |
subtask03_2.txt |
AC |
124 ms |
2456 KB |
subtask03_3.txt |
AC |
120 ms |
2460 KB |
subtask03_4.txt |
AC |
123 ms |
2332 KB |
subtask03_5.txt |
AC |
120 ms |
2336 KB |
subtask03_6.txt |
AC |
118 ms |
2464 KB |
subtask03_7.txt |
AC |
130 ms |
2292 KB |
subtask03_8.txt |
AC |
123 ms |
2456 KB |
subtask03_9.txt |
AC |
147 ms |
2340 KB |