oj.uz

Submission #750269

# Submission time Handle Problem Language Result Execution time Memory
750269 2023-05-29T08:51:33 Z ammar124 Zalmoxis (BOI18_zalmoxis) C++14
35 / 100
 401 ms 72948 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define int long long
using namespace std;
ll power(ll a, ll b) { ll ans = 1; while (b) { if (b % 2) ans *= a; a *= a; b /= 2; } return ans; }
int const maxin = 1e6+6;
ll const mod = 1e9+7;
int arr[maxin];
int a,b;
int meow = 0;
int cnt = 0;
int xx , yy;
int xc = 0 , yc = 0;
map<ll , ll>mp;
void pls_work(int num)
{
    int g = a+b - cnt;
    int g2 = 0,g3 = 0;
    for(int i=0;i<100;i++)
    {
        if(power(2 , i) > g)
            break;
        g2 = power(2,i);
        g3 = i;
    }
    xx = num - g3;
    yy = num - g3 - 1;
    yc = (g - g2)*2;
    xc = g - yc;
    cnt = a+b;
}
void solve(int l , int r , int num)
{
    if(cnt == a + b)
    {
        return;
    }
    int indx = (l+r)/2;
    if(meow == a)
    {
        pls_work(num);
        return;
    }
    if(num < arr[meow])
    {
        mp[indx] = num;
        return;
        cnt++;
    }
    if(num == arr[meow])
    {
        mp[indx] = num;
        meow++;
        cnt++;
        return;
    }
    solve(l , indx , num-1);
    solve(indx , r , num-1);
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>a>>b;
    int meow69 = a+b;
    for(int i=0;i<a;i++)
    {
        cin>>arr[i];
    }
    solve(0 , 1e17+5 , 30);
    for(auto it : mp)
    {
        cout<<it.second<<" ";
        meow69--;
        if(meow69 == 0)
            return 0;
    }
    for(int i=0;i<xc;i++)
    {
        cout<<xx<<" ";
        meow69--;
        if(meow69 == 0)
            return 0;
    }
    for(int i=0;i<yc;i++)
    {
        cout<<yy<<" ";
        meow69--;
        if(meow69 == 0)
            return 0;
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 72948 KB Output is correct
2 Correct 393 ms 72740 KB Output is correct
3 Correct 383 ms 72828 KB Output is correct
4 Correct 397 ms 72816 KB Output is correct
5 Correct 388 ms 72832 KB Output is correct
6 Correct 380 ms 72828 KB Output is correct

Subtask #2
5.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 392 ms 72780 KB not a zalsequence
2 Correct 385 ms 72736 KB Output is correct
3 Incorrect 398 ms 72852 KB Unexpected end of file - int32 expected
4 Incorrect 381 ms 72780 KB not a zalsequence
5 Incorrect 382 ms 72784 KB not a zalsequence
6 Incorrect 391 ms 72856 KB not a zalsequence
7 Incorrect 401 ms 72836 KB not a zalsequence
8 Incorrect 376 ms 72780 KB not a zalsequence
9 Incorrect 357 ms 67276 KB not a zalsequence
10 Incorrect 184 ms 32268 KB not a zalsequence
11 Incorrect 254 ms 47856 KB not a zalsequence
12 Incorrect 61 ms 4248 KB not a zalsequence
13 Incorrect 61 ms 4300 KB not a zalsequence
14 Incorrect 61 ms 4300 KB not a zalsequence