oj.uz

답안 #50228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50228 2018-06-08T11:27:18 Z rondojim 중앙값 배열 (balkan11_medians) C++17
5 / 100
 107 ms 22488 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);
	A[1] = B[1], cnt[B[1]]--;
	S.erase(S.find(B[1]));
	for(int i=2; i<=N; ++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){
				if(S.find(c) != S.end()){ A[j] = c; S.erase(S.find(c)); }
				else{
					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]);
			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);
		}
	}
	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
5.0 / 65.0

# 결과 실행 시간 메모리 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 900 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 5 ms 900 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 4 ms 900 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 4 ms 964 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Correct 3 ms 1040 KB Output is correct
7 Runtime error 5 ms 1040 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 5 ms 1100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 5 ms 1100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 4 ms 1100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 5 ms 1100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 7 ms 1232 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 5 ms 1236 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 1492 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 7 ms 2000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 13 ms 2768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 17 ms 4560 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 38 ms 8016 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 75 ms 15176 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 107 ms 22488 KB Execution killed with signal 11 (could be triggered by violating memory limits)