oj.uz

Submission #74015

# Submission time Handle Problem Language Result Execution time Memory
74015 2018-08-29T15:41:14 Z vex Zalmoxis (BOI18_zalmoxis) C++14
35 / 100
 1000 ms 36200 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(int i=0;i<sz;i++)
    {
        if(d==0)cout<<sol[i]<<" ";
        else{
            int mmm=najv2(d);
            int minn=min(mmm,sol[i]);
            for(int i=1;i<=(1<<minn);i++)cout<<sol[i]-minn<<" ";
            d-=1<<minn;
            d++;
        }
    }*/
  
  	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

# Verdict Execution time Memory Grader output
1 Correct 225 ms 14284 KB Output is correct
2 Correct 229 ms 14352 KB Output is correct
3 Correct 245 ms 14392 KB Output is correct
4 Correct 259 ms 14392 KB Output is correct
5 Correct 215 ms 14468 KB Output is correct
6 Correct 243 ms 14504 KB Output is correct

Subtask #2
5.0 / 70.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 34852 KB Time limit exceeded
2 Execution timed out 1095 ms 34852 KB Time limit exceeded
3 Execution timed out 1092 ms 34988 KB Time limit exceeded
4 Execution timed out 1083 ms 34988 KB Time limit exceeded
5 Execution timed out 1085 ms 36200 KB Time limit exceeded
6 Execution timed out 1086 ms 36200 KB Time limit exceeded
7 Execution timed out 1095 ms 36200 KB Time limit exceeded
8 Execution timed out 1092 ms 36200 KB Time limit exceeded
9 Execution timed out 1088 ms 36200 KB Time limit exceeded
10 Incorrect 136 ms 36200 KB doesn't contain S as a subsequence
11 Incorrect 152 ms 36200 KB doesn't contain S as a subsequence
12 Incorrect 87 ms 36200 KB doesn't contain S as a subsequence
13 Incorrect 86 ms 36200 KB doesn't contain S as a subsequence
14 Correct 95 ms 36200 KB Output is correct