oj.uz

답안 #139220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
139220 2019-07-31T12:25:35 Z mechfrog88 Zalmoxis (BOI18_zalmoxis) C++14
10 / 100
 156 ms 10408 KB 
#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.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 148 ms 10244 KB not a zalsequence
2 Correct 152 ms 10300 KB Output is correct
3 Correct 147 ms 10408 KB Output is correct
4 Incorrect 146 ms 10360 KB not a zalsequence
5 Incorrect 156 ms 10360 KB not a zalsequence
6 Incorrect 146 ms 10232 KB not a zalsequence

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 149 ms 10232 KB Unexpected end of file - int32 expected
2 Incorrect 146 ms 10232 KB Unexpected end of file - int32 expected
3 Incorrect 155 ms 10320 KB Unexpected end of file - int32 expected
4 Incorrect 146 ms 10360 KB Unexpected end of file - int32 expected
5 Incorrect 148 ms 10388 KB Unexpected end of file - int32 expected
6 Incorrect 146 ms 10360 KB Unexpected end of file - int32 expected
7 Incorrect 147 ms 10232 KB Unexpected end of file - int32 expected
8 Incorrect 148 ms 10336 KB Unexpected end of file - int32 expected
9 Incorrect 118 ms 8312 KB Unexpected end of file - int32 expected
10 Incorrect 49 ms 3320 KB Unexpected end of file - int32 expected
11 Incorrect 78 ms 5240 KB Unexpected end of file - int32 expected
12 Incorrect 2 ms 376 KB Unexpected end of file - int32 expected
13 Incorrect 2 ms 376 KB Unexpected end of file - int32 expected
14 Incorrect 2 ms 376 KB Unexpected end of file - int32 expected