fork download
copy 
  1. /*
  2. * Author: Geeza
  3. */
  4.  
  5. #include <bits/stdc++.h>
  6.  
  7. #define ld long double
  8. #define ll long long
  9. #define pb push_back
  10. #define fin(a, n) for(int i = a; i < n; i++)
  11. #define fjn(a, n) for(int j = a; j < n; j++)
  12. #define all(a) a.begin(),a.end()
  13. #define allr(a) a.rbegin(),a.rend()
  14. #define FAST ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
  15.  
  16. using namespace std;
  17.  
  18. const double PI = acos(-1);
  19. const int N = 1e5+5;
  20. const ll oo = 0x3f3f3f3f3f3f3f3f;
  21. const int mod = 1000000007, inf = 1e6;
  22.  
  23. string di[] = {"D","L", "U", "R", "UL", "UR", "DL", "DR"};
  24. int dx[] = {+1, +0, +0, -1, -1, -1, +1, +1};
  25. int dy[] = {+0, -1, +1, +0, -1, +1, -1, +1};
  26. char dc[] = {'D', 'L', 'R', 'U'};
  27.  
  28. int n, p, k;
  29. ll dp[N][1<<8]; // idx, mask
  30. vector<pair<ll, int>> v;
  31. vector<vector<ll>> s;
  32.  
  33. ll calc(int idx, int mask, int rem) {
  34.     if (idx == n) return (mask == (1<<p)-1? 0 : -oo);
  35.  
  36.     ll &ret = dp[idx][mask];
  37.     if (~ret)return ret;
  38.     ret = 0;
  39.  
  40.     ret = max(ret, calc(idx+1, mask, rem)); // leave
  41.     // take
  42.     // audience
  43.     if (rem > 0) {
  44.         ret = max(ret, calc(idx+1, mask, rem-1) + v[idx].first);
  45.     }
  46.  
  47.     //player
  48.     for (int i = 0; i < p; i++) {
  49.         if ((mask>>i)&1)continue;
  50.         ret = max(ret, calc(idx+1, mask|(1<<i), rem) + s[v[idx].second][i]);
  51.     }
  52.  
  53.     return ret;
  54. }
  55.  
  56. void solve() {
  57.     cin >> n >> p >> k;
  58.     v.assign(n, {0, 0});
  59.     fin(0, n) cin >> v[i].first, v[i].second = i;
  60.     s = vector<vector<ll>>(n, vector<ll>(p, 0));
  61.     fin(0, n) {
  62.         fjn(0, p) cin >> s[i][j];
  63.     }
  64.  
  65.     sort(all(v), [&](pair<ll, int> &a, pair<ll, int> &b) {
  66.         return a.first > b.first;
  67.     });
  68.  
  69.     memset(dp, -1, sizeof dp);
  70.     cout << calc(0, 0, k) << "\n";
  71. }
  72.  
  73. int main() {
  74.     FAST;
  75. #ifndef ONLINE_JUDGE
  76.     freopen("input.txt","r",stdin);
  77.     freopen("output.txt","w",stdout);
  78. #endif
  79.     int tt = 1; //cin >> tt;
  80.     while(tt--){
  81.         solve();
  82.     }
  83.     return 0;
  84. }
Success #stdin #stdout 0.03s 203552KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0
https://ideone.com/9MwHlu
language:
C++ (gcc 8.3)
created:
15 hours 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!