oj.uz

답안 #116490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116490 2019-06-12T15:33:51 Z Adhyyan1252 중앙값 배열 (balkan11_medians) C++11
5 / 100
 79 ms 14456 KB 
#include<bits/stdc++.h>
//https://oj.uz/problem/view/balkan11_mediansxx	
using namespace std;

int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	int n; cin>>n;
	vector<int> b(n);
	
	for(int i = 0; i < n; i++) cin>>b[i];
	
	vector<int> suffMax(n), suffMin(n);
	suffMax[n-1] = b[n-1];
	suffMin[n-1] = b[n-1];
	for(int i = n-2; i >= 0; i--){
		suffMax[i] = max(suffMax[i+1], b[i]);
		suffMin[i] = min(suffMin[i+1], b[i]);
	}
	
	vector<int> a(2*n-1);
	vector<int> f(2*n);
	a[0] = b[0];
	set<int> s;
	for(int i = 1; i <= 2*n-1; i++){
		if(i == b[0]) continue;
		s.insert(i);
	}
	
	for(int i = 1; i < n; i++){
		if(b[i] > b[i-1]){
			assert(s.size() > 0);
			auto it = s.end(); it--;
			
			if(f[b[i]] == 0){ // not inserted yet, insert now
				f[b[i]] = 1;
				f[*it] = 1;
				a[i*2-1] = b[i];
				a[i*2] = *it;
				s.erase(it);
			}else{
				f[*it] = 1;
				a[i*2-1] = *it;
				s.erase(it);
				
				
				assert(s.size() > 0);
				it = s.end(); it--;
				f[*it] = 1;
				a[i*2] = *it;
				s.erase(it);
			}
			
		}else if(b[i] < b[i-1]){
			
			assert(s.size() > 0);
			auto it = s.begin();
			
			if(f[b[i]] == 0){ // not inserted yet, insert now
				f[b[i]] = 1;
				f[*it] = 1;
				a[i*2-1] = b[i];
				a[i*2] = *it;
				s.erase(it);
			}else{
				f[*it] = 1;
				a[i*2-1] = *it;
				s.erase(it);
				
				assert(s.size() > 0);
				it = s.begin();
				f[*it] = 1;
				a[i*2] = *it;
				s.erase(it);
			}
		}else if(b[i] == b[i-1]){
			
			assert(s.size() > 0);
			auto it = s.end(); it--;
			f[*it] = 1;
			a[i*2-1] = *it;
			s.erase(it);
			
			
			assert(s.size() > 0);
			it = s.begin();
			f[*it] = 1;
			a[i*2] = *it;
			s.erase(it);			
		}else{
			assert(false);
		}
	}
	
	for(int i = 0; i < a.size(); i++){
		cout<<a[i]<<" ";
	}
	cout<<endl;

}

Compilation message

medians.cpp: In function 'int main()':
medians.cpp:94:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < a.size(); i++){
                 ~~^~~~~~~~~~

Subtask #1
5.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Not a permutation
2 Incorrect 2 ms 384 KB Not a permutation
3 Incorrect 2 ms 512 KB Not a permutation
4 Incorrect 2 ms 512 KB Not a permutation
5 Incorrect 2 ms 384 KB Not a permutation
6 Correct 3 ms 384 KB Output is correct
7 Incorrect 2 ms 384 KB Not a permutation
8 Incorrect 2 ms 384 KB Not a permutation
9 Incorrect 2 ms 384 KB Not a permutation
10 Incorrect 2 ms 384 KB Not a permutation
11 Incorrect 3 ms 384 KB Not a permutation
12 Incorrect 3 ms 384 KB Not a permutation
13 Incorrect 3 ms 512 KB Not a permutation

Subtask #2
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 768 KB Not a permutation
2 Incorrect 5 ms 896 KB Not a permutation
3 Incorrect 7 ms 1408 KB Not a permutation
4 Incorrect 12 ms 2560 KB Not a permutation
5 Incorrect 25 ms 4856 KB Not a permutation
6 Incorrect 49 ms 9360 KB Not a permutation
7 Incorrect 79 ms 14456 KB Not a permutation