oj.uz

Submission #762060

# Submission time Handle Problem Language Result Execution time Memory
762060 2023-06-20T17:20:59 Z LucaIlie Zalmoxis (BOI18_zalmoxis) C++17
55 / 100
 508 ms 78344 KB 
#include <bits/stdc++.h>

using namespace std;

struct xxx {
    int l, r, val, ap;

    bool operator < ( const xxx &x ) const {
        if ( val == x.val )
            return l < x.l;
        return val < x.val;
    }
};

const int MAX_N = 1e6;
int v[MAX_N + 2], leftt[MAX_N + 2], rightt[MAX_N + 2], value[MAX_N + 2], apar[MAX_N + 2];
set<xxx> seg;
vector<int> adaugiri[MAX_N + 1];

int main() {
    int n, k;

    cin >> n >> k;
    for ( int i = 1; i <= n; i++ )
        cin >> v[i];

    int l = 1, r = 1;
    while ( l <= n ) {
        r = l;
        while ( r + 1 <= n && v[l] == v[r + 1] )
            r++;
        leftt[l] = leftt[r] = l;
        rightt[l] = rightt[r] = r;
        value[l] = value[r] = v[l];
        apar[l] = apar[r] = r - l + 1;
        seg.insert( { l, r, v[l], r - l + 1 } );
        l = r + 1;
    }

    value[0] = value[n + 1] = -1;
    while ( !(seg.size() == 1 && seg.begin()->ap == 1) ) {
        int l = seg.begin()->l, r = seg.begin()->r, val = seg.begin()->val, ap = seg.begin()->ap;
        seg.erase( { l, r, val, ap } );

        if ( ap % 2 == 1 ) {
            ap++;
            k--;
            adaugiri[r].push_back( val );
        }
        ap /= 2;
        val++;

        if ( val == value[l - 1] ) {
            ap += apar[l - 1];
            seg.erase( { leftt[l - 1], rightt[l - 1], value[l - 1], apar[l - 1] } );
            l = leftt[l - 1];
        }
        if ( val == value[r + 1] ) {
            ap += apar[r + 1];
            seg.erase( { leftt[r + 1], rightt[r + 1], value[r + 1], apar[r + 1] } );
            r = rightt[r + 1];
        }

        leftt[l] = leftt[r] = l;
        rightt[l] = rightt[r] = r;
        value[l] = value[r] = val;
        apar[l] = apar[r] = ap;
        seg.insert( { l, r, val, ap } );
    }

    int val = seg.begin()->val;
    if ( val == 30 && k > 0 ) {
        for ( int i = 1; i <= n; i++ ) {
            cout << v[i] << " ";
            for ( int x: adaugiri[i] ) {
                int c = min( (int)log2( k ), x );
                k -= (1 << c);
                for ( int j = 0; j < (1 << c); j++ )
                    cout << x - c << " ";
            }
        }
      	return 0;
    }

    for ( int i = 1; i <= n; i++ ) {
        cout << v[i] << " ";
        for ( int x: adaugiri[i] )
            cout << x << " ";
    }

    for ( ; val < 29; val++ ) {
        cout << val << " ";
        k--;
    }
    for ( int b = 19; b >= 0; b-- ) {
        if ( k >= (1 << b) ) {
            k -= (1 << b);
            if ( k > 0 )
                val--;
            for ( int i = 0; i < (1 << b); i++ )
                cout << val - b << " ";
        }
    }

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 455 ms 77252 KB Output is correct
2 Correct 489 ms 78044 KB Output is correct
3 Correct 455 ms 77644 KB Output is correct
4 Correct 461 ms 77788 KB Output is correct
5 Correct 476 ms 77940 KB Output is correct
6 Correct 451 ms 76800 KB Output is correct

Subtask #2
25.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 499 ms 77540 KB Unexpected end of file - int32 expected
2 Correct 468 ms 76872 KB Output is correct
3 Incorrect 473 ms 78272 KB Unexpected end of file - int32 expected
4 Incorrect 501 ms 78220 KB Unexpected end of file - int32 expected
5 Incorrect 508 ms 77764 KB Unexpected end of file - int32 expected
6 Incorrect 500 ms 77644 KB Unexpected end of file - int32 expected
7 Incorrect 484 ms 78052 KB Unexpected end of file - int32 expected
8 Incorrect 494 ms 78344 KB Unexpected end of file - int32 expected
9 Incorrect 454 ms 71328 KB Unexpected end of file - int32 expected
10 Correct 265 ms 45296 KB Output is correct
11 Incorrect 332 ms 57316 KB Unexpected end of file - int32 expected
12 Correct 76 ms 25848 KB Output is correct
13 Correct 84 ms 25776 KB Output is correct
14 Correct 70 ms 25816 KB Output is correct