제출 #1146066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1146066		mychecksedad	Cookies (JOI23_cookies)	C++20	6 / 100	548 ms	613612 KiB

cookies

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
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;


int n, b[N], m, pref[N], PD[N][N][N];
bitset<N> DP[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>>());
  pref[0] = 0;
  for(int i = 1; i <= n; ++i){
    pref[i] = pref[i - 1] + a[i][0];
  }
  cin >> m;
  vector<bool> is_size(s + 1);
  for(int i = 1; i <= m; ++i){
    cin >> b[i];
    is_size[b[i]] = 1;
  }
  for(int i = 0; i <= s + 1; ++i){
    for(int j = 0; j <= s + 1; ++j) for(int k = 0; k <= s + 1; ++k) DP[i][j][k] = 0;
  }
  is_size[0] = 1;
  int ans = MOD;
  DP[n + 1][0][0] = 1;
  for(int cur_sum  = 0; cur_sum <= s; ++cur_sum){
    PD[n + 1][cur_sum][0] = DP[n + 1][cur_sum][0];
    for(int x = 1; x <= s; ++x){
      PD[n + 1][cur_sum][x] = PD[n + 1][cur_sum][x - 1] + DP[n + 1][cur_sum][x];
    }
  }
  for(int i = 1; i <= n; ++i){ // C_{n-i+1}
    for(int cur_sum = 0; cur_sum <= min(s, n * i); ++cur_sum){
      if(s - cur_sum < pref[n-i+1]) break;
      // cout<<i<<"g";
      for(int x = 0; x <= min(s, n*i); ++x){
        if(s - (cur_sum + x) < pref[n-i]) break;
        // cout << "f" << i << '\n';
        bool is = is_size[n-i+1]; // x = C_{j}
        int min_y;
        if(!is) min_y = x;
        else min_y = 0; 
        DP[n-i+1][cur_sum + x][x] = (PD[n-i+2][cur_sum][x] - (min_y == 0 ? 0 : PD[n-i+2][cur_sum][min_y - 1]) > 0);
        // for(int y = min_y; y <= x; ++y){ // y = C_{j+1}
        //   DP[n-i+1][cur_sum + x][x] = DP[n-i+1][cur_sum + x][x] | DP[n-i+2][cur_sum][y];
        // }
      }
    }
    for(int cur_sum  = 0; cur_sum <= min(s, (i+1)*n); ++cur_sum){
      PD[n - i + 1][cur_sum][0] = DP[n - i + 1][cur_sum][0];
      for(int x = 1; x <= min(s, (i+1)*n); ++x){
        PD[n - i + 1][cur_sum][x] = PD[n - i + 1][cur_sum][x - 1] + DP[n - i + 1][cur_sum][x];
      }
    }
  }
  for(int j = 1; j <= s; ++j){
    if(DP[1][s][j]){
      // cout << s << ' ' << j << '\n';
      vector<pii> boxes;
      int cur_num = j, cur_sum = s;
      for(int i = 1; i <= n; ++i){
        if(is_size[i]){
          for(int k = 0; k <= s; ++k){
            if(DP[i + 1][cur_sum - cur_num][k]){
              if(cur_num > k){
                for(int l = k; l < cur_num; ++l) boxes.pb({i, boxes.size()});
              }
              cur_sum -= cur_num;
              cur_num = k;
              break;
            }
          }
        }else{
          cur_sum -= cur_num;
        }
        // cout << cur_sum << ' ' << cur_num << '\n';
      }
      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