oj.uz

Submission #50217

# Submission time Handle Problem Language Result Execution time Memory
50217 2018-06-08T10:30:31 Z rondojim medians (balkan11_medians) C++17
40 / 100
 121 ms 22536 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 5;

int A[2 * MAXN], B[MAXN], N, cnt[2 * MAXN];
set<int> S;

int main(){
	scanf("%d", &N);
	for(int i=1; i<=N; ++i){ scanf("%d", &B[i]); cnt[B[i]]++; }
	for(int i=1; i<2*N; ++i) S.insert(i);
	for(int i=1; i<N; ++i){ if(S.find(B[i]) != S.end()) S.erase(S.find(B[i])); }
	A[1] = B[1];
	for(int i=N; i>=2; --i){
		int p = B[i - 1], c = B[i];
		set<int>::iterator it;
		if(c > p){
			for(int j=2*i-1; j>=2*i-2; --j){
				auto it = S.lower_bound(B[i]);
				if(it == S.end()) --it;
				A[j] = *it;
				S.erase(it);
			}
		}
		else if(c < p){
			for(int j=2*i-1; j>=2*i-2; --j){
				it = S.lower_bound(B[i - 1]);
				if(it == S.end()) --it;
				else if(*it >= B[i - 1]) --it;
				A[j] = *it;
				S.erase(it);
			}
		}
		else{
			it = S.upper_bound(B[i]);
			if(it == S.end()) --it;
			A[2 * i - 1] = *it;
			S.erase(it);
			it = S.lower_bound(B[i]);
			if(it == S.end()) --it;
			else if(*it >= B[i]) --it;
			A[2 * i - 2] = *it;
			S.erase(it);
		}
		if(cnt[B[i - 1]] == 1) S.insert(B[i - 1]);
		else cnt[B[i - 1]]--;
	}
	for(int i=1; i<2*N; ++i) printf("%d ", A[i]);
	return 0;
}

Compilation message

medians.cpp: In function 'int main()':
medians.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
medians.cpp:12:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=N; ++i){ scanf("%d", &B[i]); cnt[B[i]]++; }
                           ~~~~~^~~~~~~~~~~~~

Subtask #1
35.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Runtime error 3 ms 592 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Correct 2 ms 620 KB Output is correct
4 Runtime error 2 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Runtime error 2 ms 688 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Correct 2 ms 688 KB Output is correct
9 Runtime error 3 ms 688 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Correct 2 ms 688 KB Output is correct
11 Runtime error 2 ms 876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Correct 3 ms 876 KB Output is correct
13 Runtime error 3 ms 1084 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
5.0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 1272 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Correct 6 ms 1476 KB Output is correct
3 Runtime error 9 ms 2552 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 20 ms 4344 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 33 ms 7800 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 71 ms 14968 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 121 ms 22536 KB Execution killed with signal 11 (could be triggered by violating memory limits)