# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
131931 | maruii | Zalmoxis (BOI18_zalmoxis) | C++14 | 177 ms | 14820 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int A[1000006];
void f(int x, int m) {
if (m < 1) return;
if (m == 1) {
cout << x << ' ';
return;
}
f(x - 1, m / 2);
f(x - 1, m - m / 2);
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int N, K; cin >> N >> K;
for (int i = 1; i <= N; ++i) cin >> A[i];
vector<int> v;
vector<pii> ans;
for (int i = 1; i <= N; ++i) {
while (v.size() && v.back() < A[i]) {
ans.push_back(pii(v.back(), 1));
v.push_back(v.back());
while (v.size() > 1 && v.back() == v[v.size() - 2]) {
v.pop_back();
++v.back();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |