oj.uz

Submission #258596

# Submission time Handle Problem Language Result Execution time Memory
258596 2020-08-06T07:56:03 Z 임성재(#5051) Swap (BOI16_swap) C++17
0 / 100
 2 ms 3456 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(a[x] < a[x*2] && a[x] < a[x*2+1]) return x;
	if(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 = inf, q = inf;
	
	//if(a[x*2] < a[x*2+1]) 
		p = min(p, f(x * 2));
	//else 
		q = min(q, f(x * 2 + 1));

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

	//if(a[x*2] < a[x*2+1]) 
		p = min(p, f(x * 2));
	//else 
		q = min(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 > n) return;
	
	if(a[x*2] < a[x] && a[x*2] < a[x*2+1]) {
		swap(a[x], a[x*2]);
	}
	else if(a[x*2+1] < a[x] && a[x*2+1] < a[x*2]) {
		swap(a[x], a[x*2+1]);

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

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

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

		swap(a[x*2], a[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<=800000; i++) {
		a[i] = inf;
	}

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

	g(1);

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

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Incorrect 2 ms 3456 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Incorrect 2 ms 3456 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Incorrect 2 ms 3456 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Incorrect 2 ms 3456 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3456 KB Output is correct
2 Correct 2 ms 3456 KB Output is correct
3 Correct 2 ms 3456 KB Output is correct
4 Incorrect 2 ms 3456 KB Output isn't correct
5 Halted 0 ms 0 KB -