제출 #1146289

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1146289		mychecksedad	Cookies (JOI23_cookies)	C++20	0 / 100	14 ms	14660 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;

struct E{
  bool ok;
  int go;
};

int n, b[N], m, pref[N], PD[N][N][N];
E 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;
  }
  sort(b+1, b+1+m);
  for(int i = 0; i <= s + 1; ++i){
    for(int j = 0; j <= s + 1; ++j) DP[i][j] = {0, 0};
  }
  b[0] = 0;
  is_size[0] = 1;
  DP[m + 1][0] = {true, 0};
  // for(int i = 1; i <= n; ++i){
  //   cout << pref[i] << ' ';
  // }
  // en;
  for(int i = m; i >= 1; --i){ // C_{n-i+1}
    int SZ = b[i], LEN = b[i] - b[i - 1];
    for(int cur_sum = 0; cur_sum <= s; ++cur_sum){
      if(s - cur_sum < pref[b[i-1]]) break;
      for(int x = DP[i + 1][cur_sum].go; - x * LEN + cur_sum >= 0; ++x){
        int prev_sum = cur_sum - x * LEN;
        // cout << cur_sum << ' ' << prev_sum << '\n';
        bool good = 1;
        int k = s - cur_sum;
        for(int j = b[i-1]; j <= b[i]; ++j){
          if(k < pref[j]) good = 0;
          k += x;
        }
        if(good && DP[i + 1][prev_sum].ok && DP[i + 1][prev_sum].go <= x){
          DP[i][cur_sum] = {true, x};
          break;
        }
      }
    }
  }
  if(DP[1][s].ok){
    vector<pii> boxes;
    int cur_num = DP[1][s].go, cur_sum = s;
    for(int i = 1; i <= m; ++i){
      if(cur_sum == 0) break;
      int LEN = b[i] - b[i - 1];
      auto dp = DP[i + 1][cur_sum - cur_num * LEN];
      if(cur_num > dp.go){
        for(int l = dp.go; l < cur_num; ++l) boxes.pb({b[i], boxes.size()});
      }
      cur_sum -= cur_num * LEN;
      cur_num = dp.go;
    }
    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: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 45
• Subtask 5: 0 / 15
• Subtask 6: 0 / 15