oj.uz

Submission #644543

# Submission time Handle Problem Language Result Execution time Memory
644543 2022-09-24T21:00:18 Z Kripton Zalmoxis (BOI18_zalmoxis) C++14
40 / 100
 147 ms 35768 KB 
#include <bits/stdc++.h>
using namespace std;
int steve[1000001],vf;
int v[1000001],v1[1000001];
vector <int> addie[1000001];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,k,i,j;
    cin>>n>>k;
    int rez=0;
    v[0]=1e9;
    for(i=1;i<=n;i++)
    {
        cin>>v[i];
        rez+=(1<<v[i]);
        v1[i]=v[i];
        while(v[i]>v[steve[vf]])
        {
            addie[steve[vf]].push_back(v[steve[vf]]);
            k--;
            rez+=(1<<v[steve[vf]]);
            v[steve[vf]]++;
            while(vf&&v[steve[vf]]==v[steve[vf-1]])
            {
                v[steve[vf-1]]++;
                vf--;
            }
        }
        while(v[i]==v[steve[vf]])
        {
            v[i]++;
            vf--;
        }
        steve[++vf]=i;
    }
    while(v[steve[vf]]!=30)
    {
        addie[steve[vf]].push_back(v[steve[vf]]);
        rez+=(1<<v[steve[vf]]);
        k--;
        v[steve[vf]]++;
        while(vf&&v[steve[vf]]==v[steve[vf-1]])
        {
            v[steve[vf-1]]++;
            vf--;
        }
    }
    assert(rez==(1<<30));
    rez=0;
    for(i=1;i<=n;i++)
    {
        cout<<v1[i]<<" ";
        rez+=(1<<v1[i]);
        for(auto it:addie[i])
        {
            if(k>=((1<<it)-1))
            {
                k-=((1<<it)-1);
                for(j=1;j<=(1<<it);j++)
                    cout<<"0 ";
                rez+=(1<<it);
                continue;
            }
            else if(k)
            {
                int a=(int)log2(k)+1;
                int newit=it-a;
                //daca fac (1<<a) newit-uri, k-=((1<<a)-1)
                k=((1<<a)-1)-k;
                for(j=1;j<=(1<<a)-2*k;j++)
                    cout<<newit<<" ";
                rez+=(1<<newit)*((1<<a)-2*k);
                for(j=1;j<=k;j++)
                    cout<<newit+1<<" ";
                rez+=(1<<(newit+1))*k;
                k=0;
            }
            else
            {
                cout<<it<<" ";
                rez+=(1<<it);
            }
        }
    }
    assert(rez==(1<<30));
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 33624 KB Output is correct
2 Correct 139 ms 33668 KB Output is correct
3 Correct 137 ms 33644 KB Output is correct
4 Correct 137 ms 33612 KB Output is correct
5 Correct 141 ms 33744 KB Output is correct
6 Correct 136 ms 33644 KB Output is correct

Subtask #2
10.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 137 ms 33684 KB not a zalsequence
2 Correct 139 ms 33708 KB Output is correct
3 Incorrect 138 ms 33740 KB not a zalsequence
4 Incorrect 140 ms 33676 KB not a zalsequence
5 Incorrect 138 ms 33628 KB not a zalsequence
6 Incorrect 147 ms 33640 KB not a zalsequence
7 Incorrect 142 ms 33616 KB not a zalsequence
8 Incorrect 141 ms 33680 KB not a zalsequence
9 Incorrect 139 ms 35768 KB not a zalsequence
10 Incorrect 102 ms 31100 KB not a zalsequence
11 Incorrect 108 ms 33560 KB not a zalsequence
12 Incorrect 52 ms 25808 KB not a zalsequence
13 Incorrect 52 ms 25744 KB not a zalsequence
14 Correct 52 ms 25800 KB Output is correct