oj.uz

Submission #414344

# Submission time Handle Problem Language Result Execution time Memory
414344 2021-05-30T11:00:10 Z Blagojce Swap (BOI16_swap) C++11
68 / 100
 1000 ms 82564 KB 
#include <bits/stdc++.h>
#include <cstdio>
#pragma GCC optimize("O3")
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 262144 + 10;
 
inline int readint(){
	int ret=0;
	for(char c;;){
		c=getchar();
		if('0'<=c and c<='9')
			ret=ret*10+(c&15);
		else
			return ret;
	}
}
vector<char> digits;
inline void printint(int x){
	do{
		digits.push_back(x%10|48);
		x/=10;
	}while(x);
	while(not digits.empty())
		putchar(digits.back()), digits.pop_back();
}
 
 
int n;
int a[mxn];
 
 
unordered_map<int, vector<int> > f[mxn];
int p, l;
int mi;

void combine(vector<int> &v1, vector<int> &v2, vector<int> &r){
	
	
	p = 0;
	l = 1;
	
	while(p < (int)v1.size()){
		fr(k, 0, l){
			r.pb(v1[p+k]);
		}
		fr(k, 0, l){
			r.pb(v2[p+k]);
		}
		p += l;
		l *= 2;
	}
}
 

 
vector<int> g1;
vector<int> g2;
vector<int> cand;

void rec(int k){
	
	cand.pb(a[k]);
	if(k != 1){
		if(k%2) cand.pb(a[k-1]);
		else cand.pb(a[k+1]);
	}
	
	
	if(k*2 > n){
		for(auto u : cand){
			f[k][u] = {u};
		}
		cand.pop_back();
		if(k != 1){
			cand.pop_back();
		}
		return;
	}
	
	rec(k*2);
	rec(k*2+1);
	
	
	for(auto j : cand){
		
		mi = min(j, min(a[k*2], a[k*2+1]));
		
		if(j == mi){
			f[k][j] = {mi};
			combine(f[k*2][a[k*2]], f[k*2+1][a[k*2+1]], f[k][j]);
		}
		else if(a[k*2] == mi){
			f[k][j] = {mi};
			combine(f[k*2][j], f[k*2+1][a[k*2+1]], f[k][j]);
		}
		else{
			
			
			g1.clear();
			g1.pb(mi);
			
			combine(f[k*2][a[k*2]], f[k*2+1][j], g1);
			g2.clear();
			g2.pb(mi);
			combine(f[k*2][j], f[k*2+1][a[k*2]], g2);
			f[k][j] = min(g1, g2);
		}
	}
	cand.pop_back();
	if(k != 1){
		cand.pop_back();
	}
	f[2*k].clear();
	f[2*k+1].clear();
}

 
void solve(){
	n = readint();
	fr(i, 1, n+1){
		a[i] = readint();
	}
	int orgn = n;
	int m = n;
	while(m+1 - ((m+1)&-(m+1)) != 0){	
		++m;
	}
	
	fr(i, n+1, m+1){
		a[i] = i;
	}
	n = m;
	/*for(int i = n; i >= 1; i --){
		cand.clear();	
		for(int j = i; j >= 1; j /= 2){
			cand.pb(a[j]);
			if(j != 1){
				if(j % 2){
					cand.pb(a[j-1]);
				}
				else{
					cand.pb(a[j+1]);
				}
			}
		}
		
		
		for(auto j : cand){
			if(i*2 > n){
				f[i][j] = {j};
			}
			else{
				mi = min(j, min(a[i*2], a[i*2+1]));
				if(j == mi){
					f[i][j] = {mi};
					combine(f[i*2][a[i*2]], f[i*2+1][a[i*2+1]], f[i][j]);
				}
				else if(a[i*2] == mi){
					f[i][j] = {mi};
					combine(f[i*2][j], f[i*2+1][a[i*2+1]], f[i][j]);
				}
				else{
					g1.clear();
					g1.pb(mi);
					combine(f[i*2][a[i*2]], f[i*2+1][j], g1);
					g2.clear();
					g2.pb(mi);
					combine(f[i*2][j], f[i*2+1][a[i*2]], g2);
					f[i][j] = min(g1, g2);
				}
				//f[i][j].insert(f[i][j].begin(), mi);	
			}
		}
		if(i*2 <= n){
			f[i*2].clear();
			f[i*2+1].clear();
		}
		
		
	}*/
	rec(1);
	
	vector<int> ans = f[1][a[1]];
	fr(i, 0, orgn){
		printint(ans[i]);
		putchar(' ');
	}	
}
 
int main(){
	digits.reserve(10);
	//freopen("t.in.25", "r", stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14668 KB Output is correct
2 Correct 9 ms 14692 KB Output is correct
3 Correct 9 ms 14692 KB Output is correct
4 Correct 11 ms 14692 KB Output is correct
5 Correct 10 ms 14696 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14668 KB Output is correct
2 Correct 9 ms 14692 KB Output is correct
3 Correct 9 ms 14692 KB Output is correct
4 Correct 11 ms 14692 KB Output is correct
5 Correct 10 ms 14696 KB Output is correct
6 Correct 10 ms 14668 KB Output is correct
7 Correct 10 ms 14676 KB Output is correct
8 Correct 10 ms 14668 KB Output is correct
9 Correct 10 ms 14668 KB Output is correct
10 Correct 10 ms 14668 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14668 KB Output is correct
2 Correct 9 ms 14692 KB Output is correct
3 Correct 9 ms 14692 KB Output is correct
4 Correct 11 ms 14692 KB Output is correct
5 Correct 10 ms 14696 KB Output is correct
6 Correct 10 ms 14668 KB Output is correct
7 Correct 10 ms 14676 KB Output is correct
8 Correct 10 ms 14668 KB Output is correct
9 Correct 10 ms 14668 KB Output is correct
10 Correct 10 ms 14668 KB Output is correct
11 Correct 14 ms 14872 KB Output is correct
12 Correct 13 ms 14908 KB Output is correct
13 Correct 13 ms 14948 KB Output is correct
14 Correct 15 ms 14924 KB Output is correct
15 Correct 13 ms 15052 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14668 KB Output is correct
2 Correct 9 ms 14692 KB Output is correct
3 Correct 9 ms 14692 KB Output is correct
4 Correct 11 ms 14692 KB Output is correct
5 Correct 10 ms 14696 KB Output is correct
6 Correct 10 ms 14668 KB Output is correct
7 Correct 10 ms 14676 KB Output is correct
8 Correct 10 ms 14668 KB Output is correct
9 Correct 10 ms 14668 KB Output is correct
10 Correct 10 ms 14668 KB Output is correct
11 Correct 14 ms 14872 KB Output is correct
12 Correct 13 ms 14908 KB Output is correct
13 Correct 13 ms 14948 KB Output is correct
14 Correct 15 ms 14924 KB Output is correct
15 Correct 13 ms 15052 KB Output is correct
16 Correct 456 ms 41260 KB Output is correct
17 Correct 463 ms 41072 KB Output is correct
18 Correct 464 ms 41320 KB Output is correct
19 Correct 457 ms 41736 KB Output is correct
20 Correct 457 ms 41744 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14668 KB Output is correct
2 Correct 9 ms 14692 KB Output is correct
3 Correct 9 ms 14692 KB Output is correct
4 Correct 11 ms 14692 KB Output is correct
5 Correct 10 ms 14696 KB Output is correct
6 Correct 10 ms 14668 KB Output is correct
7 Correct 10 ms 14676 KB Output is correct
8 Correct 10 ms 14668 KB Output is correct
9 Correct 10 ms 14668 KB Output is correct
10 Correct 10 ms 14668 KB Output is correct
11 Correct 14 ms 14872 KB Output is correct
12 Correct 13 ms 14908 KB Output is correct
13 Correct 13 ms 14948 KB Output is correct
14 Correct 15 ms 14924 KB Output is correct
15 Correct 13 ms 15052 KB Output is correct
16 Correct 456 ms 41260 KB Output is correct
17 Correct 463 ms 41072 KB Output is correct
18 Correct 464 ms 41320 KB Output is correct
19 Correct 457 ms 41736 KB Output is correct
20 Correct 457 ms 41744 KB Output is correct
21 Execution timed out 1084 ms 82564 KB Time limit exceeded
22 Halted 0 ms 0 KB -