Submission #496048

#TimeUsernameProblemLanguageResultExecution timeMemory
496048600MihneaBubble Sort 2 (JOI18_bubblesort2)C++17
17 / 100
9072 ms600 KiB
#include "bubblesort2.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> countScans(vector<int> a, vector<int> pos, vector<int> value){
  int n = (int) a.size();
  int q = (int) pos.size();

  assert(q == (int) value.size());
  vector<int> sol;

  for (int it = 0; it < q; it++) {
    a[pos[it]] = value[it];
    int MX = 0;
    for (int i = 0; i < n; i++) {
      int bigger = 0;
      for (int j = 0; j < i; j++) {
        if (a[j] > a[i]) {
          bigger++;
        }
      }
      MX = max(MX, bigger);
    }
    sol.push_back(MX);
  }

  return sol;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...