oj.uz

Submission #762045

# Submission time Handle Problem Language Result Execution time Memory
762045 2023-06-20T16:43:39 Z LucaIlie Zalmoxis (BOI18_zalmoxis) C++17
35 / 100
 514 ms 80328 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 } );
    }

    if ( k < 0 )
        return 1;

    for ( int i = 1; i <= n; i++ ) {
        cout << v[i] << " ";
        for ( int x: adaugiri[i] )
            cout << x << " ";
    }
    int val = seg.begin()->val;
    for ( int i = 0; i < k; i++ )
        cout << val + i << " ";

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 454 ms 79292 KB Output is correct
2 Correct 468 ms 80076 KB Output is correct
3 Correct 474 ms 79768 KB Output is correct
4 Correct 463 ms 79844 KB Output is correct
5 Correct 481 ms 79948 KB Output is correct
6 Correct 459 ms 78808 KB Output is correct

Subtask #2
5.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 480 ms 79612 KB not a zalsequence
2 Correct 451 ms 78844 KB Output is correct
3 Incorrect 514 ms 80100 KB not a zalsequence
4 Incorrect 514 ms 80116 KB not a zalsequence
5 Incorrect 456 ms 79736 KB not a zalsequence
6 Incorrect 459 ms 79460 KB not a zalsequence
7 Incorrect 498 ms 79976 KB not a zalsequence
8 Incorrect 476 ms 80328 KB not a zalsequence
9 Incorrect 445 ms 71836 KB not a zalsequence
10 Incorrect 236 ms 48436 KB not a zalsequence
11 Incorrect 335 ms 58320 KB not a zalsequence
12 Incorrect 80 ms 30688 KB not a zalsequence
13 Incorrect 79 ms 30704 KB not a zalsequence
14 Incorrect 95 ms 30668 KB not a zalsequence