Submission #63402

#	Time	Username	Problem	Language	Result	Execution time	Memory
63402		qkxwsm	Zalmoxis (BOI18_zalmoxis)	C++17	100 / 100	901 ms	25136 KiB

zalmoxis

/*
PROG: source
LANG: C++11
_____
.'     '.
/  0   0  \
|     ^     |
|  \     /  |
\  '---'  /
'._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
        T input = 0;
        bool negative = false;
        char c = ' ';
        while (c < '-')
        {
                c = getchar();
        }
        if (c == '-')
        {
                negative = true;
                c = getchar();
        }
        while (c >= '0')
        {
                input = input * 10 + (c - '0');
                c = getchar();
        }
        if (negative)
        {
                input = -input;
        }
        x = input;
}
template<class T>
void printi(T output)
{
        if (output == 0)
        {
                putchar('0');
                return;
        }
        if (output < 0)
        {
                putchar('-');
                output = -output;
        }
        int aout[20];
        int ilen = 0;
        while(output)
        {
                aout[ilen] = ((output % 10));
                output /= 10;
                ilen++;
        }
        for (int i = ilen - 1; i >= 0; i--)
        {
                putchar(aout[i] + '0');
        }
        return;
}
template<class T>
void ckmin(T &a, T b)
{
        a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
        a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
        return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
        return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
        return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 1000013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, K;
int arr[MAXN];
int W = (1 << 30);
vector<pii> ans;

bool cross(int a, int b)
{
        return ((__builtin_clz(a) != __builtin_clz(b)) && (__builtin_popcount(b) != 1));
}
int32_t main()
{
        ios_base::sync_with_stdio(0);
        srand(time(0));
        //	cout << fixed << setprecision(10);
        //	cerr << fixed << setprecision(10);
        if (fopen("input.in", "r"))
        {
                freopen ("input.in", "r", stdin);
                freopen ("output.out", "w", stdout);
        }
        // cerr << (1 << (32 - __builtin_clz(4))) - 4 << endl;
        // cerr << (1 << (32 - __builtin_clz(5))) - 5 << endl;
        // return 0;
        cin >> N >> K;
        for (int i = 0; i < N; i++)
        {
                cin >> arr[i];
        }
        int sum = 0;
        for (int i = 0; i < N; i++)
        {
                //if sum + arr[i] is not divisible by (1 << arr[i])
                if ((sum) % (1 << arr[i]))
                {
                        //whoops, we're bad!
                        //smallest power of 2 STRICTLY greater than sum!
                        int up = (1 << arr[i]) - (sum % (1 << arr[i]));
                        for (int j = 0; j < 30; j++)
                        {
                                if (up & (1 << j))
                                {
                                        ans.PB({j, 1});
                                        sum += (1 << j);
                                        K--;
                                }
                        }
                }
                ans.PB({arr[i], 0});
                sum += (1 << (arr[i]));
        }
        for (int j = 0; j < 30; j++)
        {
                if ((W - sum) & (1 << j))
                {
                        ans.PB({j, 1});
                        K--;
                }
        }
        for (int i = 0; i < ans.size(); i++)
        {
                // cerr << "lmao " << ans[i].fi << ' ' << ans[i].se << endl;
                if (!ans[i].se)
                {
                        cout << ans[i].fi << ' ';
                        continue;
                }
                else
                {
                        multiset<int> ms;
                        ms.insert(ans[i].fi);
                        while(K && (*(prev(ms.end())) > 1))
                        {
                                int x = *(prev(ms.end()));
                                ms.erase(prev(ms.end()));
                                ms.insert(x - 1);
                                ms.insert(x - 1);
                                K--;
                        }
                        for (int x : ms)
                        {
                                cout << x << ' ';
                        }
                }
        }
        cout << '\n';
        //split W into K guys
        //it's beautiful if you can collapse them

        //	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
        return 0;
}

Compilation message (stderr)

zalmoxis.cpp: In function 'int32_t main()':
zalmoxis.cpp:201:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < ans.size(); i++)
                         ~~^~~~~~~~~~~~
zalmoxis.cpp:160:25: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen ("input.in", "r", stdin);
                 ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
zalmoxis.cpp:161:25: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen ("output.out", "w", stdout);
                 ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70