oj.uz

답안 #1030533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030533 2024-07-22T06:32:33 Z racsosabe 중앙값 배열 (balkan11_medians) C++14
0 / 100
 19 ms 2908 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2 * 100000 + 5;

int n;
int a[N];
int b[N];
bool vis[N];

void solve() {
	a[1] = b[1]; vis[1] = true;
	int L = 2, R = 2 * n - 1;
	for(int i = 2; i <= n; i++) {
		int l = 2 * i - 2;
		int r = 2 * i - 1;
		if(b[i - 1] == b[i]) {
			while(vis[L]) L += 1;
			a[l] = L; vis[L] = true;
			while(vis[R]) R -= 1;
			a[r] = R; vis[R] = true;
		}
		else if(b[i - 1] > b[i]) {
			if(not vis[b[i]]) {
				while(vis[L]) L += 1;
				a[l] = L; vis[L] = true;
				a[r] = b[i]; vis[b[i]] = true;
			}
			else {
				while(vis[L]) L += 1;
				a[l] = L; vis[L] = true;
				while(vis[L]) L += 1;
				a[R] = L; vis[L] = true;
			}
		}
		else {
			if(not vis[b[i]]) {
				while(vis[R]) R -= 1;
				a[l] = R; vis[R] = true;
				a[r] = b[i]; vis[b[i]] = true;
			}
			else {
				while(vis[R]) R -= 1;
				a[l] = R; vis[R] = true;
				while(vis[R]) R -= 1;
				a[r] = R; vis[R] = true;
			}
		}
	}
}

int main() {
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> b[i];
	solve();
	for(int i = 1; i <= 2 * n - 1; i++) cout << a[i] << " \n"[i == 2 * n - 1];
	return 0;
}

Subtask #1
0.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Not a permutation
2 Incorrect 1 ms 348 KB Not a permutation
3 Incorrect 0 ms 348 KB Integer 0 violates the range [1, 59]
4 Incorrect 1 ms 344 KB Integer 0 violates the range [1, 79]
5 Incorrect 0 ms 348 KB Not a permutation
6 Incorrect 1 ms 348 KB Not a permutation
7 Incorrect 0 ms 348 KB Integer 0 violates the range [1, 139]
8 Incorrect 1 ms 348 KB Integer 0 violates the range [1, 159]
9 Incorrect 1 ms 344 KB Integer 0 violates the range [1, 179]
10 Incorrect 1 ms 348 KB Integer 0 violates the range [1, 199]
11 Incorrect 0 ms 348 KB Not a permutation
12 Incorrect 0 ms 348 KB Not a permutation
13 Incorrect 1 ms 348 KB Integer 0 violates the range [1, 1999]

Subtask #2
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Integer 0 violates the range [1, 3999]
2 Incorrect 1 ms 348 KB Integer 0 violates the range [1, 7999]
3 Incorrect 2 ms 692 KB Integer 0 violates the range [1, 15999]
4 Incorrect 3 ms 860 KB Integer 0 violates the range [1, 31999]
5 Incorrect 7 ms 1116 KB Integer 0 violates the range [1, 63999]
6 Incorrect 19 ms 1840 KB Not a permutation
7 Incorrect 16 ms 2908 KB Not a permutation