Submission #489626

#TimeUsernameProblemLanguageResultExecution timeMemory
489626Kevin_Zhang_TWSwap (BOI16_swap)C++17
0 / 100
0 ms204 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define pb emplace_back #define AI(i) begin(i), end(i) template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); } template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); } #ifdef KEV #define DE(args...) kout("[ " + string(#args) + " ] = ", args) void kout() { cerr << endl; } template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); } template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; } #else #define DE(...) 0 #define debug(...) 0 #endif const int MAX_N = 300010; int32_t main() { ios_base::sync_with_stdio(0), cin.tie(0); int n; cin >> n; vector<int> v(n+1); for (int i = 1;i <= n;++i) cin >> v[i]; for (int i = 1;i <= n;++i) { int &a = (i*2<=n?v[i*2]:v[0]), &b = (i*2+1<=n?v[i*2+1]:v[0]); if (a < b && a < v[i]) swap(a, v[i]); if (b < a && b < v[i]) swap(b, v[i]); } for (int i = 1;i <= n;++i) cout << v[i] << " \n"[i==n]; }
#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...