| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1143811 | bekzhan29 | Bubble Sort 2 (JOI18_bubblesort2) | C++20 | 9091 ms | 580 KiB |
#include "bubblesort2.h"
typedef long long ll;
using namespace std;
vector<int> countScans(vector<int> a,vector<int> x,vector<int> v){
ll n=a.size(),q=x.size();
vector<int> ans(q);
for (int j=0;j<q;j++) {
a[x[j]]=v[j];
ans[j]=0;
for(ll i=0;i<n;i++)
{
int cnt=0;
for(ll l=0;l<i;l++)
cnt+=a[l]>a[i];
ans[j]=max(ans[j],cnt);
}
}
return ans;
}
| # | 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... | ||||
