oj.uz

Submission #586098

# Submission time Handle Problem Language Result Execution time Memory
586098 2022-06-29T20:53:17 Z AlperenT Zalmoxis (BOI18_zalmoxis) C++17
5 / 100
 601 ms 209688 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5e6 + 5;

int n, k, arr[N];

vector<int> nums[N];

vector<pair<int, int>> v, vnext;

vector<int> vec, ans;

bool isneeded[N];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	
	cin >> n >> k;

	for(int i = 0; i < n; i++){
		cin >> arr[i];

		nums[i].push_back(arr[i]);

		v.push_back({arr[i], i});
	}

	for(int cur = 1; cur <= 29; cur++){
		reverse(v.begin(), v.end());

		while(!v.empty()){
			pair<int, int> p = v.back(); v.pop_back();

			if(p.first != cur) vnext.push_back(p);
			else{
				if(!v.empty() && v.back().first == cur){
					vnext.push_back({cur + 1, v.back().second});
					v.pop_back();
				}
				else{
					nums[p.second].push_back(cur);
					vnext.push_back({cur + 1, p.second});
				}
			}
		}

		swap(v, vnext);
		vnext.clear();
	}

	for(int i = 0; i < n; i++){
		for(auto x : nums[i]) vec.push_back(x);

		if(vec.size() >= N) return 31;
	}

	int ptr = 0;

	for(int i = 0; i < vec.size(); i++){
		if(ptr < n && vec[ptr] == arr[i]) isneeded[i] = true, ptr++;
	}

	for(int i = 0; i < vec.size(); i++){
		if(isneeded[i]) ans.push_back(vec[i]);
		else{
			vector<int> stk;

			stk.push_back(vec[i]);

			while(!stk.empty() && ans.size() + (vec.size() - i - 1) + stk.size() < n + k){
				int cur = stk.back(); stk.pop_back();

				if(cur == 1) ans.push_back(1);
				else stk.push_back(cur - 1), stk.push_back(cur - 1);
			}

			while(!stk.empty()){
				ans.push_back(stk.back());
				stk.pop_back();
			}
		}
	}

	// cout << ans.size() << "\n";

	for(auto x : ans) cout << x << " ";
}

Compilation message

zalmoxis.cpp: In function 'int main()':
zalmoxis.cpp:61:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |  for(int i = 0; i < vec.size(); i++){
      |                 ~~^~~~~~~~~~~~
zalmoxis.cpp:65:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  for(int i = 0; i < vec.size(); i++){
      |                 ~~^~~~~~~~~~~~
zalmoxis.cpp:72:73: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |    while(!stk.empty() && ans.size() + (vec.size() - i - 1) + stk.size() < n + k){
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 555 ms 208244 KB Expected EOF
2 Incorrect 507 ms 194272 KB Expected EOF
3 Incorrect 552 ms 207336 KB Expected EOF
4 Incorrect 531 ms 195828 KB Expected EOF
5 Incorrect 521 ms 195324 KB Expected EOF
6 Incorrect 591 ms 209688 KB Expected EOF

Subtask #2
5.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 559 ms 207780 KB Expected EOF
2 Incorrect 601 ms 209292 KB Expected EOF
3 Incorrect 530 ms 194536 KB Expected EOF
4 Incorrect 517 ms 194560 KB Expected EOF
5 Incorrect 526 ms 195716 KB Expected EOF
6 Incorrect 549 ms 208024 KB Expected EOF
7 Incorrect 531 ms 195208 KB Expected EOF
8 Incorrect 502 ms 193264 KB Expected EOF
9 Incorrect 488 ms 183776 KB Expected EOF
10 Incorrect 244 ms 145432 KB doesn't contain S as a subsequence
11 Incorrect 382 ms 165988 KB Expected EOF
12 Incorrect 124 ms 123764 KB doesn't contain S as a subsequence
13 Incorrect 127 ms 123684 KB doesn't contain S as a subsequence
14 Correct 127 ms 123708 KB Output is correct