| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370669 | TroySer | Bubble Sort Machine (JOI25_bubble) | C++20 | 2094 ms | 4900 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
ll Q;
cin >> Q;
while (Q--) {
ll Tj;
cin >> Tj;
if (Tj == 1) {
for (ll i = 0; i < N - 1; i++) {
if (A[i] > A[i + 1]) swap(A[i], A[i + 1]);
}
} else {
ll Li, Ri;
cin >> Li >> Ri;
Li--; Ri--;
ll S = 0;
for (ll i = Li; i <= Ri; i++) {
S += A[i];
}
cout << S << endl;
}
}
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
