# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125463 | ntdaccode | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9090 ms | 13200 KiB |
#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 = 5e5 + 10;
const int SIZE = 500;
int n, q, a[M], uu[M], vv[M];
int f[M];
vector<ii> rrh[SIZE + 10];
int id(int i) {
return (i + SIZE - 1)/SIZE;
}
int get_cnt(int val,int pos)
{
int ret = 0;
int bl = id(pos);
int l = (bl - 1) * SIZE + 1;
for(int i = 1;i <= bl - 1; i++) {
ii tmp = {val,pos};
ret += rrh[i].size() - (upper_bound(rrh[i].begin(), rrh[i].end(), tmp) - rrh[i].begin() );
}
for(int i = l;i <= pos - 1; i++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |