oj.uz

Submission #853160

# Submission time Handle Problem Language Result Execution time Memory
853160 2023-09-23T14:50:34 Z sofijavelkovska medians (balkan11_medians) C++17
10 / 100
 35 ms 3152 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=100000;

int vmin, vmax;
bool used[2*MAXN]={false};

void updatevmin()
{
    while (used[vmin])
        vmin=vmin+1;

    return;
}

void updatevmax()
{
    while (used[vmax])
        vmax=vmax-1;

    return;
}

int main()
{
    int n, i;
    cin >> n;
    int a[2*n-1], b[n];
    for (i=0; i<n; i++)
        cin >> b[i];
    vmin=1;
    vmax=2*n-1;
    a[0]=b[0];
    used[b[0]]=true;
    for (i=1; i<n; i++)
    {
        if (b[i]==b[i-1])
        {
            updatevmin();
            updatevmax();
            a[2*i-1]=vmin;
            used[vmin]=true;
            a[2*i]=vmax;
            used[vmax]=true;
        }
        if (b[i]>b[i-1])
        {
            if (used[b[i]])
            {
                updatevmax();
                a[2*i-1]=vmax;
                used[vmax]=true;
                updatevmax();
                a[2*i]=vmax;
                used[vmax]=true;
            }
            else
            {
                a[2*i-1]=b[i];
                used[b[i]]=true;
                updatevmax();
                a[2*i]=vmax;
                used[vmax]=true;
            }
        }
        if (b[i]<b[i-1])
        {
            if (used[b[i]])
            {
                updatevmax();
                a[2*i-1]=vmin;
                used[vmin]=true;
                updatevmin();
                a[2*i]=vmin;
                used[vmin]=true;
            }
            else
            {
                a[2*i-1]=b[i];
                used[b[i]]=true;
                updatevmin();
                a[2*i]=vmin;
                used[vmin]=true;
            }
        }
    }
    for (i=0; i<2*n-1; i++)
        cout << a[i] << " ";

    return 0;
}

Subtask #1
10.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 600 KB Not a permutation
3 Incorrect 0 ms 348 KB Not a permutation
4 Incorrect 0 ms 344 KB Not a permutation
5 Incorrect 0 ms 344 KB Not a permutation
6 Correct 0 ms 344 KB Output is correct
7 Incorrect 0 ms 344 KB Not a permutation
8 Incorrect 0 ms 348 KB Not a permutation
9 Incorrect 1 ms 344 KB Not a permutation
10 Incorrect 0 ms 344 KB Not a permutation
11 Incorrect 1 ms 344 KB Not a permutation
12 Incorrect 0 ms 344 KB Not a permutation
13 Incorrect 1 ms 344 KB Not a permutation

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Not a permutation
2 Incorrect 2 ms 344 KB Not a permutation
3 Incorrect 3 ms 600 KB Not a permutation
4 Incorrect 6 ms 600 KB Not a permutation
5 Incorrect 12 ms 1068 KB Not a permutation
6 Incorrect 28 ms 2128 KB Not a permutation
7 Incorrect 35 ms 3152 KB Not a permutation