oj.uz

Submission #585117

# Submission time Handle Problem Language Result Execution time Memory
585117 2022-06-28T10:14:04 Z Pety medians (balkan11_medians) C++14
95 / 100
 82 ms 12876 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int INF = 1e9;
const int MOD = 1e9 + 7;

int n, a[100002], b[200002], viz[200002];
set<int>s;

int main () 
{
  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++)
    cin >> a[i];
  viz[a[1]] = 1;
  for (int i = 1; i < 2 * n; i++)
    s.insert(i);
  s.erase(a[1]);
  for (int i = 2; i <= n; i++) {
    if (a[i] == a[i - 1]) {
      b[2 * i - 1] = *s.begin();
      b[2 * i - 2] = *s.rbegin();
    
      s.erase(b[2 * i - 1]);
      s.erase(b[2 * i - 2]);
      viz[b[2 * i - 2]] = 1;
      viz[b[2 * i - 1]] = 1;
    }
    else if (a[i] > a[i - 1]) {
      b[2 * i - 1] = *s.rbegin();
      auto it = s.rbegin();
      if (viz[a[i]]) {
        it--;
        b[2 * i - 2] = *it;
      }
      else
        b[2 * i - 2] = a[i];
      s.erase(b[2 * i - 1]);
      s.erase(b[2 * i - 2]);
      viz[b[2 * i - 2]] = 1;
      viz[b[2 * i - 1]] = 1;
    }
    else {
      b[2 * i - 1] = *s.begin();
      auto it = s.begin();
      if (viz[a[i]]) {
        it++;
        b[2 * i - 2] = *it;
      }
      else
        b[2 * i - 2] = a[i];
      s.erase(b[2 * i - 1]);
      s.erase(b[2 * i - 2]);
      viz[b[2 * i - 2]] = 1;
      viz[b[2 * i - 1]] = 1;
    }
      assert(b[2 * i - 1] != b[2 * i - 2]);

  }
  b[1] = a[1];
  for (int i = 1; i < 2 * n; i++)
    cout << b[i] << " ";
  return 0;
}

Subtask #1
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct

Subtask #2
30.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 7 ms 1236 KB Output is correct
4 Incorrect 12 ms 2260 KB Not a permutation
5 Correct 25 ms 4300 KB Output is correct
6 Correct 53 ms 8324 KB Output is correct
7 Correct 82 ms 12876 KB Output is correct