제출 #1276070

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1276070		burnthememory	Bubble Sort Machine (JOI25_bubble)	C++20	0 / 100	462 ms	20080 KiB

bubble

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first 
#define se second

const ll N = 1e5*2 + 10;
vector<vector<ll>> adj(N);
vector<vector<ll>> dp(2, vector<ll> (N,  1));
ll MOD = 1e9+7;
vector<ll> vis(N, 0);

void solve(){
	ll n; cin >> n;

	ll a[n+10];
	for(int i = 0; i < n; i++){
		cin >> a[i+1];
	}
	ll q; cin >> q;

    vector<ll> pref(n+1, 1e17);
        for(int i = 1; i <= n; i++){
            pref[i] = min(pref[i-1], a[i]);
            // cout << pref[i] << " ";
        }

        cout << endl;

        ll cur = 0;
	while(q--){
		ll que; cin >> que;
		if(que == 1){
            cur++;
		}else{
			ll l, r;
			cin >> l >> r;
            cur = min(cur+1, n);
            cout << pref[cur] << endl;
		}
	}
    
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ll t=1; 
	// cin >> t;
	while(t--) solve();
}

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