Submission #1370669

#TimeUsernameProblemLanguageResultExecution timeMemory
1370669TroySerBubble Sort Machine (JOI25_bubble)C++20
0 / 100
2094 ms4900 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 timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...