oj.uz

Submission #644534

# Submission time Handle Problem Language Result Execution time Memory
644534 2022-09-24T20:47:23 Z Kripton Zalmoxis (BOI18_zalmoxis) C++14
80 / 100
 148 ms 35732 KB 
#include <bits/stdc++.h>
using namespace std;
int steve[1000001],vf;
int steve1[1000001],vf1;
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]=-1;
    for(i=1;i<=n;i++)
    {
        cin>>v[i];
        rez+=(1<<v[i]);
        v1[i]=v[i];
        while(vf&&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)
    {
        int min1=40;
        for(i=1;i<=vf;i++)
            min1=min(min1,v[steve[i]]);
        vf1=0;
        for(i=1;i<=vf;i++)
        {
            if(v[steve[i]]==min1)
            {
                k--;
                v[steve[i]]++;
                addie[steve[i]].push_back(min1);
                rez+=(1<<min1);
            }
            while(v[steve[i]]==v[steve1[vf1]])
            {
                v[steve[i]]++;
                vf1--;
            }
            steve1[++vf1]=steve[i];
        }
        vf=vf1;
        for(i=1;i<=vf;i++)
            steve[i]=steve1[i];
    }
    assert(rez==(1<<30));
    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);
            }
        }
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 33740 KB Output is correct
2 Correct 135 ms 33656 KB Output is correct
3 Correct 144 ms 33896 KB Output is correct
4 Correct 138 ms 33740 KB Output is correct
5 Correct 148 ms 33864 KB Output is correct
6 Correct 132 ms 33692 KB Output is correct

Subtask #2
50.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 33724 KB Output is correct
2 Correct 137 ms 33696 KB Output is correct
3 Incorrect 136 ms 33760 KB not a zalsequence
4 Correct 138 ms 33728 KB Output is correct
5 Correct 138 ms 33680 KB Output is correct
6 Correct 137 ms 33632 KB Output is correct
7 Correct 136 ms 33628 KB Output is correct
8 Correct 135 ms 33640 KB Output is correct
9 Incorrect 132 ms 35732 KB not a zalsequence
10 Incorrect 90 ms 31024 KB not a zalsequence
11 Incorrect 108 ms 33500 KB not a zalsequence
12 Correct 52 ms 25772 KB Output is correct
13 Correct 52 ms 25812 KB Output is correct
14 Correct 55 ms 25828 KB Output is correct