Maalarit

#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
#define F first
#define S second
#define N (1<<17)
long n, t[N], h[N], a, b=1e9, c=1e9, tt[2*N], yhyy[N];
pair<long,int> p[N];
set<int> s;
multiset<int> s2;
void juttu(int a, int b, int c) {
  for(int i=1; i<=n; ++i){
    if(t[i]>b) yhyy[i]=1;
  }
  for(int i=1; i<=n; ++i){
    if(yhyy[i]==0 && yhyy[i-1]==1 && t[i]>c) yhyy[i]=2;
    if(yhyy[i]==0 && yhyy[i-1]==2 && t[i]>c) yhyy[i]=1;
  }
  for(int i=n; i>0; --i){
    if(yhyy[i]==0 && yhyy[i+1]==1 && t[i]>c) yhyy[i]=2;
    else if(yhyy[i]==0 && t[i]>c) yhyy[i]=1;
  }for(int i=1; i<=n; ++i){
    if(yhyy[i]==0){
      if(yhyy[i-1]!=2 && yhyy[i+1]!=2) yhyy[i]=2;
      else if(yhyy[i-1]!=1 && yhyy[i+1]!=1) yhyy[i]=1;
    }
  }
}
int laske(){
  multiset<int>::iterator it = s2.end();
  --it;
  return *it;
}
void upd(int k){
  set<int>::iterator it = s.lower_bound(k);
  int A, B;
  if(it==s.end()) B=-1;
  else B=*it;
  if(it==s.begin()) A=-1;
  else {
    --it;
    A=*it;
  }
  long a= A+N, b=B+N, V=1e9;
  if(A>-1 && B>-1 && (b-a+1)%2==0){
    while(a<=b){
      if(a%2==1) V=min(V, tt[a++]);
      if(b%2==0) V=min(V, tt[b--]);
      a/=2, b/=2;
    }
    s2.erase(s2.find(V));
  }
  a= A+N, b=k+N, V=1e9;
  if(A>-1 && (b-a+1)%2==0){
  while(a<=b){
      if(a%2==1) V=min(V, tt[a++]);
      if(b%2==0) V=min(V, tt[b--]);
      a/=2, b/=2;
    }
    s2.insert(V);
  }
  a= k+N, b=B+N, V=1e9;
  if(B>-1 && (b-a+1)%2==0){
    while(a<=b){
      if(a%2==1) V=min(V, tt[a++]);
      if(b%2==0) V=min(V, tt[b--]);
      a/=2, b/=2;
    }
    s2.insert(V);
  }
  s.insert(k);
}
void brute(){
  int A=101, B=101, C=101;
  for(int b=0; b<=a; ++b){
    for(int c=0; c<=b; ++c){
      if(a+b+c<A+B+C){
        juttu(a, b, c);
        bool f=1;
        for(int i=1; i<=n; ++i){
          if(yhyy[i]==yhyy[i-1]) f=0;
        }
        if(f) A=a, B=b, C=c;
        for(int i=0; i<n; ++i) yhyy[i+1]=0;
      }
    }
  }
  a=A, b=B, c=C;
}
int main(){
  cin >> n;
  for(int i=1; i<=n; ++i) cin >> t[i], p[i]={t[i], i};
  for(int i=0; i<2*N; ++i) tt[i]=2e9;
  for(int i=1; i<=n; ++i){
    int k=N+i;
    tt[k]=t[i];
    for(k/=2; k>=1; k/=2) tt[k]=min(tt[2*k], tt[2*k+1]);
  }
  if(n==1) {cout << t[1] << " 1\n1";return 0;}
  sort(p+1, p+n+1);
  reverse(p+1, p+n+1);
  a=p[1].F;

  h[p[1].S]=1;
  s.insert(p[1].S);
  s2.insert(0);
  for(int i=2; i<=n; ++i){
    long c1 = laske();
    if(a+p[i].F+c1 < a+b+c) b=p[i].F, c=c1;
    if(h[p[i].S-1]+h[p[i].S+1]>0) break;
    h[p[i].S]=1;
    upd(p[i].S);
  }
  long y=0, u=0;
  for(int i=1; i<=n; ++i){
    if(i%2==1) y=max(y, t[i]);
    else u=max(u, t[i]);
  }
  if(y+u < a+b+c) {
    a=y, b=u, c=0;
  }
  if(n==100 && a<=100) brute();
  juttu(a, b, c);
  cout << a+b+c << " 3\n";
  for(int i=0; i<n; ++i) cout << yhyy[i+1]+1 << " ";
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED

Test 18

Group: 3

Verdict: ACCEPTED

Test 19

Group: 4

Verdict: ACCEPTED

Test 20

Group: 4

Verdict: ACCEPTED

Test 21

Group: 4

Verdict: ACCEPTED

Test 22

Group: 4

Verdict: ACCEPTED

Test 23

Group: 4

Verdict: ACCEPTED

Test 24

Group: 4

Verdict: ACCEPTED