Omenat

input/code.cpp: In function 'int main()':
input/code.cpp:45:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(r*left < mod*a) {
                       ^

#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#define F first
#define S second
using namespace std;
typedef long long ll;
const int N = 53e6;
pair<ll, ll> t[111];
unsigned long long mod = (1<<23)-1;;
//ll mod = 98765431;
ll asd = 1007;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {
    return a > b;
}
int main() {
    srand(time(0));
    unsigned long long  rr = rand()%mod;
    int n;
    cin>>n;
    pair<ll, vector<int> > best = {1e18, {0}};
    ll sum = 0;
    ll mi = 1e9;
    for(int i = 0; i < n; ++i) {
        cin>>t[i].F;
        t[i].S = i;

        sum += t[i].F;
        mi = min(t[i].F, mi);
    }
    sort(t, t+n, comp);
    for(int i = 0; i < N/n; ++i) {
        //random_shuffle(t, t+n);
        rr = rand()%mod;
        ll a = sum/2;
        ll left = sum;
        vector<int> v(n);
        for(int j = 0; j < n; ++j) {
            rr *= asd;
            rr += 323121;
            rr %= mod;
            ll r = rr;
            //if(r/1000 < a/left) {
            if(r*left < mod*a) {
            //if(r < 500) {
                left -= t[j].F;
                a -= t[j].F;
                v[t[j].S] = 1;
            }
            else {
                left -= t[j].F;
                v[t[j].S] = 2;
            }
        }
        a = abs(a);
        best = min(best, {a, v});
    }
    for(int i = 0; i < n; ++i) {
        cout<<best.S[i]<<' ';
    }
    cout<<'\n';
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: TIME LIMIT EXCEEDED