Submission #8519013
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
int main() {
int N,P; cin >> N >> P;
int A =5200,B = 101;
auto dp = multivector(A,B,0);
vector<int> a(N),b(N);
for(int i = 0; i < N; ++i) cin >> a[i] >> b[i];
vector<int> idx(N);
iota(ALL(idx),0);
sort(ALL(idx),[&](int l,int r){return a[l]>a[r];});
vector<int> maxi(A,0);
for(auto i:idx){
for(int j = A-1; 0 <= j; --j)if(j+a[i]<A) chmax(dp[j+a[i]][a[i]],maxi[j]+b[i]);
for(int j = 0; j < A; ++j) chmax(maxi[j],dp[j][a[i]]);
}
int ans = 0;
for(int i = 0; i < A; ++i) {
for(int j = 0; j < B; ++j){
if(i-j<=P) {
chmax(ans,dp[i][j]);
}
}
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
C - おやつ |
User |
ningenMe |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3482 Byte |
Status |
AC |
Exec Time |
186 ms |
Memory |
4608 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
50 / 50 |
50 / 50 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 |
sample_01.txt, sample_02.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt |
Subtask2 |
sample_01.txt, sample_02.txt, sample_03.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask2_00.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
3 ms |
2560 KB |
sample_02.txt |
AC |
3 ms |
2560 KB |
sample_03.txt |
AC |
3 ms |
2560 KB |
subtask1_00.txt |
AC |
4 ms |
2560 KB |
subtask1_01.txt |
AC |
5 ms |
2560 KB |
subtask1_02.txt |
AC |
5 ms |
2560 KB |
subtask1_03.txt |
AC |
4 ms |
2560 KB |
subtask1_04.txt |
AC |
4 ms |
2560 KB |
subtask1_05.txt |
AC |
6 ms |
2560 KB |
subtask1_06.txt |
AC |
5 ms |
2560 KB |
subtask1_07.txt |
AC |
5 ms |
2560 KB |
subtask1_08.txt |
AC |
5 ms |
2560 KB |
subtask1_09.txt |
AC |
7 ms |
2560 KB |
subtask1_10.txt |
AC |
7 ms |
2560 KB |
subtask1_11.txt |
AC |
7 ms |
2560 KB |
subtask1_12.txt |
AC |
7 ms |
2560 KB |
subtask1_13.txt |
AC |
7 ms |
2560 KB |
subtask1_14.txt |
AC |
7 ms |
2560 KB |
subtask2_00.txt |
AC |
35 ms |
2560 KB |
subtask2_01.txt |
AC |
38 ms |
2560 KB |
subtask2_02.txt |
AC |
143 ms |
2560 KB |
subtask2_03.txt |
AC |
45 ms |
2560 KB |
subtask2_04.txt |
AC |
170 ms |
2560 KB |
subtask2_05.txt |
AC |
107 ms |
2560 KB |
subtask2_06.txt |
AC |
21 ms |
2560 KB |
subtask2_07.txt |
AC |
22 ms |
2560 KB |
subtask2_08.txt |
AC |
23 ms |
2560 KB |
subtask2_09.txt |
AC |
60 ms |
2560 KB |
subtask2_10.txt |
AC |
186 ms |
2560 KB |
subtask2_11.txt |
AC |
186 ms |
2560 KB |
subtask2_12.txt |
AC |
186 ms |
2560 KB |
subtask2_13.txt |
AC |
186 ms |
2560 KB |
subtask2_14.txt |
AC |
185 ms |
2560 KB |
subtask2_15.txt |
AC |
186 ms |
2560 KB |
subtask2_16.txt |
AC |
186 ms |
4608 KB |
subtask2_17.txt |
AC |
186 ms |
2560 KB |
subtask2_18.txt |
AC |
186 ms |
2560 KB |
subtask2_19.txt |
AC |
186 ms |
2560 KB |