oj.uz

답안 #1049246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049246 2024-08-08T15:25:35 Z javotaz Watermelon (INOI20_watermelon) C++17
0 / 100
 5 ms 1364 KB 
// In the Name of Allah

#include<bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,avx,avx2,sse4.2,popcnt,tune=native")

typedef long long ll;

#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define pp pop_back
#define all(x) x.begin(), x.end()

const int N = 1e5 + 12;
int b[N], n, a[N], R[N], x, k; 

void ip() {
	cin >> n >> k;
	for (int i = 0; i < n; i++)
		cin >> b[i];
}

void f(int l, int r) {
	if (r - l <= 1) {
		if (l != r)
			a[l] = x++;
		return;
	}
	f(l + 1, R[l]);
	a[l] = x++;
	f(R[l], r);
}

void solve() {
	x = 1;
	for (int i = n - 1; ~i; --i)
		if (b[i] == -1)
			b[i] = n + 1;
	vector<int> v;
	for (int i = n - 1; ~i; --i) {
		while (!v.empty() && b[v.back()] < b[i])
			v.pp();
		if (b[i] == n + 1)
			R[i] = n;
		else {
			if (v.empty()) {
				cout << -1;
				return;
			}
			R[i] = v.back();
		}
		v.pb(i);
	}
	f(0, n);
	for (int i = 0; i < n; i++)
		cout << a[i] << ' ';
}

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	ip(), solve();
	return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 1364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 1364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -