oj.uz

Submission #289801

# Submission time Handle Problem Language Result Execution time Memory
289801 2020-09-03T05:14:45 Z duckmoon99 Zalmoxis (BOI18_zalmoxis) C++14
95 / 100
 196 ms 9068 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef pair<int,int> ii;
typedef vector <ii> vii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

/*
5 1
29 27 25 25 28
*/

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, k; cin >> n >> k;
	int x;
	stack<int> s, curr;
	int ans[n+k];
	int idx = n+k-1;
	for(int i = 0; i < n; i++){
		cin >> x;
		s.push(x);
	}
	curr.push(30);
	while(!s.empty()){
		if(curr.empty() || idx<=-1){
			cout << -1 << '\n';
			return 0;
		}
		x = curr.top();
		curr.pop();
		if(x<s.top()){
			ans[idx]=x;
			idx--;
		}else if(x==s.top()){
			ans[idx]=x;
			idx--;
			s.pop();
		}else{
			curr.push(x-1);
			curr.push(x-1);
		}
	}
	while(idx>=0){
		if(int(curr.size())==idx+1){
			ans[idx]=curr.top();
			curr.pop();
			idx--;
		}else{
			if(curr.top() == 0){
				ans[idx]=curr.top();
				curr.pop();
				idx--;
			}else{
				x=curr.top();
				curr.pop();
				curr.push(x-1);
				curr.push(x-1);
			}
		}
	}
	
	for(int i = 0; i < n+k; i++){
		cout<<ans[i]<<" ";
	}
	cout<<'\n';
	
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 6704 KB Output is correct
2 Correct 163 ms 6616 KB Output is correct
3 Correct 162 ms 6704 KB Output is correct
4 Correct 162 ms 6776 KB Output is correct
5 Correct 168 ms 6732 KB Output is correct
6 Correct 160 ms 6576 KB Output is correct

Subtask #2
65.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 6632 KB Output is correct
2 Correct 166 ms 6580 KB Output is correct
3 Runtime error 101 ms 9068 KB Execution killed with signal 11
4 Correct 196 ms 6576 KB Output is correct
5 Correct 171 ms 6608 KB Output is correct
6 Correct 163 ms 6704 KB Output is correct
7 Correct 167 ms 6580 KB Output is correct
8 Correct 166 ms 6576 KB Output is correct
9 Correct 153 ms 8336 KB Output is correct
10 Correct 113 ms 7364 KB Output is correct
11 Correct 130 ms 8228 KB Output is correct
12 Correct 88 ms 6264 KB Output is correct
13 Correct 89 ms 6264 KB Output is correct
14 Correct 93 ms 6304 KB Output is correct