# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633526 | Arinoor | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9095 ms | 2396 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bug(x) cerr << #x << " : " << x << '\n'
typedef pair<int, int> pii;
const int maxn = 2e5 + 10;
int n, q;
int a[maxn], b[maxn];
int solve(){
vector<pii> V;
for(int i = 0; i < n; i ++){
V.pb(mp(a[i], i));
}
sort(all(V));
for(int i = 1; i <= n; i ++){
b[V[i - 1].se] = i;
}
set<int> S;
S.insert(n + 1);
int ans = 0;
for(int i = n - 1; ~i; 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... |