結果
問題 | No.1522 Unfairness |
ユーザー |
|
提出日時 | 2021-05-28 21:21:02 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 98 ms / 2,000 ms |
コード長 | 2,673 bytes |
コンパイル時間 | 1,073 ms |
コンパイル使用メモリ | 110,396 KB |
実行使用メモリ | 81,792 KB |
最終ジャッジ日時 | 2024-11-19 06:09:21 |
合計ジャッジ時間 | 2,853 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
#include<vector>#include<set>#include<map>#include<queue>#include<string>#include<algorithm>#include<iostream>#include<bitset>#include<functional>#include<numeric>#include<cstdio>#include<cstring>#include<cstdlib>#include<cassert>#include<cmath>#include<iomanip>#include<random>#include<ctime>#include<complex>using namespace std;typedef long long LL;typedef double D;#define all(v) (v).begin(), (v).end()mt19937 gene(233);typedef complex<double> Complex;#define fi first#define se second#define ins insert#define pb push_backinline char GET_CHAR(){const int maxn = 131072;static char buf[maxn],*p1=buf,*p2=buf;return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;}inline int getInt() {int res(0);char c = getchar();while(c < '0') c = getchar();while(c >= '0') {res = res * 10 + (c - '0');c = getchar();}return res;}inline LL fastpo(LL x, LL n, LL mod) {LL res(1);while(n) {if(n & 1) {res = res * (LL)x % mod;}x = x * (LL) x % mod;n /= 2;}return res;}LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }inline string itoa(int x, int width = 0) {string res;if(x == 0) res.push_back('0');while(x) {res.push_back('0' + x % 10);x /= 10;}while((int)res.size() < width) res.push_back('0');reverse(res.begin(), res.end());return res;}const int _B = 131072;char buf[_B];int _bl = 0;inline void flush() {fwrite(buf, 1, _bl, stdout);_bl = 0;}__inline void _putchar(char c) {if(_bl == _B) flush();buf[_bl++] = c;}inline void print(LL x, char c) {static char tmp[20];int l = 0;if(!x) tmp[l++] = '0';else {while(x) {tmp[l++] = x % 10 + '0';x /= 10;}}for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);_putchar(c);}struct P {D x, y;};const int N = 3333;const int LOG = 20;const int mod = 1e9 + 7;const int inf = 1e9 + 7;int n, m;int dx[4] = {1, 0, -1, 0};int dy[4] = {0, 1, 0, -1};LL dp[N][N], a[N];int main() {int n, m;scanf("%d%d", &n, &m);for(int i = 1; i <= n; i++) {cin >> a[i];}sort(a + 1, a +1 + n);for(int i = n; i >= 1; i--) {for(int j = 0; j <= m; j++) {dp[i - 1][j] = max(dp[i - 1][j], dp[i][j]);if(j + a[i] - a[i - 1] <= m) dp[i - 2][j + a[i] - a[i - 1]] = max(dp[i - 2][j + a[i] - a[i - 1]], dp[i][j] + a[i]);}}LL ans = 0;for(int j = 0; j <= m; j++) ans = max(ans, dp[0][j]);cout << ans << endl;}