# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633521 | Arinoor | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 5702 ms | 1572 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];
int solve(){
vector<pii> S;
for(int i = 0; i < n; i ++){
S.pb(mp(a[i], i));
}
sort(all(S));
int ans = 0;
int c = 0;
for(int i = 0; i < n; i ++){
c ++;
if(i == n - 1 or S[i].se < S[i + 1].se){
ans = max(ans, c);
c = 0;
# | 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... |