Omenat

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <unordered_set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <fstream>
#include <set>
#include <map>

#define MOD 1000000007
#define ll long long
//#define N (1<<50)
#define float double
#define str string

using namespace std;

struct lol{
    vector<int> o1,o2;
    ll diff;
};

bool operator<(lol a, lol b){
    if(a.diff==b.diff)
        return a.o1[0]<b.o1[0];
    return a.diff<b.diff;
}

lol op(lol a, lol b){
    if(a<b)
        return op(b,a);
    lol c;
    c.diff=a.diff-b.diff;

    for(auto asd:a.o1)
        c.o1.push_back(asd);
    for(auto asd:a.o2)
        c.o2.push_back(asd);
    for(auto asd:b.o1)
        c.o2.push_back(asd);
    for(auto asd:b.o2)
        c.o1.push_back(asd);

    return c;
}

lol op2(lol a, lol b){
    lol c;
    c.diff=a.diff+b.diff;

    for(auto asd:a.o1)
        c.o1.push_back(asd);
    for(auto asd:a.o2)
        c.o2.push_back(asd);
    for(auto asd:b.o1)
        c.o1.push_back(asd);
    for(auto asd:b.o2)
        c.o2.push_back(asd);

    return c;
}

int vast[100];


lol parsa;
set<lol> kek;
int c;
void etsi(ll js){
    c++;
    if(c>=1000000)
        return;

    if(kek.size()==1){
        if(kek.begin()->diff < parsa.diff)
            parsa=*kek.begin();
        return;
    }

    lol a=*kek.rbegin();
    kek.erase(a);
    lol b=*kek.rbegin();
    kek.erase(b);

    if(js>2*a.diff){
        lol c1=op2(a,b);
        kek.insert(c1);
        etsi(js);
        kek.erase(c1);
    }

    lol c2=op(a,b);
    kek.insert(c2);
    etsi(js-b.diff);
    kek.erase(c2);

    kek.insert(a);
    kek.insert(b);
}

int main(){
    parsa.diff=1000000000000000000ll;
    int n;
    cin>>n;

    ll os=0;

    for(int i=0; i<n; i++){
        lol uus;
        ll w;
        cin>>w;
        os+=w;
        uus.diff=w;
        uus.o1.push_back(i);
        kek.insert(uus);
    }

    /**while(pq.size()>=2){
        lol a,b;
        a=pq.top();
        pq.pop();
        b=pq.top();
        pq.pop();

        pq.push(op(a,b));
    }*/

    etsi(os);

    for(int i:parsa.o1)
        vast[i]=1;
    for(int i:parsa.o2)
        vast[i]=2;

    for(int i=0; i<n; i++)
        cout<<vast[i]<<" ";
    return 0;
}

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED