#include<bits/stdc++.h> using namespace std; // define #define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n"; #define ll long long #define ii pair <int , int> #define iii pair <int , ii> #define se second #define fi first #define all(v) (v).begin() , (v).end() #define Unique(v) sort(all(v)) , v.resize(unique(all(v)) - v.begin()) #define bit(x,i) (((x) >> (i)) & 1LL) #define flip(x,i) ((x) ^ (1LL << (i))) #define ms(d,x) memset(d , x , sizeof(d)) #define exist __exist #define ends __ends #define visit visited #define left __left #define right __right #define prev __prev #define next __next #define sitingfake 1 #define orz 1 //constant const long long mod = 1e9 + 7; const long long linf = 4557430888798830399LL; const long long nlinf = -4485090715960753727LL; const int LOG = 20; const int inf = 1061109567; const int ninf = -1044266559; const int dx[] = {0 , -1 , 0 , 1}; const int dy[] = {-1 , 0 , 1 , 0}; template<typename T> bool maximize(T &a, const T &b) { if(a < b) {a = b; return 1;} return 0; } template<typename T> bool minimize(T &a, const T &b) { if(a > b) {a = b; return 1;} return 0; } void Plus(ll & a ,ll b) { b %= mod; a += b; if(a < 0) a += mod; a %= mod; return; } void Mul(ll & a, ll b) { (a *= (b % mod)) %= mod; return; } //code const int maxn = 15005; int n , m; int a[maxn] , b[maxn]; namespace sub1 { int dp[505]; int trace[505]; bool approve() { for(int i = 1; i <= n; i++) { if(a[i] != 1) return 0; } return 1; } void solve() { ms(dp , 0x3f); dp[0] = 0; for(int sum = 1; sum <= n; sum++) { for(int i = 1; i <= m; i++) { if(b[i] <= sum && minimize(dp[sum] , dp[sum - b[i]] + 1)) { trace[sum] = b[i]; } } } vector <int> sz; if(dp[n] == inf) { cout << "-1"; return; } int cur = n; while(cur != 0) { sz.push_back(trace[cur]); cur -= trace[cur]; } cur = 1; cout << dp[n] << "\n"; for(int x : sz) { cout << x << " "; while(x--) { cout << cur << " "; cur++; } cout << "\n"; } } } namespace sub4 { vector <int> res[505]; bool approve() { int sum = 0; for(int i = 1; i <= n; i++) sum += a[i]; return sum <= 500; } void solve() { vector <ii> alive; for(int i = 1; i <= n; i++) alive.push_back({a[i] , i}); sort(all(alive) , greater <ii> ()); int numboxes = 0; for(int i = m ; i >= 1; i--) { while(alive.size() >= b[i]) { ++numboxes; for(int j = 0; j < b[i]; j++) { res[numboxes].push_back(alive[j].se); alive[j].fi--; } sort(all(alive) , greater <ii>()); while(!alive.empty() && alive.back().fi == 0) alive.pop_back(); } } if(!alive.empty()) cout << "-1"; else { cout << numboxes << "\n"; for(int i = 1; i <= numboxes; i++) { cout << res[i].size() << " "; for(int x : res[i]) cout << x << ' '; cout << "\n"; } } } } void solve(void) { cin >> n; for(int i = 1; i <= n; i++) { cin >> a[i]; } cin >> m; for(int i = 1; i <= m; i++) { cin >> b[i]; } if(sub1 :: approve()) { sub1 :: solve(); return; } if(sub4 :: approve()) { sub4 :: solve(); return; } } /** **/ signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define task "" if(fopen(task".inp","r")) { freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } int tc = 1; // cin >> tc; while(tc--) solve(); // execute; }

cookies.cpp: In function 'int main()':
cookies.cpp:206:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  206 |        freopen(task".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
cookies.cpp:207:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  207 |        freopen(task".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~