| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 798905 |
2023-07-31T06:47:56 Z |
boyliguanhan |
Swap (BOI16_swap) |
C++17 |
|
1 ms |
1876 KB |
#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,a)>dp(2*i+1,a)) swap(a2,b2);
a = c2;
b = a2;
c = b2;
}
cout << a << ' ';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1868 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1864 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1876 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1748 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1868 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1864 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1876 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1876 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1868 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1864 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1876 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1876 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
1748 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1868 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1864 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1876 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1876 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
1748 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1868 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1864 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1876 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1748 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1876 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
1748 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
