| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339169 | eysbutno | Bubble Sort 2 (JOI18_bubblesort2) | C++20 | 9091 ms | 784 KiB |
#include <bits/stdc++.h>
using ll = long long;
std::vector<int> countScans(std::vector<int> a, std::vector<int> x, std::vector<int> v) {
const int n = a.size();
const int q = x.size();
std::vector<int> res(q);
for (int t = 0; t < q; t++) {
a[x[t]] = v[t];
std::vector<int> cur;
for (int i : a) {
bool ins = false;
for (int &j : cur) {
if (j <= i) j = i, ins = true;
}
if (!ins) cur.push_back(i);
}
res[t] = cur.size() - 1;
}
return res;
}| # | 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... | ||||
