# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199367 | mahmoudbadawy | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9093 ms | 1864 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>
#define F first
#define S second
using namespace std;
const int N=500005;
pair<int,int> arr[N];
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V)
{
int n=A.size();
vector<int> v;
for(int i=0;i<X.size();i++)
{
A[X[i]]=V[i];
for(int i=0;i<n;i++)
{
arr[i].F=A[i]; arr[i].S=i;
}
sort(arr,arr+n);
int ans=0;
for(int i=0;i<n;i++) ans=max(ans,max(arr[i].S-i,0));
v.push_back(ans);
}
return v;
}
Compilation message (stderr)
# | 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... |