Submission #1102540

#TimeUsernameProblemLanguageResultExecution timeMemory
1102540ramzialoulouStone Arranging 2 (JOI23_ho_t1)C++17
35 / 100
27 ms2068 KiB
#include <bits/stdc++.h>

using namespace std;

#ifdef Ramzi
#include "debug.h"
#else
#define debug(...)
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  map<int, int> cnt;
  for (int i = 0; i < n; i++) {
    cnt[a[i]] += 1;
  }
  for (int i = 0; i < n; i++) {
    if (cnt[a[i]] > 1) {
      int j = i;
      while (i < n && cnt[a[j]] > 0) {
        if (a[i] == a[j]) {
          cnt[a[i]] -= 1;
        }
        //ebug(a[i], i, cnt[a[i]]);
        a[i] = a[j];
        ++i;
      }
      --i;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << "\n";
  }
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...