oj.uz

Submission #154352

# Submission time Handle Problem Language Result Execution time Memory
154352 2019-09-21T06:11:48 Z dolphingarlic medians (balkan11_medians) C++14
10 / 100
 35 ms 3960 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

bool visited[200000];
int seq[200000];
queue<int> l, g;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, curr;
    cin >> n >> seq[1];
    visited[seq[1]] = true;
    curr = seq[1];
    FOR(i, 1, n) {
        int x;
        cin >> x;
        if (curr == x) {
            l.push(2 * i);
            g.push(2 * i + 1);
        } else if (curr < x) {
            g.push(2 * i);
            g.push(2 * i + 1);
            if (!visited[x]) {
                seq[g.front()] = x;
                visited[x] = true;
                g.pop();
            }
        } else {
            l.push(2 * i);
            l.push(2 * i + 1);
            if (!visited[x]) {
                seq[l.front()] = x;
                visited[x] = true;
                l.pop();
            }
        }
        curr = x;
    }

    int indx = 1;
    while (l.size()) {
        while (visited[indx]) indx++;
        seq[l.front()] = indx++;
        l.pop();
    }
    while (g.size()) {
        while (visited[indx]) indx++;
        seq[g.front()] = indx++;
        g.pop();
    }

    FOR(i, 1, 2 * n) cout << seq[i] << ' ';
    cout << '\n';
    return 0;
}

Subtask #1
10.0 / 65.0

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

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Incorrect 3 ms 504 KB Output isn't correct
3 Incorrect 5 ms 632 KB Output isn't correct
4 Incorrect 7 ms 888 KB Output isn't correct
5 Incorrect 13 ms 1528 KB Output isn't correct
6 Incorrect 23 ms 2680 KB Output isn't correct
7 Incorrect 35 ms 3960 KB Output isn't correct