Submission #1370770

#	Time	Username	Problem	Language	Result	Execution time	Memory
1370770		TroySer	Bubble Sort Machine (JOI25_bubble)	C++20	11 / 100	530 ms	8752 KiB

bubble

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll INF = 1e18;

int main() {

    ll N;
    cin >> N;

    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }

    vector<pair<ll, ll> > numLive;
    ll minSoFar = INF;
    for (ll i = 0; i < N; i++) {
        if (A[i] < minSoFar) {
            minSoFar = A[i];
            numLive.push_back({A[i], i});
        }
    }

    ll numSwaps = 0;
    ll idx = 0;

    ll Q;
    cin >> Q;

    while (Q--) {

        ll Tj;
        cin >> Tj;

        if (Tj == 1) {
            numSwaps++;
            if (idx < (ll)numLive.size() - 1 && numSwaps >= numLive[idx + 1].second) idx++;
        } else {
            ll Li, Ri;
            cin >> Li >> Ri;
            cout << numLive[idx].first << endl;
        }

    }

}

• Subtask 1: 0 / 5
• Subtask 2: 11 / 11
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 29
• Subtask 6: 0 / 17