Submission #1108079

#	Time	Username	Problem	Language	Result	Execution time	Memory
1108079		vicvic	Zalmoxis (BOI18_zalmoxis)	C++11	0 / 100	2 ms	4432 KiB

zalmoxis

#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("zalmoxis.in");
ofstream g ("zalmoxis.out");
int n, k, v[2000005], poz, added[2000005], s[2000005], cnt;
int main()
{
    f >> n >> k;
    int poz=0;
    for (int i=1;i<=n;i++)
    {
        int x;
        f >> x;
        int ok=0;
        while (cnt && s[cnt]<x)
        {
            v[++poz]=s[cnt]+ok;
            int val=v[poz];
            while (cnt && val==s[cnt])
            {
                cnt--;
                val++;
            }
            s[++cnt]=val;
            added[poz]=1;
            ok=1;
        }
        v[++poz]=x;
        while (cnt && x==s[cnt])
        {
            cnt--;
            x++;
        }
        s[++cnt]=x;
    }
    k-=poz;
    while (s[cnt]!=30)
    {
        v[++poz]=s[cnt];
        added[poz]=1;
        int val=v[poz];
        while (cnt && s[cnt]==val)
        {
            cnt--;
            val++;
        }
        s[++cnt]=val;
    }
    for (int i=1;i<=poz;i++)
    {
        if (added[poz] && k && v[i]>1)
        {
            int fp=max (v[i]-k, 1);
            int cate=min (v[i]-1, k);
            g << fp << " ";
            for (int j=fp;j<=v[i]-2;j++)
            {
                g << j << " ";
            }
            v[i]--;
            k-=cate;
            i--;
            continue;
        }
        g << v[i] << " ";
    }
    return 0;
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70