Submission #139220

#	Time	Username	Problem	Language	Result	Execution time	Memory
139220		mechfrog88	Zalmoxis (BOI18_zalmoxis)	C++14	10 / 100	156 ms	10408 KiB

zalmoxis

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
using namespace __gnu_pbds;
using namespace std;
 
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld; 


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n,k;
    cin >> n >> k;
    ll i = 0,j=0;
    ll c = 0;
    vector <ll> arr(n);
    for (int z=0;z<n;z++){
        cin >> arr[z];
    }
    ll mini = LLONG_MAX;
    for (int z=0;z<n;z++){
        if (z != n-1 && arr[z] == arr[z+1]){
            i = z;
            j = z+1;
            c = arr[z];
        }
        mini = min(mini,arr[z]);
    }
    if (i == j){
        for (int z=0;z<n;z++){
            if (arr[z] == mini) cout << arr[z] << " ";
            cout << arr[z] << " ";
        }
        cout << endl;
        return 0;
    }
    while (true){
        if (i > 0 && arr[i-1] == c+1){
            i--;
            c++;
        } else if (j < n-1 && arr[j+1] == c+1){
            j++;
            c++;
        } else {
            for (int z=0;z<n;z++){
                if (z == i) cout << c+1 << " ";
                cout << arr[z] << " ";
            }
            cout << endl;
            break;
        }
    }
}

• Subtask 1: 10 / 30
• Subtask 2: 0 / 70