oj.uz

Submission #762049

# Submission time Handle Problem Language Result Execution time Memory
762049 2023-06-20T16:54:36 Z LucaIlie Zalmoxis (BOI18_zalmoxis) C++17
40 / 100
 471 ms 78292 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 } );
    }

    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 = 1; i < k; i++ )
        cout << val - i << " ";
    if ( k > 0 )
        cout << val - k + 1 << "\n";

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 77252 KB Output is correct
2 Correct 461 ms 78196 KB Output is correct
3 Correct 456 ms 77620 KB Output is correct
4 Correct 463 ms 77796 KB Output is correct
5 Correct 457 ms 77960 KB Output is correct
6 Correct 457 ms 76876 KB Output is correct

Subtask #2
10.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 462 ms 77516 KB not a zalsequence
2 Correct 458 ms 76728 KB Output is correct
3 Incorrect 462 ms 78132 KB not a zalsequence
4 Incorrect 471 ms 78052 KB not a zalsequence
5 Incorrect 459 ms 77624 KB not a zalsequence
6 Incorrect 455 ms 77468 KB not a zalsequence
7 Incorrect 458 ms 77900 KB not a zalsequence
8 Incorrect 464 ms 78292 KB not a zalsequence
9 Incorrect 432 ms 70348 KB not a zalsequence
10 Correct 232 ms 48348 KB Output is correct
11 Incorrect 325 ms 57584 KB not a zalsequence
12 Incorrect 73 ms 31632 KB not a zalsequence
13 Incorrect 73 ms 31660 KB not a zalsequence
14 Incorrect 73 ms 31612 KB not a zalsequence