oj.uz

답안 #74001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
74001 2018-08-29T15:18:30 Z vex Zalmoxis (BOI18_zalmoxis) C++14
35 / 100
 1000 ms 63044 KB 
#include <bits/stdc++.h>
#define maxn 1000005
using namespace std;

int n,k;
int a[maxn];
vector<int>sol;
int s[maxn];

void precalc()
{
    s[0]=0;
    for(int i=1;i<=n;i++)s[i]=s[i-1]+(1<<a[i]);
}

void solve(int l,int r,int x)
{
    if(l>r)
    {
        sol.push_back(x);
        return;
    }
    if(l==r)
    {
        int s=1<<x;
        sol.push_back(a[l]);
        s-=1<<a[l];
        int br=0;
        while(s>0)
        {
            if(s%2)sol.push_back(br);
            br++;
            s/=2;
        }
        return;
    }

    int left=l;
    int right=r;
    int br=1<<(x-1);
    int t=l;
    while(left<=right)
    {
        int mid=(left+right)/2;
        if(s[mid]-s[l-1]>br)right=mid-1;
        else {
           t=mid;
           left=mid+1;
        }
    }

    solve(l,t,x-1);
    solve(t+1,r,x-1);
}
int najv2(int x)
{
    int l=0;
    int r=30;
    int sss=0;
    while(l<=r)
    {
        int mid=(l+r)/2;
        int br=(1<<mid)-1;
        if(br>x)r=mid-1;
        else{
            sss=mid;
            l=mid+1;
        }
    }
    return sss;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i];

    precalc();
    solve(1,n,30);

    int sz=sol.size();
    int d=n+k-sz;

    for(auto x:sol)
    {
        if(d==0)cout<<x<<" ";
        else{
            int mmm=najv2(d);
            int minn=min(mmm,x);
            for(int i=1;i<=(1<<minn);i++)cout<<x-minn<<" ";
            d-=1<<minn;
            d++;
        }
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 241 ms 16320 KB Output is correct
2 Correct 234 ms 18540 KB Output is correct
3 Correct 212 ms 20596 KB Output is correct
4 Correct 269 ms 22704 KB Output is correct
5 Correct 240 ms 24792 KB Output is correct
6 Correct 188 ms 26732 KB Output is correct

Subtask #2
5.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1078 ms 50568 KB Time limit exceeded
2 Execution timed out 1085 ms 53488 KB Time limit exceeded
3 Execution timed out 1058 ms 53488 KB Time limit exceeded
4 Execution timed out 1067 ms 55552 KB Time limit exceeded
5 Execution timed out 1066 ms 55552 KB Time limit exceeded
6 Execution timed out 1080 ms 57216 KB Time limit exceeded
7 Execution timed out 1079 ms 60916 KB Time limit exceeded
8 Execution timed out 1067 ms 60916 KB Time limit exceeded
9 Execution timed out 1062 ms 63044 KB Time limit exceeded
10 Incorrect 129 ms 63044 KB doesn't contain S as a subsequence
11 Incorrect 154 ms 63044 KB doesn't contain S as a subsequence
12 Incorrect 79 ms 63044 KB doesn't contain S as a subsequence
13 Incorrect 129 ms 63044 KB doesn't contain S as a subsequence
14 Correct 76 ms 63044 KB Output is correct