oj.uz

Submission #853109

# Submission time Handle Problem Language Result Execution time Memory
853109 2023-09-23T12:39:37 Z sofijavelkovska medians (balkan11_medians) C++17
5 / 100
 89 ms 12884 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, lb, ub, x, y, i;
    set<int> notused;
    cin >> n;
    int a[2*n-1], b[n];
    for (i=0; i<n; i++)
        cin >> b[i];
    for (i=1; i<=2*n-1; i++)
        notused.insert(i);
    a[0]=b[0];
    notused.erase(b[0]);
    for (i=1; i<n; i++)
    {
        if (i==n-1)
        {
            lb=b[i];
            ub=b[i];
        }
        else
        {
            if (b[i+1]<b[i])
            {
                lb=b[i+1];
                ub=b[i];
            }
            else
            {
                lb=b[i];
                ub=b[i+1];
            }
        }
        if (b[i]==b[i-1])
        {
            auto it=notused.lower_bound(max(b[i], ub));
            x=*it;
            notused.erase(x);
            it=notused.upper_bound(min(b[i], lb));
            it--;
            y=*it;
            notused.erase(y);
        }
        if (b[i]>b[i-1])
        {
            auto it=notused.lower_bound(max(b[i], ub));
            x=*it;
            it++;
            y=*it;
            notused.erase(x);
            notused.erase(y);
        }
        if (b[i]<b[i-1])
        {
            auto it=notused.upper_bound(min(b[i], ub));
            it--;
            x=*it;
            it--;
            y=*it;
            notused.erase(x);
            notused.erase(y);
        }
        a[2*i-1]=x;
        a[2*i]=y;
    }
    for (i=0; i<2*n-1; i++)
        cout << a[i] << " ";

    return 0;
}

Subtask #1
5.0 / 65.0

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

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 600 KB Not a permutation
2 Incorrect 3 ms 860 KB Not a permutation
3 Incorrect 6 ms 1216 KB Not a permutation
4 Incorrect 12 ms 2140 KB Output isn't correct
5 Incorrect 26 ms 4252 KB Not a permutation
6 Incorrect 63 ms 8244 KB Not a permutation
7 Incorrect 89 ms 12884 KB Not a permutation