# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59787 | model_code | Zalmoxis (BOI18_zalmoxis) | C++17 | 332 ms | 18492 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;
const int NMAX = 1000000 + 5;
int N, K;
int v[NMAX];
pair <int, bool> ans[NMAX];
int ansSz;
int stk[NMAX], stkSz;
inline void pushAns(int val, bool type) {
ans[++ ansSz] = make_pair(val, type), K -= type;
}
inline void pushStk(int val) { stk[++ stkSz] = val; }
inline void popStk() { -- stkSz; }
inline void compressStk() {
while (stkSz >= 2 && stk[stkSz] == stk[stkSz - 1])
popStk(), ++ stk[stkSz];
}
inline void addAndCompressToStk() {
pushAns(stk[stkSz], true);
++ stk[stkSz];
compressStk();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |