結果
問題 | No.2261 Coffee |
ユーザー | fuppy_kyopro |
提出日時 | 2023-04-07 21:33:45 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 257 ms / 2,000 ms |
コード長 | 4,163 bytes |
コンパイル時間 | 3,485 ms |
コンパイル使用メモリ | 227,616 KB |
実行使用メモリ | 39,208 KB |
最終ジャッジ日時 | 2024-04-27 04:35:24 |
合計ジャッジ時間 | 12,729 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 3 ms
6,944 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 3 ms
6,940 KB |
testcase_06 | AC | 3 ms
6,944 KB |
testcase_07 | AC | 4 ms
6,940 KB |
testcase_08 | AC | 3 ms
6,940 KB |
testcase_09 | AC | 3 ms
6,944 KB |
testcase_10 | AC | 3 ms
6,940 KB |
testcase_11 | AC | 3 ms
6,940 KB |
testcase_12 | AC | 3 ms
6,944 KB |
testcase_13 | AC | 3 ms
6,944 KB |
testcase_14 | AC | 3 ms
6,940 KB |
testcase_15 | AC | 3 ms
6,940 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | AC | 11 ms
6,940 KB |
testcase_18 | AC | 11 ms
6,944 KB |
testcase_19 | AC | 15 ms
6,940 KB |
testcase_20 | AC | 7 ms
6,940 KB |
testcase_21 | AC | 9 ms
6,940 KB |
testcase_22 | AC | 8 ms
6,940 KB |
testcase_23 | AC | 12 ms
6,940 KB |
testcase_24 | AC | 242 ms
36,480 KB |
testcase_25 | AC | 205 ms
31,872 KB |
testcase_26 | AC | 256 ms
38,892 KB |
testcase_27 | AC | 233 ms
36,224 KB |
testcase_28 | AC | 174 ms
33,280 KB |
testcase_29 | AC | 170 ms
32,512 KB |
testcase_30 | AC | 133 ms
26,240 KB |
testcase_31 | AC | 208 ms
39,184 KB |
testcase_32 | AC | 208 ms
39,208 KB |
testcase_33 | AC | 213 ms
39,168 KB |
testcase_34 | AC | 211 ms
39,044 KB |
testcase_35 | AC | 211 ms
39,168 KB |
testcase_36 | AC | 210 ms
39,156 KB |
testcase_37 | AC | 211 ms
39,040 KB |
testcase_38 | AC | 255 ms
39,168 KB |
testcase_39 | AC | 255 ms
39,128 KB |
testcase_40 | AC | 255 ms
39,040 KB |
testcase_41 | AC | 254 ms
39,168 KB |
testcase_42 | AC | 251 ms
39,040 KB |
testcase_43 | AC | 249 ms
39,040 KB |
testcase_44 | AC | 257 ms
39,168 KB |
ソースコード
//* #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //*/ // #include <atcoder/all> #include <atcoder/lazysegtree> #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 vs vector<string> #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 X first #define Y second #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; } #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); } // 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); } } setup_io; // const ll MOD = 1000000007; const ll MOD = 998244353; // #define mp make_pair //#define endl '\n' signed main() { int n; cin >> n; vll a(n, vl(5)); rep(i, n) { rep(j, 5) { cin >> a[i][j]; } } vll val(n, vl(1 << 5)); vl ma(1 << 5, -INF); rep(i, n) { rep(j, 1 << 5) { rep(k, 5) { if (j & (1 << k)) { val[i][j] += a[i][k]; } else { val[i][j] -= a[i][k]; } } chmax(ma[j], val[i][j]); } } int zen = (1 << 5) - 1; rep(i, n) { ll ans = -INF; rep(j, 1 << 5) { int k = zen - j; chmax(ans, val[i][j] + ma[k]); } cout << ans << endl; } }