結果
問題 | No.2840 RGB Plates |
ユーザー | fuppy_kyopro |
提出日時 | 2024-08-09 23:01:13 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,083 bytes |
コンパイル時間 | 2,364 ms |
コンパイル使用メモリ | 214,780 KB |
実行使用メモリ | 14,340 KB |
最終ジャッジ日時 | 2024-08-09 23:01:52 |
合計ジャッジ時間 | 37,502 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 20 ms
14,208 KB |
testcase_01 | AC | 20 ms
14,200 KB |
testcase_02 | AC | 22 ms
14,176 KB |
testcase_03 | AC | 19 ms
14,336 KB |
testcase_04 | TLE | - |
testcase_05 | AC | 23 ms
14,336 KB |
testcase_06 | AC | 24 ms
14,132 KB |
testcase_07 | AC | 26 ms
14,336 KB |
testcase_08 | AC | 27 ms
14,208 KB |
testcase_09 | AC | 1,398 ms
14,304 KB |
testcase_10 | AC | 23 ms
14,336 KB |
testcase_11 | TLE | - |
testcase_12 | AC | 1,349 ms
14,208 KB |
testcase_13 | AC | 1,926 ms
14,208 KB |
testcase_14 | AC | 1,707 ms
14,208 KB |
testcase_15 | AC | 1,591 ms
14,208 KB |
testcase_16 | AC | 1,841 ms
14,144 KB |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | AC | 346 ms
14,208 KB |
testcase_23 | AC | 298 ms
14,208 KB |
testcase_24 | AC | 409 ms
14,340 KB |
testcase_25 | AC | 1,458 ms
14,208 KB |
testcase_26 | AC | 1,056 ms
14,208 KB |
testcase_27 | AC | 1,090 ms
14,188 KB |
testcase_28 | AC | 1,309 ms
14,208 KB |
testcase_29 | TLE | - |
ソースコード
/* #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //*/ // #include <atcoder/all> #include <bits/stdc++.h> using namespace std; // using namespace atcoder; // #define _GLIBCXX_DEBUG #define DEBUG(x) cerr << #x << ": " << x << endl; #define DEBUG_VEC(v) \ cerr << #v << ":"; \ for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \ cerr << " " << v[iiiiiiii]; \ cerr << endl; #define DEBUG_MAT(v) \ cerr << #v << endl; \ for (int iv = 0; iv < v.size(); iv++) { \ for (int jv = 0; jv < v[iv].size(); jv++) { \ cerr << v[iv][jv] << " "; \ } \ cerr << endl; \ } typedef long long ll; // #define int ll #define vi vector<int> #define vl vector<ll> #define vii vector<vector<int>> #define vll vector<vector<ll>> #define pii pair<int, int> #define pis pair<int, string> #define psi pair<string, int> #define pll pair<ll, ll> template <class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); } template <class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); } template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep1(i, n) for (int i = 1; i <= (int)(n); i++) #define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define rrep1(i, n) for (int i = (int)(n); i > 0; i--) #define REP(i, a, b) for (int i = a; i < b; i++) #define in(x, a, b) (a <= x && x < b) #define all(c) c.begin(), c.end() void YES(bool t = true) { cout << (t ? "YES" : "NO") << endl; } void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; } void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; } void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; } void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; } void no(bool t = true) { cout << (t ? "no" : "yes") << endl; } template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } template <class T, class U> T ceil_div(T a, U b) { return (a + b - 1) / b; } template <class T> T safe_mul(T a, T b) { if (a == 0 || b == 0) return 0; if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max(); return a * b; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; int popcount(ll t) { return __builtin_popcountll(t); } vector<int> gen_perm(int n) { vector<int> ret(n); iota(all(ret), 0); return ret; } // int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; // int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 }; vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0}; vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1}; struct Setup_io { Setup_io() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cout << fixed << setprecision(25); cerr << fixed << setprecision(25); } } setup_io; // constexpr ll MOD = 1000000007; constexpr ll MOD = 998244353; // #define mp make_pair struct dice { mt19937 mt; dice() : mt(chrono::steady_clock::now().time_since_epoch().count()) {} // [0, x)の一様乱数 ll operator()(ll x) { return this->operator()(0, x); } // [x, y)の一様乱数 ll operator()(ll x, ll y) { uniform_int_distribution<ll> dist(x, y - 1); return dist(mt); } vl operator()(int n, ll x, ll y) { vl res(n); for (int i = 0; i < n; i++) res[i] = this->operator()(x, y); return res; } } rnd; std::random_device seed_gen; std::mt19937 engine(seed_gen()); signed main() { int n; cin >> n; vi a(n); rep(i, n) { cin >> a[i]; } int offset = 50000; int W = 2 * offset + 1; vii dp(W, vi(2, -1)); dp[offset][0] = 0; auto ndp = dp; shuffle(all(a), engine); for (int x : a) { rep(i, W) rep(j, 2) { ndp[i][j] = -1; } rep(i, W) { rep(j, 2) { if (dp[i][j] == -1) continue; chmax(ndp[i][j], dp[i][j] + x); if (i + x < W) chmax(ndp[i + x][1], dp[i][j]); if (i - x >= 0) chmax(ndp[i - x][1], dp[i][j]); } } swap(dp, ndp); } if (dp[offset][1] == 0) { dp[offset][1] = -1; } cout << dp[offset][1] << endl; }