Omenat

input/code.cpp: In function 'int main()':
input/code.cpp:34:12: warning: array subscript is above array bounds [-Warray-bounds]
   good[0][0]=1;
            ^
input/code.cpp:78:41: warning: array subscript is below array bounds [-Warray-bounds]
         if (0<=p1 && p1<G && good[p1][gi]){
                                         ^
input/code.cpp:80:47: warning: array subscript is below array bounds [-Warray-bounds]
         }else if (0<=p2 && p2<G && good[p2][gi]){
                                               ^
input/code.cpp:82:50: warning: array subscript is below array bounds [-Warray-bounds]
         }else if (0<=cp1 && cp1<G && good[cp1][gi]){
                                                  ^
input/code.cpp:84:50: warning: array subscript is below array bounds [-Warray-bounds]
         }else if (0<=cp2 && cp2<G && good[cp2][gi]){
                                                  ^

#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;
 
const int G=5222010;
const int GD=0;
 
const int B=0;
bool good[G][GD];
 
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);
  s/=2;
  good[0][0]=1;
  for (int i=0; i<min(GD, n-B); ++i){
    for (int j=0; j<G; ++j){
      if (good[j][i]){
        good[j][i+1]=1;
        int nv=p[n-1-i].first+j;
        if (nv<G) good[nv][i+1]=1;
      }
    }
  }
  for (int i=0; i<G; ++i){
    for (int j=0; j<GD-1; ++j){
      if (good[i][j]) good[i][j+1]=1;
    }
  }
  int b=min(n, B);
  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{
        int gi=n-j-1;
        if (gi>GD-1) gi=GD-1;
        
        long long cp1=s-sa;
        long long cp2=s-sb;
        long long p1=cp1-p[j].first;
        long long p2=cp2-p[j].first;
        
        bool j1=0;
        if (0<=p1 && p1<G && good[p1][gi]){
          j1=1;
        }else if (0<=p2 && p2<G && good[p2][gi]){
          j1=0;
        }else if (0<=cp1 && cp1<G && good[cp1][gi]){
          j1=0;
        }else if (0<=cp2 && cp2<G && good[cp2][gi]){
          j1=1;
        }else{
          if (sa<sb) j1=1;
          else j1=0;
        }
        if (j1){
          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;
    }
    if (paras==0) break;
  }
  for (int i=0; i<n; ++i) cout << tulos[i] << "\n";
  cout << paras << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED