답안 #762072

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
762072	2023-06-20T17:45:44 Z	LucaIlie	Zalmoxis (BOI18_zalmoxis)	C++17	55 / 100	607 ms	101744 KB

zalmoxis

#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], tba[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] )
                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;
    }

    for ( int b = 19; b >= 0; b-- ) {
        for ( int i = 1; i <= n; i++ ) {
            for ( int x: adaugiri[i] ) {
                if ( k == 0 )
                    continue;

                int c = log2( k );
                c = min( c, x );
                for ( int j = 0; j < (1 << c); j++ )
                    tba[i].push_back( x - c );
                k -= (1 << c);
            }
        }

        for ( int i = 1; i <= n; i++ ) {
            for ( int x: tba[i] )
                adaugiri[i].push_back( x );
            tba[i].clear();
        }
    }

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

    return 0;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	469 ms	100792 KB	Output is correct
2	Correct	475 ms	101556 KB	Output is correct
3	Correct	469 ms	101240 KB	Output is correct
4	Correct	490 ms	101284 KB	Output is correct
5	Correct	466 ms	101444 KB	Output is correct
6	Correct	460 ms	100360 KB	Output is correct

Subtask #2

25.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	573 ms	101060 KB	not a zalsequence
2	Correct	461 ms	100256 KB	Output is correct
3	Incorrect	607 ms	101540 KB	not a zalsequence
4	Incorrect	569 ms	101588 KB	not a zalsequence
5	Incorrect	574 ms	101088 KB	not a zalsequence
6	Incorrect	569 ms	100956 KB	not a zalsequence
7	Incorrect	577 ms	101412 KB	not a zalsequence
8	Incorrect	577 ms	101744 KB	not a zalsequence
9	Incorrect	531 ms	93640 KB	not a zalsequence
10	Correct	237 ms	68644 KB	Output is correct
11	Incorrect	401 ms	81428 KB	not a zalsequence
12	Correct	77 ms	49296 KB	Output is correct
13	Correct	78 ms	49220 KB	Output is correct
14	Correct	76 ms	49272 KB	Output is correct