oj.uz

답안 #258582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258582 2020-08-06T07:32:47 Z 임성재(#5051) Swap (BOI16_swap) C++17
0 / 100
 0 ms 384 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(NULL)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define all(v) (v).begin(), (v).end()
#define pre(a) cout<<fixed; cout.precision(a)
#define mp make_pair

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;

int n;
int a[800010];
int ans[800010];

int f(int x) {
	if(x*2 > n || a[x] < a[x*2] && a[x] < a[x*2+1]) return x;
	if(x*2+1 > n || a[x*2] < a[x] && a[x*2] < a[x*2+1]) {
		swap(a[x], a[x*2]);

		int ret = f(x*2);

		swap(a[x], a[x*2]);

		return ret;
	}
	swap(a[x], a[x*2+1]);

	int p, q;
	
	if(a[x*2] < a[x*2+1]) p = f(x * 2);
	else q = f(x * 2 + 1);

	swap(a[x*2], a[x*2+1]);

	if(a[x*2] < a[x*2+1]) p = f(x * 2);
	else q = f(x * 2 + 1);

	swap(a[x*2], a[x*2+1]);
	swap(a[x], a[x*2+1]);
	return min(p, q);
}

void g(int x) {
	if(x*2 > n || a[x] < a[x*2] && a[x] < a[x*2+1]) return;
	if(x*2+1 > n || a[x*2] < a[x] && a[x*2] < a[x*2+1]) {
		swap(a[x], a[x*2]); 
		return;
	}
	swap(a[x], a[x*2+1]);

	int p, q;
	
	if(a[x*2] < a[x*2+1]) p = f(x * 2);
	else q = f(x * 2 + 1);

	swap(a[x*2], a[x*2+1]);

	if(a[x*2] < a[x*2+1]) p = f(x * 2);
	else q = f(x * 2 + 1);

	if(p < q) {
		if(a[x*2] > a[x*2+1]) swap(a[x*2], a[x*2+1]);
	}
	else {
		if(a[x*2] < a[x*2+1]) swap(a[x*2], a[x*2+1]);
	}

	g(x*2);
	g(x*2+1);
}

int main() {
	fast;

	cin >> n;

	for(int i=1; i<=n; i++) {
		cin >> a[i];
	}

	g(1);

	for(int i=1; i<=n; i++) {
		cout << a[i] << " ";
	}
}

Compilation message

swap.cpp: In function 'int f(int)':
swap.cpp:25:30: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  if(x*2 > n || a[x] < a[x*2] && a[x] < a[x*2+1]) return x;
                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
swap.cpp:26:32: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  if(x*2+1 > n || a[x*2] < a[x] && a[x*2] < a[x*2+1]) {
                  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
swap.cpp: In function 'void g(int)':
swap.cpp:53:30: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  if(x*2 > n || a[x] < a[x*2] && a[x] < a[x*2+1]) return;
                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
swap.cpp:54:32: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  if(x*2+1 > n || a[x*2] < a[x] && a[x*2] < a[x*2+1]) {
                  ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
swap.cpp: In function 'int f(int)':
swap.cpp:37:9: warning: 'q' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int p, q;
         ^
swap.cpp:37:6: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int p, q;
      ^
swap.cpp: In function 'void g(int)':
swap.cpp:70:2: warning: 'q' may be used uninitialized in this function [-Wmaybe-uninitialized]
  if(p < q) {
  ^~
swap.cpp:70:2: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -