Submission #1121276

#	Time	Username	Problem	Language	Result	Execution time	Memory
1121276		ntdaccode	Bubble Sort 2 (JOI18_bubblesort2)	C++17	0 / 100	1144 ms	1232 KiB

bubblesort2

#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back

using namespace std;

typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;

const int M = 1e6 + 10;
const int N = 1e3 + 10;
const int mod = 1e9 + 7;

int n, q, a[M], bit[M];
void upd(int idx)
{
  while(idx <= n) {
    bit[idx]++;
    idx += idx&(-idx);
  }
}

int get(int idx) {
  int res = 0;
  while(idx > 0) {
    res += bit[idx];
    idx -= idx&(-idx);
  }
  return res;
}

vector<int> rrh;
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V)
{
  n = A.size();
  q = X.size();
  for(int v : A) rrh.pb(v);
  for(int v : V) rrh.pb(v);
  sort(rrh.begin(),rrh.end());
  vector<int> ans;
  for(int i = 1;i <= n; i++) {
      a[i] = A[i - 1];
      a[i] = lower_bound(rrh.begin(),rrh.end(),a[i]) - rrh.begin() + 1;
  }
  for(int i = 1;i <= q; i++)
  {
    int u,v;
    u = X[i - 1];v = V[i - 1];
    v = lower_bound(rrh.begin(),rrh.end(),v) - rrh.begin() + 1;
    u++;
    a[u] = v;
    for(int i = 1;i <= n; i++) bit[i] = 0;
    int kq = 0;
    for(int i = n;i != 0; i--) {
        kq = max(kq,get(a[i] - 1));
        upd(a[i]);
    }
    ans.pb(kq);
  }
  return ans;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 21
• Subtask 3: 0 / 22
• Subtask 4: 0 / 40