Submission #1049254

#TimeUsernameProblemLanguageResultExecution timeMemory
1049254javotazWatermelon (INOI20_watermelon)C++17
0 / 100
5 ms1628 KiB
// 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, c[N]; 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; memset(c, 127, sizeof c); 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(); if (b[i] > 1 && c[b[i] - 1] > R[i]) { cout << -1; return; } } c[b[i]] = i; 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...