oj.uz

Submission #644357

# Submission time Handle Problem Language Result Execution time Memory
644357 2022-09-24T12:25:04 Z Kripton Zalmoxis (BOI18_zalmoxis) C++14
10 / 100
 138 ms 34624 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;
    v[0]=-1;
    for(i=1;i<=n;i++)
    {
        cin>>v[i];
        v1[i]=v[i];
        while(v[i]==v[steve[vf]])
        {
            v[i]++;
            vf--;
        }
        steve[++vf]=i;
    }
    for(j=1;j<=40&&k&&v[steve[vf]]!=30;j++)
    {
        int min1=40;
        for(i=1;i<=vf;i++)
            min1=min(min1,v[steve[i]]);
        vf1=0;
        for(i=1;i<=vf;i++)
        {
            if(k&&v[steve[i]]==min1)
            {
                k--;
                v[steve[i]]++;
                addie[steve[i]].push_back(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[vf1];
    }
    for(i=1;i<=n;i++)
    {
        for(auto it:addie[i])
        {
            if(k>=((1<<it)-1))
            {
                k-=((1<<it)-1);
                for(j=1;j<=(1<<it);j++)
                    cout<<"0 ";
                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<<" ";
                for(j=1;j<=k;j++)
                    cout<<newit+1<<" ";
                k=0;
            }
            else
                cout<<it<<" ";
        }
        cout<<v1[i]<<" ";
    }
    return 0;
}

Subtask #1
10.0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 33688 KB not a zalsequence
2 Incorrect 132 ms 33732 KB not a zalsequence
3 Incorrect 132 ms 33720 KB not a zalsequence
4 Correct 136 ms 33628 KB Output is correct
5 Correct 132 ms 33644 KB Output is correct
6 Incorrect 133 ms 33612 KB not a zalsequence

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 135 ms 33612 KB not a zalsequence
2 Incorrect 134 ms 33808 KB not a zalsequence
3 Incorrect 132 ms 33840 KB not a zalsequence
4 Incorrect 137 ms 33748 KB not a zalsequence
5 Incorrect 133 ms 33708 KB not a zalsequence
6 Incorrect 138 ms 33612 KB not a zalsequence
7 Incorrect 138 ms 33684 KB not a zalsequence
8 Incorrect 134 ms 33692 KB not a zalsequence
9 Incorrect 114 ms 34624 KB Unexpected end of file - int32 expected
10 Incorrect 56 ms 29132 KB Unexpected end of file - int32 expected
11 Incorrect 76 ms 31472 KB Unexpected end of file - int32 expected
12 Incorrect 50 ms 25812 KB not a zalsequence
13 Incorrect 51 ms 25792 KB not a zalsequence
14 Incorrect 51 ms 25808 KB not a zalsequence