oj.uz

Submission #50204

# Submission time Handle Problem Language Result Execution time Memory
50204 2018-06-08T10:00:39 Z rondojim medians (balkan11_medians) C++17
0 / 100
 132 ms 13144 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 5;

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

int main(){
	scanf("%d", &N);
	for(int i=1; i<=N; ++i) scanf("%d", &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]);
				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 >= B[i - 1]) --it;
				A[j] = *it;
				S.erase(it);
			}
		}
		else{
			it = S.upper_bound(B[i]);
			A[2 * i - 1] = *it;
			S.erase(it);
			it = S.lower_bound(B[i]);
			if(*it >= B[i]) --it;
			A[2 * i - 2] = *it;
			S.erase(it);
		}
		if(!vis[B[i]]){ S.insert(B[i - 1]); vis[B[i - 1]] = 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:31: 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]);
                          ~~~~~^~~~~~~~~~~~~

Subtask #1
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 5 ms 704 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 5 ms 940 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 6 ms 1044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 5 ms 1044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 5 ms 1044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 6 ms 1044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 6 ms 1044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 6 ms 1044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 6 ms 1044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Incorrect 2 ms 1044 KB Not a permutation
12 Runtime error 7 ms 1108 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 6 ms 1108 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 1344 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Incorrect 2 ms 1492 KB Not a permutation
3 Incorrect 11 ms 2004 KB Not a permutation
4 Incorrect 25 ms 3028 KB Not a permutation
5 Incorrect 37 ms 4940 KB Not a permutation
6 Incorrect 112 ms 8788 KB Not a permutation
7 Incorrect 132 ms 13144 KB Not a permutation