Submission #798909

#TimeUsernameProblemLanguageResultExecution timeMemory
798909boyliguanhanSwap (BOI16_swap)C++17
100 / 100
654 ms4400 KiB
#include<bits/stdc++.h> #define T(a,b,c) make_tuple(a,b,c) using namespace std; int arr[400100],n; int dp(int i,int v){ if(i*2>n) return 0; int x = arr[2*i]; if(i*2==n) return x<v; int y=arr[2*i+1]; if(v<x&&v<y) return 0; if(x<v&&x<y) return 1 + dp(2*i,v); if(v<x) return min(dp(2*i,v),dp(2*i+1,v))+1; int l1 = dp(2*i,x), l2 = dp(2*i+1,x); if(l1<=l2) return 1 +dp(2*i+1,v); return 1+dp(2*i,v); } int main() { memset(arr, 7, sizeof arr); cin >> n; for(int i = 1; i <= n; i++) cin >> arr[i]; for(int i = 1; i <= n; i++) { int &a=arr[i],&b=arr[i*2],&c=arr[i*2+1]; if(a<b&&a<c); else if(b<a&&b<c) swap(a,b); else { int a2=a,b2=b,c2=c; if(a2>b2) swap(a2,b2); if(dp(2*i,a2)>dp(2*i+1,a2)) swap(a2,b2); a = c2; b = a2; c = b2; } cout << a << ' '; } }
#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...