oj.uz

Submission #289795

# Submission time Handle Problem Language Result Execution time Memory
289795 2020-09-03T05:11:13 Z duckmoon99 Zalmoxis (BOI18_zalmoxis) C++17
0 / 100
 1 ms 416 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);
	cout << -1;
	return 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;
		}
		//printf("curr.top:%d s.top:%d idx:%d\n",curr.top(),s.top(),idx);
		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 || curr.empty()){ 
			cout << -1 <<'\n';
			return 0;
		}else 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
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
2 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
3 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
4 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
5 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
6 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
2 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
3 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
4 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
5 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
6 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
7 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
8 Incorrect 1 ms 416 KB Unexpected end of file - int32 expected
9 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
10 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
11 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
12 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
13 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
14 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected