oj.uz

답안 #35189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
35189 2017-11-18T16:10:17 Z cheater2k 중앙값 배열 (balkan11_medians) C++14
100 / 100
 56 ms 4552 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 200005;

int n, a[N], b[N];
int T[N];
bool used[N];

void upd(int x) { for(; x < N; x += x & -x) T[x]++; }
int get(int x) { int res = 0; for (; x > 0; x -= x & -x) res += T[x]; return res; }

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) scanf("%d", b + i);

	int l = 1, r = 2 * n - 1;
	int pt = 0;
	for (int i = 1; i <= n; ++i) {
		if (!used[b[i]]) used[b[i]] = 1, a[++pt] = b[i], upd(b[i]);

		int med = b[i];
		while(pt < 2 * i - 1) {
			while(l <= 2 * n - 1 && used[l]) ++l;
			while(r >= 1 && used[r]) --r;
			int smaller = get(med - 1);
			if (smaller < i - 1) a[++pt] = l, upd(l), used[l++] = 1;
			else if (pt - smaller < i) a[++pt] = r, upd(r), used[r--] = 1;
		}
	}

	for (int i = 1; i <= 2 * n - 1; ++i) printf("%d ", a[i]);
	printf("\n");
}

Compilation message

medians.cpp: In function 'int main()':
medians.cpp:14:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
medians.cpp:15:49: 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
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4552 KB Output is correct
2 Correct 0 ms 4552 KB Output is correct
3 Correct 0 ms 4552 KB Output is correct
4 Correct 0 ms 4552 KB Output is correct
5 Correct 0 ms 4552 KB Output is correct
6 Correct 0 ms 4552 KB Output is correct
7 Correct 0 ms 4552 KB Output is correct
8 Correct 0 ms 4552 KB Output is correct
9 Correct 0 ms 4552 KB Output is correct
10 Correct 0 ms 4552 KB Output is correct
11 Correct 0 ms 4552 KB Output is correct
12 Correct 0 ms 4552 KB Output is correct
13 Correct 0 ms 4552 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4552 KB Output is correct
2 Correct 0 ms 4552 KB Output is correct
3 Correct 3 ms 4552 KB Output is correct
4 Correct 3 ms 4552 KB Output is correct
5 Correct 13 ms 4552 KB Output is correct
6 Correct 36 ms 4552 KB Output is correct
7 Correct 56 ms 4552 KB Output is correct