Submission #867454

#	Time	Username	Problem	Language	Result	Execution time	Memory
867454		42kangaroo	Zalmoxis (BOI18_zalmoxis)	C++17	30 / 100	122 ms	19008 KiB

zalmoxis

//
// Created by 42kangaroo on 28/10/2023.
//
#include "bits/stdc++.h"

using namespace std;

#define int long long

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	vector<pair<int,int>> addBef;
	stack<pair<int,int>> st;
	auto mergeBack= [&st](){
		while (st.size()> 1){
			auto t = st.top();
			st.pop();
			if (st.top().second == t.second) {
				st.top().second++;
			} else {
				st.push(t);
				break;
			}
		}
	};
	for (int i = 0; i < n; ++i) {
		while (!st.empty() && st.top().second < a[i]) {
			addBef.push_back(st.top());
			st.push({-1, st.top().second});
			mergeBack();
		}
		st.push({i, a[i]});
		mergeBack();
	}
	while (!st.empty() && st.top().second < 30) {
		addBef.push_back(st.top());
		st.push({-1, st.top().second});
		mergeBack();
	}
	vector<int> out;
	int addInd = 0;
	bool first = true;
	assert(!addBef.empty());
	for (int i = 0; i < n; ++i) {
		while (addInd < addBef.size() && addBef[addInd].first == i) {
			if (first) {
				int ks = k - addBef.size() + 1;
				int p2 = 1;
				for (int j = 0; j <= 30; ++j, p2*= 2) {
					if (p2 >= ks) {
						for (int l = 0; l < ks; ++l) {
							if (l < p2 - ks - 1) out.push_back(addBef[addInd].second - j - 1);
							else out.push_back(addBef[addInd].second - j);
						}
						break;
					}
				}
				first = false;
				addInd++;
			} else {
				out.push_back(addBef[addInd++].second);
			}
		}
		out.push_back(a[i]);
	}
	for (auto e: out) {
		cout << e << " ";
	}
}

Compilation message (stderr)

zalmoxis.cpp: In function 'int main()':
zalmoxis.cpp:51:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   while (addInd < addBef.size() && addBef[addInd].first == i) {
      |          ~~~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70