Omenat

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;


vector<pair<int, int> > p;

bool srt(pair<int, int> a, pair<int, int> b){ return a.first>b.first;}


int jako[101];
int tulos[101];
long long paras;

int main(){
  long long paras=100000000000000ll;
  cin >> n;
  long long s=0;
  for (int i=0; i<n; ++i){
    int x;
    cin >> x;
    s+=x;
    p.push_back(make_pair(x, i));
  }sort(p.begin(), p.end(), srt);
  
  int b=min(n, 22);
  int bt=1<<b;
  
  long long sa;
  long long sb;
  for (int i=0; i<bt; ++i){
    sa=0; sb=0;
    for (int j=0; j<n; ++j){
      if (j<b){
        if (i&(1<<j)){
          sa+=p[j].first;
          jako[j]=1;
        }else{
          sb+=p[j].first;
          jako[j]=2;
        }
      }else if (j==b){
        sa+=p[j].first;
        jako[j]=1;        
      }else{
        if (sa<sb){
          sa+=p[j].first;
          jako[j]=1;
        }else{
          sb+=p[j].first;
          jako[j]=2;
        }
      }
    }
    long long d=sa-sb;
    if (d<0) d=-d;
    if (d<paras){
      for (int j=0; j<n; ++j){
        tulos[p[j].second]=jako[j];
      }
      paras=d;
    }
  }
  for (int i=0; i<n; ++i) cout << tulos[i] << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: ACCEPTED