Submission #1276043

#TimeUsernameProblemLanguageResultExecution timeMemory
1276043ahmd_ibraaaBubble Sort Machine (JOI25_bubble)C++20
5 / 100
2096 ms15888 KiB
#include <bits/stdc++.h> using namespace std; #define fi first #define sec second #define int long long signed main(){ int n,q; cin>>n; int a[n+1], pref[n+1]; pref[0] = 0; for(int i=1; i<=n; i++){ cin>>a[i]; pref[i] = pref[i-1] + a[i]; } cin>>q; while(q--){ int t; cin>>t; if(t==1){ for(int i=1; i<=n-1; i++){ if(a[i]>a[i+1]){ swap(a[i], a[i+1]); } } for(int i=1; i<=n; i++){ pref[i] = pref[i-1] + a[i]; } } else{ int l,r; cin>>l>>r; cout<<pref[r]-pref[l-1]<<endl; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...