| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1170502 | Math4Life2020 | Bubble Sort 2 (JOI18_bubblesort2) | C++20 | 9092 ms | 580 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = int; using pii = pair<ll,ll>;
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V) {
ll N = A.size();
ll Q = X.size();
vector<int> ansV;
for (ll q=0;q<Q;q++) {
A[X[q]]=V[q];
ll ansc = 0;
for (ll i=0;i<N;i++) {
ll anst = 0;
for (ll j=0;j<i;j++) {
if (A[j]>A[i]) {
anst++;
}
}
ansc = max(anst,ansc);
}
ansV.push_back(ansc);
}
return ansV;
}| # | 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... | ||||
