fork download
copy 
  1. //#pragma GCC optimize("O3", "unroll-loops")
  2. //#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
  3.  
  4. #include <bits/stdc++.h>
  5. #define ldb long double
  6. //#define double ldb
  7. #define db double
  8. #define unomap unordered_map
  9. #define unoset unordered_set
  10. #define endl '\n'
  11. #define str string
  12. #define strstr stringstream
  13. #define sz(a) (int)a.size()
  14. #define ll long long
  15. //#define int ll
  16. #define pii pair <int, int>
  17. #define pll pair <ll, ll>
  18. #define Unique(a) a.resize(unique(all(a)) - a.begin())
  19. #define ull unsigned ll
  20. #define fir first
  21. #define sec second
  22. #define idc cin.ignore()
  23. #define lb lower_bound
  24. #define ub upper_bound
  25. #define all(s) s.begin(), s.end()
  26. #define rev reverse
  27. #define gcd __gcd
  28. #define pushb push_back
  29. #define popb pop_back
  30. #define pushf push_front
  31. #define popf pop_front
  32. #define mul2x(a, x) a << x
  33. #define div2x(a, x) a >> x
  34. #define lcm(a, b) (a / __gcd(a, b) * b)
  35. #define log_base(x, base) log(x) / log(base)
  36. #define debug cerr << "No errors!"; exit(0);
  37. #define forw(i, a, b) for (int i = a; i <= b; ++i)
  38. #define forw2(i, a, b) for (ll i = a; i <= b; ++i)
  39. #define fors(i, a, b) for (int i = a; i >= b; --i)
  40. #define fors2(i, a, b) for (ll i = a; i >= b; --i)
  41. #define pqueue priority_queue
  42. #define sqrt sqrtl
  43. #define i128 __int128
  44. #define popcount __builtin_popcountll
  45. #define BIT(x, i) (((x) >> (i)) & 1)
  46. #define MASK(x) ((1LL) << (x))
  47. #define want_digit(x) cout << fixed << setprecision(x);
  48. #define excuting_time 1000.0 * clock() / CLOCKS_PER_SEC
  49. #define mapa make_pair
  50. using namespace std;
  51. const int MOD = 1e9 + 7; // 998244353
  52. const int inf = 1e9;
  53. const ll INF = 1e18;
  54. const int N = 100;
  55.  
  56. mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  57. ll random(const ll &L, const ll &R) {
  58.     return uniform_int_distribution<ll> (L, R) (rng);
  59. }
  60.  
  61. template <class X, class Y>
  62. bool maximize(X &x, const Y &y) {
  63.     return x < y ? x = y, true : false;
  64. }
  65.  
  66. int n, delta, a[N * 2 + 5][N * 2 + 5];
  67. pii mx[N * 2 + 5];
  68.  
  69. ll dp[N * 2 + 5][N * 2 + 5][2];
  70. void sub1() {
  71.     forw (i, 1, n) {
  72.         dp[1][i][0] = a[1][i];
  73.         dp[1][i][1] = mx[1].fir;
  74.     }
  75.  
  76.     forw (i, 1, n - 1) forw (j, 1, n + i - 1) forw (k, 0, 1) {
  77.         forw (add, 0, 1) {
  78.             int _j = j + add;
  79.             maximize(dp[i + 1][_j][k], dp[i][j][k] + a[i + 1][_j]);
  80.             if (!k)
  81.                 maximize(dp[i + 1][_j][1], dp[i][j][k] + mx[i + 1].fir);
  82.         }
  83.     }
  84.  
  85.     forw (i, n, 2 * n - 2) forw (j, 1, 3 * n - i - 1) forw (k, 0, 1) {
  86.         forw (add, -1, 0) {
  87.             int _j = j + add;
  88.             maximize(dp[i + 1][_j][k], dp[i][j][k] + a[i + 1][_j]);
  89.             if (!k)
  90.                 maximize(dp[i + 1][_j][1], dp[i][j][k] + mx[i + 1].fir);
  91.         }
  92.     }
  93.  
  94.     ll ans = 0;
  95.     forw (i, 1, n) forw (j, 0, 1)
  96.         maximize(ans, dp[n * 2 - 1][i][j]);
  97.     cout << ans << endl;
  98. }
  99.  
  100. ll calc(int row, int col1, int col2) {
  101.     ll val = mx[row].fir, curr = a[row][col1], tmp = mx[row].sec;
  102.     ll s1 = curr + (val != curr ? val : tmp);
  103.     curr = a[row][col2];
  104.     ll s2 = curr + (val != curr ? val : tmp);
  105.     return max(s1, s2);
  106. }
  107.  
  108. ll f[N * 2 + 5][N * 2 + 5][N * 2 + 5][2];
  109. void sub2() {
  110.     forw (i, 1, n - 1) forw (j, i + 1, n) {
  111.         f[1][i][j][0] = a[1][i] + a[1][j];
  112.         f[1][i][j][1] = calc(1, i, j);
  113.     }
  114.  
  115.     forw (i, 1, n - 1) {
  116.         int _i = i + 1, lim = n + i - 1;
  117.         forw (j, 1, lim) forw (k, j + 1, lim) forw (used, 0, 1) {
  118.             forw (add1, 0, 1) forw (add2, 0, 1) {
  119.                 int _j = j + add1, _k = k + add2;
  120.                 if (_j >= _k) continue;
  121.                 maximize(f[_i][_j][_k][used], f[i][j][k][used] + a[_i][_j] + a[_i][_k]);
  122.                 if (!used)
  123.                     maximize(f[_i][_j][_k][1], f[i][j][k][0] + calc(_i, _j, _k));
  124.             }
  125.         }
  126.     }
  127.  
  128.     forw (i, n, n * 2 - 2) {
  129.         int _i = i + 1, lim = 3 * n - i - 1;
  130.         forw (j, 1, lim) forw (k, j + 1, lim) forw (used, 0, 1) {
  131.             forw (add1, -1, 0) forw (add2, -1, 0) {
  132.                 int _j = j + add1, _k = k + add2;
  133.                 if (_j >= _k) continue;
  134.                 maximize(f[_i][_j][_k][used], f[i][j][k][used] + a[_i][_j] + a[_i][_k]);
  135.                 if (!used)
  136.                     maximize(f[_i][_j][_k][1], f[i][j][k][0] + calc(_i, _j, _k));
  137.             }
  138.         }
  139.     }
  140.  
  141.     ll ans = 0;
  142.     forw (i, 1, n) forw (j, 1, n) forw (k, 0, 1) {
  143.         maximize(ans, f[n * 2 - 1][i][j][k]);
  144.     }
  145.     cout << ans << endl;
  146. }
  147.  
  148. void solve() {
  149.     cin >> n >> delta;
  150.     forw (i, 1, n * 2 - 1) {
  151.         vector <int> curr;
  152.         forw (j, 1, (i <= n ? n + i - 1 : 3 * n - i - 1))
  153.             cin >> a[i][j], curr.pushb(a[i][j]);
  154.         sort(all(curr), greater<int>());
  155.         mx[i] = mapa(curr[0], curr[1]);
  156.     }
  157.  
  158.     if (delta == 1) sub1();
  159.     else sub2();
  160. }
  161.  
  162. signed main() {
  163.     ios::sync_with_stdio(false), cin.tie(nullptr);
  164.     srand(time(NULL));
  165.     #define name "test"
  166.     /*
  167.     if (fopen(name".INP", "r")) {
  168.         freopen(name".INP", "r", stdin);
  169.         freopen(name".OUT", "w", stdout);
  170.     }
  171.     */
  172.     bool testCase = false;
  173.     int numTest = 1;
  174. //    cin >> numTest;
  175.     forw (i, 1, numTest) {
  176.         if (testCase) cout << "Case " << i << ": ";
  177.         solve();
  178.     }
  179.     return 0;
  180. }
  181.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/kwrCcD
language:
C++14 (gcc 8.3)
created:
8 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!