oj.uz

Submission #568591

# Submission time Handle Problem Language Result Execution time Memory
568591 2022-05-25T18:36:43 Z urosk Zalmoxis (BOI18_zalmoxis) C++14
20 / 100
 140 ms 10832 KB 
// __builtin_popcount(x)
// __builtin_popcountll(x)
#define here cerr<<"===========================================\n"
#include <bits/stdc++.h>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
using namespace std;

#define maxn 1000005
ll n,k;
vector<ll> v;
ll a[maxn];
int main(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
    cin >> n >> k;
    bool bio = 0;
    ll last = -1;
    ll e = -1;
    for(ll i = 1;i<=n;i++){
        cin >> a[i];
        ll x = a[i];
        v.pb(x);
        while(sz(v)>1&&v[sz(v)-1]==v[sz(v)-2]){
            ll x = v.back()+1;
            v.popb();
            v.popb();
            v.pb(x);
            last = i;
            e = x;
            bio = 1;
        }

    }
    if(bio){
        if(sz(v)==1){
            while(1) here;
            for(ll i = 1;i<=n;i++) cout<<a[i]<< " ";
            cout<<v[0]<<endl;
            return 0;
        }
        for(ll i = 1;i<=n;i++){
            cout<<a[i]<< " ";
            if(last==i){
                cout<<e<< " ";
            }
        }
        cout<<endl;
    }else{
        ll mn = llinf;
        for(ll i = 1;i<=n;i++) mn = min(mn,a[i]);
        for(ll i = 1;i<=n;i++){
            cout<<a[i]<< " ";
            if(a[i]==mn&&k>0){
                cout<<mn<< " ";
                k--;
            }
        }
        cout<<endl;
    }
	return 0;
}

Subtask #1
20.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 10228 KB Output is correct
2 Correct 128 ms 10204 KB Output is correct
3 Correct 140 ms 10360 KB Output is correct
4 Incorrect 127 ms 10168 KB not a zalsequence
5 Incorrect 126 ms 10220 KB not a zalsequence
6 Correct 128 ms 10192 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 10188 KB Unexpected end of file - int32 expected
2 Incorrect 125 ms 10336 KB Unexpected end of file - int32 expected
3 Incorrect 124 ms 10432 KB Unexpected end of file - int32 expected
4 Incorrect 124 ms 10316 KB Unexpected end of file - int32 expected
5 Incorrect 123 ms 10312 KB Unexpected end of file - int32 expected
6 Incorrect 129 ms 10108 KB Unexpected end of file - int32 expected
7 Incorrect 124 ms 10192 KB Unexpected end of file - int32 expected
8 Incorrect 127 ms 10256 KB Unexpected end of file - int32 expected
9 Incorrect 99 ms 10832 KB Unexpected end of file - int32 expected
10 Incorrect 38 ms 4932 KB Unexpected end of file - int32 expected
11 Incorrect 63 ms 8280 KB Unexpected end of file - int32 expected
12 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected
13 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected
14 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected