제출 #1281044

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

bubble

//Author RufatM
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<vector<pii>> vvp;
typedef vector<bool> vb;
typedef vector<string> vs;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ff first
#define ss second
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)
#define mt19937_64 mt_rand(chrono::steady_clock::now().time_since_epoch().count())
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
template<typename T> bool isPrime(T n){if(n<=1)return false;if(n<=3)return true;if(n%2==0 or n%3==0)return false;for(T i=5;i*i<=n;i+=6)if(n%i==0 or n%(i+2)==0)return false;return true;}
const int MOD=1000000007;
const int INF=1000000007;
const ll LINF=1e18+7;
const int LOG=21;
const int MAXN=100005;
const int MAXM=200005;
signed main(){
    fastio;
    #ifndef ONLINE_JUDGE
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #endif
    int t=1;
    //cin >> t;
    while(t--){
        int n;
        cin >> n;
        vll a(n+2),pref(n+2);
        for(int i=1;i<=n;i++){
            cin >> a[i];
        }
        set<int> st;
        for(int i=1;i<n;i++){
            if(a[i]>a[i+1]){
                st.insert(i);
            }
        }
        auto prefix_sum=[&](){
            pref[0]=0;
            for(int i=1;i<=n;i++){
                pref[i]=pref[i-1]+a[i];
            }
        };
        prefix_sum();
        int q;
        cin >> q;
        while(q--){
            int type;
            cin >> type;
            if(type==1){
                vector<int> cur(all(st));
                st.clear();
                for(int i:cur){
                    if(a[i]>a[i+1]){
                        swap(a[i],a[i+1]);
                    }
                }
                for(int i:cur){
                    for(int j=max(1,i-1);j<=min(n-1,i+1);j++){
                        if(a[j]>a[j+1]){
                            st.insert(j);
                        }
                    }
                }
                prefix_sum();
            }
            else{
                int l,r;
                cin >> l >> r;
                cout << pref[r]-pref[l-1] << endl;
            }
        }
    }
}

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