oj.uz

Submission #499576

# Submission time Handle Problem Language Result Execution time Memory
499576 2021-12-28T19:59:37 Z colossal_pepe medians (balkan11_medians) C++17
15 / 100
 24 ms 3756 KB 
#include <iostream>
#include <vector>
using namespace std;

int n, b[100005];
bool mark[2 * 100005];
vector<int> ans;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    mark[0] = mark[2 * n] = 1;
    int left = 0, right = 2 * n;
    ans.push_back(b[0]);
    mark[b[0]] = 1;
    for (int i = 1; i < n; i++) {
        int added = 0;
        if (not mark[b[i]]) {
            ans.push_back(b[i]);
            mark[b[i]] = 1;
            added++;
        }
        while (mark[left]) left++;
        while (mark[right]) right--;
        if (added == 0) {
            ans.push_back(left), ans.push_back(right);
            mark[left] = mark[right] = 1;
        } else {
            if (b[i - 1] < b[i]) {
                ans.push_back(right);
                mark[right] = 1;
            } else if (b[i - 1] > b[i]) {
                ans.push_back(left);
                mark[left] = 1;
            }
        }
    }
    for (int i : ans) {
        cout << i << ' ';
    }
    cout << endl;
    return 0;
}

Subtask #1
15.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 0 ms 204 KB Output isn't correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Correct 0 ms 332 KB Output is correct
7 Incorrect 0 ms 324 KB Output isn't correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Incorrect 0 ms 332 KB Output isn't correct
10 Incorrect 0 ms 320 KB Output isn't correct
11 Incorrect 1 ms 332 KB Output isn't correct
12 Incorrect 1 ms 332 KB Output isn't correct
13 Incorrect 1 ms 332 KB Output isn't correct

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Incorrect 2 ms 448 KB Output isn't correct
3 Incorrect 2 ms 588 KB Output isn't correct
4 Incorrect 4 ms 844 KB Output isn't correct
5 Incorrect 8 ms 1344 KB Output isn't correct
6 Incorrect 15 ms 2512 KB Output isn't correct
7 Incorrect 24 ms 3756 KB Output isn't correct