oj.uz

Submission #56150

# Submission time Handle Problem Language Result Execution time Memory
56150 2018-07-10T06:11:07 Z 김세빈(#1581) Swap (BOI16_swap) C++11
10 / 100
 3 ms 652 KB 
#include <bits/stdc++.h>

using namespace std;

int A[22], B[22], n;

void f(int p)
{
	if(p > n){
		int i;
		
		for(i=1;i<=n;i++) if(A[i] != B[i]) break;
		if(i <= n && A[i] < B[i]){
			for(i=1;i<=n;i++) B[i] = A[i];
		}
		return;
	}
	
	if((p<<1) > n) f(p+1);
	else if((p<<1|1) > n){
		if(A[p] > A[p<<1]){
			swap(A[p], A[p<<1]);
			f(p+1);
			swap(A[p], A[p<<1]);
		}
		else f(p+1);
	}
	else{
		if(A[p] < A[p<<1] && A[p] < A[p<<1|1]) f(p+1);
		else if(A[p<<1] < A[p<<1|1]){
			swap(A[p], A[p<<1]);
			f(p+1);
			swap(A[p], A[p<<1]);
		}
		else{
			swap(A[p], A[p<<1|1]);
			f(p+1);
			swap(A[p], A[p<<1|1]);
			
			swap(A[p], A[p<<1]);
			swap(A[p], A[p<<1|1]);
			f(p+1);
			swap(A[p], A[p<<1|1]);
			swap(A[p], A[p<<1]);
		}
	}
}

int main()
{
	int i;
	
	scanf("%d", &n);
	
	if(n > 20) return 0;
	
	for(i=1;i<=n;i++) scanf("%d", A+i), B[i] = A[i];
	
	f(1);
	
	for(i=1;i<=n;i++) printf("%d ", B[i]);
	
	printf("\n");
	
	return 0;
}

Compilation message

swap.cpp: In function 'int main()':
swap.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
swap.cpp:57:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=n;i++) scanf("%d", A+i), B[i] = A[i];
                    ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 616 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 616 KB Output is correct
6 Incorrect 2 ms 652 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 616 KB Output is correct
6 Incorrect 2 ms 652 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 616 KB Output is correct
6 Incorrect 2 ms 652 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 3 ms 616 KB Output is correct
6 Incorrect 2 ms 652 KB Output isn't correct
7 Halted 0 ms 0 KB -