oj.uz

Submission #750208

# Submission time Handle Problem Language Result Execution time Memory
750208 2023-05-29T07:52:06 Z ammar124 Zalmoxis (BOI18_zalmoxis) C++14
0 / 100
 152 ms 44240 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define ll 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;
vector<int>v(1e7 + 6 , -1);
int meow = 0;
int cnt = 0;
int xx , yy;
int xc = 0 , yc = 0;
void pls_work(int num)
{
    int g = a+b - cnt;
    int g2,g3;
    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])
    {
        v[indx] = num;
        return;
        cnt++;
    }
    if(num == arr[meow])
    {
        v[indx] = arr[meow];
        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;
    for(int i=0;i<a;i++)
    {
        cin>>arr[i];
    }
    solve(0 , 1e7+5 , 30);
    for(int i=0;i<1e7+6;i++)
    {
        if(v[i] != -1)
            cout<<v[i]<<" ";
    }
    for(int i=0;i<xc;i++)
    {
        cout<<xx<<" ";
    }
    for(int i=0;i<yc;i++)
    {
        cout<<yy<<" ";
    }
    return 0;
}

Compilation message

zalmoxis.cpp: In function 'void pls_work(int)':
zalmoxis.cpp:26:14: warning: 'g3' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |     xx = num - g3;
      |          ~~~~^~~~
zalmoxis.cpp:28:13: warning: 'g2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   28 |     yc = (g - g2)*2;
      |          ~~~^~~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 126 ms 44116 KB Unexpected end of file - int32 expected
2 Incorrect 125 ms 44224 KB Unexpected end of file - int32 expected
3 Incorrect 124 ms 44188 KB Unexpected end of file - int32 expected
4 Incorrect 145 ms 44196 KB Unexpected end of file - int32 expected
5 Incorrect 143 ms 44216 KB Unexpected end of file - int32 expected
6 Incorrect 121 ms 43936 KB Unexpected end of file - int32 expected

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 127 ms 44124 KB Unexpected end of file - int32 expected
2 Incorrect 115 ms 44036 KB Unexpected end of file - int32 expected
3 Incorrect 115 ms 44212 KB Unexpected end of file - int32 expected
4 Incorrect 119 ms 44220 KB Unexpected end of file - int32 expected
5 Incorrect 123 ms 44148 KB Unexpected end of file - int32 expected
6 Incorrect 121 ms 44156 KB Unexpected end of file - int32 expected
7 Incorrect 119 ms 44168 KB Unexpected end of file - int32 expected
8 Incorrect 124 ms 44240 KB Unexpected end of file - int32 expected
9 Incorrect 152 ms 43976 KB Unexpected end of file - int32 expected
10 Incorrect 108 ms 43080 KB Unexpected end of file - int32 expected
11 Incorrect 110 ms 43392 KB Unexpected end of file - int32 expected
12 Incorrect 94 ms 43424 KB Unexpected end of file - int32 expected
13 Incorrect 94 ms 43460 KB Unexpected end of file - int32 expected
14 Incorrect 95 ms 43404 KB not a zalsequence