oj.uz

답안 #977349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977349 2024-05-07T19:02:25 Z alexdd Zalmoxis (BOI18_zalmoxis) C++17
30 / 100
 323 ms 142924 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,k,cnt;
set<pair<int,int>> rez;
vector<int> pozs[31];
int a[2000005],inita[2000005];
int nxt[2000005][2],prec[2000005][2];
void baga_dupa(int p, int x, int c)
{
    int pnxt = nxt[p][c];
    nxt[p][c] = x;
    nxt[x][c] = pnxt;

    prec[x][c] = p;
    prec[pnxt][c] = x;
}
void scoate(int p, int c)
{
    nxt[prec[p][c]][c] = nxt[p][c];
    prec[nxt[p][c]][c] = prec[p][c];
}
vector<int> aux;
void calc(int x)
{
    if(k<=0 || x==0)
    {
        aux.push_back(x);
        return;
    }
    k--;
    calc(x-1);
    calc(x-1);
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k;
    int initn=n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        inita[i]=a[i];
        prec[i][0]=prec[i][1]=i-1;
        nxt[i][0]=nxt[i][1]=i+1;
        pozs[a[i]].push_back(i);
    }
    nxt[n][0]=nxt[n][1]=0;
    for(int i=0;i<30;i++)
    {
        sort(pozs[i].begin(),pozs[i].end());
        for(auto x:pozs[i])
        {
            assert(x<=initn);
        }
        for(int j=(int)pozs[i].size()-1;j>=0;j--)
        {
            if(j>0 && nxt[pozs[i][j-1]][0] == pozs[i][j] && prec[pozs[i][j]][0] == pozs[i][j-1])
            {
                //cout<<i<<" zzz\n";
                pozs[i+1].push_back(pozs[i][j]);

                a[pozs[i][j]]++;
                scoate(pozs[i][j-1],0);
                j--;
            }
            else
            {
                pozs[i+1].push_back(pozs[i][j]);

                k--;
                n++;
                a[n]=inita[n]=i;
                baga_dupa(pozs[i][j],n,1);
                a[pozs[i][j]]++;
            }
        }
        /*cout<<i<<"    ";
        int cur=1;
        while(cur!=0)
        {
            cout<<a[cur]<<" ";
            cur = nxt[cur][0];
        }
        cout<<"\n";*/
    }
    assert(k>=0);
    assert(k==0);
    assert((int)pozs[30].size()==1);
    assert(n<=2000000);
    int primu=-1;
    for(int i=1;i<=n;i++)
        if(prec[i][1]==0)
            primu=i;
    assert(primu!=-1);
    int cur=primu;
    for(int i=1;i<=n;i++)
    {
        if(cur<=initn) aux.push_back(inita[cur]);
        else calc(inita[cur]);
        cur = nxt[cur][1];
    }
    assert(k==0);
    for(auto x:aux)
        cout<<x<<" ";
    return 0;
}
/**
5 1
29 27 25 25 28

1 5
29


9 0
28 28 25 25 26 25 25 26 28

8 1
28 25 25 26 25 25 26 28

*/

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 288 ms 80336 KB Output is correct
2 Correct 309 ms 80412 KB Output is correct
3 Correct 270 ms 80272 KB Output is correct
4 Correct 300 ms 80188 KB Output is correct
5 Correct 323 ms 80604 KB Output is correct
6 Correct 288 ms 80968 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 297 ms 138080 KB Execution killed with signal 6
2 Incorrect 270 ms 81108 KB not a zalsequence
3 Runtime error 285 ms 138172 KB Execution killed with signal 6
4 Runtime error 302 ms 138980 KB Execution killed with signal 6
5 Runtime error 291 ms 140772 KB Execution killed with signal 6
6 Runtime error 284 ms 142924 KB Execution killed with signal 6
7 Runtime error 290 ms 139340 KB Execution killed with signal 6
8 Runtime error 286 ms 139252 KB Execution killed with signal 6
9 Runtime error 240 ms 130028 KB Execution killed with signal 6
10 Runtime error 104 ms 67244 KB Execution killed with signal 6
11 Runtime error 174 ms 90892 KB Execution killed with signal 6
12 Runtime error 11 ms 12908 KB Execution killed with signal 6
13 Runtime error 8 ms 12892 KB Execution killed with signal 6
14 Runtime error 8 ms 13024 KB Execution killed with signal 6