oj.uz

Submission #760754

# Submission time Handle Problem Language Result Execution time Memory
760754 2023-06-18T10:46:38 Z LucaIlie Zalmoxis (BOI18_zalmoxis) C++17
0 / 100
 216 ms 45440 KB 
#include <bits/stdc++.h>

using namespace std;

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

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

const int MAX_N = 1e6;
int v[MAX_N + 1], leftt[MAX_N + 1], rightt[MAX_N + 1], value[MAX_N + 1], apar[MAX_N + 1];
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[r] = l;
        rightt[l] = 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;
    }

    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[r] = l;
        rightt[l] = 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
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 142 ms 43300 KB Execution failed because the return code was nonzero
2 Runtime error 141 ms 43320 KB Execution failed because the return code was nonzero
3 Runtime error 145 ms 43204 KB Execution failed because the return code was nonzero
4 Runtime error 142 ms 43208 KB Execution failed because the return code was nonzero
5 Runtime error 144 ms 43252 KB Execution failed because the return code was nonzero
6 Runtime error 140 ms 43208 KB Execution failed because the return code was nonzero

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 194 ms 45380 KB not a zalsequence
2 Incorrect 194 ms 45388 KB not a zalsequence
3 Incorrect 216 ms 45328 KB not a zalsequence
4 Incorrect 199 ms 45440 KB not a zalsequence
5 Incorrect 200 ms 45388 KB not a zalsequence
6 Incorrect 194 ms 45316 KB not a zalsequence
7 Incorrect 197 ms 45416 KB not a zalsequence
8 Incorrect 197 ms 45388 KB not a zalsequence
9 Incorrect 172 ms 42472 KB not a zalsequence
10 Incorrect 111 ms 35116 KB not a zalsequence
11 Incorrect 135 ms 38032 KB not a zalsequence
12 Incorrect 91 ms 30720 KB not a zalsequence
13 Incorrect 85 ms 30708 KB not a zalsequence
14 Incorrect 72 ms 30636 KB not a zalsequence