oj.uz

Submission #487496

# Submission time Handle Problem Language Result Execution time Memory
487496 2021-11-15T17:02:39 Z Koosha_mv Swap (BOI16_swap) C++14
10 / 100
 39 ms 4204 KB 
#include <bits/stdc++.h>
using namespace std;
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define print(v,r) f(i,0,r) cout<<v[i]<<" "; cout<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define Add(x,y) x=(x+y)%mod
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=1e6+99;

int n,t,a[N],b[N],ans[N];

int main(){
	fill(ans,ans+N,N);
	cin>>n;
	f(i,1,n+1) cin>>a[i];
	f(mask,0,(1<<n-1)){
		f(i,1,n+1){
			b[i]=a[i];
		}
		f(i,0,n-1){
			if(mask&(1<<i)){
				swap(b[i+2],b[(i+2)/2]);
			}
		}
		f(i,1,n+1){
			if(b[i]>ans[i]) break;
			if(b[i]<ans[i]){
				f(i,1,n+1) ans[i]=b[i];
				break;
			}
		}
	}
	f(i,1,n+1) cout<<ans[i]<<" ";
}

Compilation message

swap.cpp: In function 'int main()':
swap.cpp:28:16: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   28 |  f(mask,0,(1<<n-1)){
      |               ~^~
swap.cpp:7:32: note: in definition of macro 'f'
    7 | #define f(i,a,b) for(int i=a;i<b;i++)
      |                                ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4172 KB Output is correct
2 Correct 34 ms 4204 KB Output is correct
3 Correct 39 ms 4172 KB Output is correct
4 Correct 38 ms 4176 KB Output is correct
5 Correct 35 ms 4176 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4172 KB Output is correct
2 Correct 34 ms 4204 KB Output is correct
3 Correct 39 ms 4172 KB Output is correct
4 Correct 38 ms 4176 KB Output is correct
5 Correct 35 ms 4176 KB Output is correct
6 Incorrect 2 ms 4176 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4172 KB Output is correct
2 Correct 34 ms 4204 KB Output is correct
3 Correct 39 ms 4172 KB Output is correct
4 Correct 38 ms 4176 KB Output is correct
5 Correct 35 ms 4176 KB Output is correct
6 Incorrect 2 ms 4176 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4172 KB Output is correct
2 Correct 34 ms 4204 KB Output is correct
3 Correct 39 ms 4172 KB Output is correct
4 Correct 38 ms 4176 KB Output is correct
5 Correct 35 ms 4176 KB Output is correct
6 Incorrect 2 ms 4176 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4172 KB Output is correct
2 Correct 34 ms 4204 KB Output is correct
3 Correct 39 ms 4172 KB Output is correct
4 Correct 38 ms 4176 KB Output is correct
5 Correct 35 ms 4176 KB Output is correct
6 Incorrect 2 ms 4176 KB Output isn't correct
7 Halted 0 ms 0 KB -