Submission #1148792

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148792		mychecksedad	Cookies (JOI23_cookies)	C++20	6 / 100	25 ms	5192 KiB

cookies

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 500+100, M = 1e5+10, K = 52, MX = 30;

struct E{
  bool ok;
  short int go;
  E(){ok=0, go=0;}
  E(bool ok, int x): ok(ok), go(x){}
};

int n, b[N], lim[N], m;
bool DP[N][N][N];
array<int, 2> a[N];
pair<bool, vector<vi>> f(vector<pii> A){
  vector<vi> res(A.size());
  for(int i = 1; i <= n; ++i){
    if(A.size() < a[i][0]){
      return pair<bool, vector<vi>>{false, res};
    }
    for(int j = 0; j < a[i][0]; ++j){
      if(A[j].ff == 0){
        return pair<bool, vector<vi>>{false, res};
      }
      A[j].ff--;
      res[A[j].ss].pb(a[i][1]);
    }    
    sort(all(A));
    reverse(all(A));
  }
  return pair<bool, vector<vi>>{true, res};
}
void solve(){
  cin >> n;
  int s = 0;
  for(int i = 1; i <= n; ++i){
    cin >> a[i][0];
    a[i][1] = i;
    s += a[i][0];
  }
  sort(a+1, a+1+n, greater<array<int, 2>>());
  lim[0] = 0;
  for(int i = 1; i <= n; ++i){
    lim[i] = 0;
    for(int j = 1; j <= n; ++j) lim[i] += min(i, a[j][0]);
  }
  cin >> m;
  vector<bool> is_size(s + 1);
  for(int i = 1; i <= m; ++i){
    cin >> b[i];
    is_size[b[i]] = 1;
  }
  sort(b+1, b+1+m);
    
  for(int i = 0; i <= s; ++i){
    for(int j = 0; (i * j) - 1 <= s && j <= s; ++j){
      for(int sum = 0; sum <= s; ++sum) DP[i][j][sum] = 0;
    }
  }
  for(int j = 0; j <= s + 1; ++j) DP[0][j][0] = 1;  
  for(int i = 1; i <= s; ++i){
    for(int j = s / i; j >= 0; --j){
      for(int k = j; k <= s; ++k){
        if(j < s/i)
          DP[i][j][k] = DP[i][j][k] | DP[i][j + 1][k];
        if(is_size[j] && lim[i] >= k)
          DP[i][j][k] = DP[i][j][k] | DP[i - 1][j][k - j];
        // cout << i << ' ' << j << ' ' << k << ' ' << DP[i][j][k] << '\n';
      }
    }//cout << endl;
    for(int j = s; j >= 0; --j){
      if(DP[i][j][s]){
        // found
        // cout << i << ' ' << j << ' ' << s << endl;
        vector<pii> boxes;
        int cur_sum = s - j, min_j = j;
        boxes.pb({j, 0});
        for(int pos = i - 1; pos >= 1; --pos){
          // DP[pos][kk][sum]
          // cout << pos << ' ' << min_j << ' ' << cur_sum << endl; 
          for(; min_j <= s; ++min_j){
            if(DP[pos][min_j][cur_sum] && !DP[pos][min_j + 1][cur_sum]){
              cur_sum -= min_j;
              boxes.pb({min_j, int(boxes.size())});
              break;
            }
          }
        }


        assert(cur_sum == 0);
        sort(all(boxes), greater<pii>());
        auto g = f(boxes);
        assert(g.ff);
        cout << g.ss.size() << '\n';
        for(auto v: g.ss){
          cout << v.size() << ' ';
          for(int u: v) cout << u << ' ';
          en;
        }
        return;
      }
    }

  }
  cout << -1;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 45
• Subtask 5: 0 / 15
• Subtask 6: 0 / 15