Submission #1036192

#	Time	Username	Problem	Language	Result	Execution time	Memory
1036192		tvladm2009	Cookies (JOI23_cookies)	C++11	85 / 100	1061 ms	644660 KiB

cookies

#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2", "popcnt")
 
using namespace std;
 
typedef long long ll;
 
const int N = 3000 + 7;
const int M = 15000 + 7;
 
int n, m, a[M], b[M];
int vertical[M];
__int128 pw[M];

struct MyBitset {
    vector<__int128> b;
    int n;
 
    void resize(int nn) {
        n = nn;
        b.resize(n / 127 + 2, 0);
    }
 
    void set(int x) {
        b[x / 127] |= pw[x];
    }
 
    bool get(int x) {
        if (x > n) {
            return 0;
        }
        if (b[x / 127] & pw[x]) {
            return true;
        } else {
            return false;
        }
    }
};
 
int f[M];
 
void add(int i, int x) {
    for (; i <= n; i += i & -i) f[i] += x;
}
 
int get(int i) {
    int res = 0;
    for (; i >= 1; i -= i & -i) res += f[i];
    return res;
}
 
int get_next(int x) {
    int l = 1, r = x, sol = 0;
    while (l <= r) {
        int m = (l + r) / 2;
        if (get(x) - get(m - 1) >= 1) {
            l = m + 1;
            sol = m;
        } else {
            r = m - 1;
        }
    }
    return sol;
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    cin >> m;
    for (int i = 1; i <= m; ++i) cin >> b[i];
    
    int sumA = 0;
    for (int i = 1; i <= n; ++i) {
        sumA += a[i];
    }
    reverse(b + 1, b + m + 1);
    for (int i = 1; i <= sumA; ++i) {
        for (int j = 1; j <= n; ++j) {
            vertical[i] += min(i, a[j]);
        }
    }
    for (int i = 0; i <= sumA; ++i) {
        if (i % 127 == 0) {
            pw[i] = 1;
        } else {
            pw[i] = pw[i - 1] * 2;
        }
    }
    vector<vector<MyBitset>> dp(m + 1, vector<MyBitset>(sumA + 1));
 
    dp[0][0].resize(1);
    dp[0][0].set(0);
    for (int i = 1; i <= m; ++i) {
        for (int sum = 0; sum <= sumA; ++sum) {
            dp[i][sum].resize(sum / b[i]);
        }
        for (int x = 0; x <= sumA / b[i]; ++x) {
            for (int sum = x * b[i]; sum <= vertical[x]; ++sum) {
                if (vertical[x] >= sum) {
                    bool b1 = (x == 0 ? 0 : dp[i][sum - b[i]].get(x - 1));
                    bool b2 = dp[i - 1][sum].get(x);
                    if (b1 | b2) {
                        dp[i][sum].set(x);
                    }
                    // dp[i][sum][x] = dp[i][x - 1][sum - b[i]] | dp[i - 1][x][sum];
                }
            }
        }
    }
    for (int x = 1; x <= sumA / b[m]; ++x) {
        if (dp[m][sumA].get(x) == true) {
            cout << x << "\n";
            vector<pair<int, int>> boxes;
            int cnt = x;
            int sum = sumA;
            int pos = m;
            while (pos > 0) {
                if (cnt != 0 && dp[pos][sum - b[pos]].get(cnt - 1)) {
                    boxes.push_back({b[pos], boxes.size()});
                    sum -= b[pos];
                    cnt--;
                } else {
                    assert(dp[pos - 1][sum].get(cnt) == 1);
                    pos--;
                }
            }
            vector<vector<int>> sol(boxes.size());
            vector<vector<int>> occ(n + 1);
            sort(boxes.rbegin(), boxes.rend());
            for (int i = 0; i < boxes.size(); ++i) {
                occ[boxes[i].first].push_back(boxes[i].second);
                add(boxes[i].first, 1);
            }
            for (int it = 1; it <= n; ++it) {
                vector<int> mod;
                int x = get_next(n);
                int val = a[it];
                while (a[it] > 0) {
                    int steps = min(a[it], (int) occ[x].size());
                    for (int i = 1; i <= steps; ++i) {
                        mod.push_back(x);
                    }
                    a[it] -= steps;
                    x = get_next(x - 1);
                }
 
                reverse(mod.begin(), mod.end());
                for (auto i : mod) {
                    assert(occ[i].size() > 0);
                    
                    int x = occ[i].back();
                    occ[i].pop_back();
                    add(i, -1);
                    sol[x].push_back(it);
 
                    if (i >= 2) {
                        add(i - 1, 1);
                        occ[i - 1].push_back(x);
                    }
                }
            }
 
            for (int i = 0; i < boxes.size(); ++i) {
                cout << sol[i].size() << " ";
                for (auto j : sol[i]) {
                    cout << j << " ";
                }
                cout << "\n";
            }
            return 0;
        }
    }
    cout << -1 << "\n";
    return 0;
}

Compilation message (stderr)

cookies.cpp: In function 'int main()':
cookies.cpp:133:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |             for (int i = 0; i < boxes.size(); ++i) {
      |                             ~~^~~~~~~~~~~~~~
cookies.cpp:140:21: warning: unused variable 'val' [-Wunused-variable]
  140 |                 int val = a[it];
      |                     ^~~
cookies.cpp:166:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |             for (int i = 0; i < boxes.size(); ++i) {
      |                             ~~^~~~~~~~~~~~~~

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