# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
756502 | 2023-06-11T18:14:49 Z | sheldon | Zalmoxis (BOI18_zalmoxis) | C++14 | 184 ms | 11192 KB |
#include <bits/stdc++.h> using namespace std; void solve() { // ifstream cin ("zalmoxis.in"); // ofstream cout ("zalmoxis.out"); int n, k; cin >> n >> k; vector<int> st = {(int) 1e9}; vector<int> a(n), ans; int done = 0; for (int i = 0; i < n; ++i) { cin >> a[i]; assert(a[i] <= 1e9); if (a[i] == st.back()) { st.push_back(a[i]); while (st.size() > 1 && st.back() == st[st.size() - 2]) { st.pop_back(); st.back()++; } } else if (a[i] > st.back()) { while (a[i] > st.back()) { ans.push_back(st.back()); st.push_back(st.back()); ++done; while (st.size() > 1 && st.back() == st[st.size() - 2]) { st.pop_back(); st.back()++; } } st.push_back(a[i]); while (st.size() > 1 && st.back() == st[st.size() - 2]) { st.pop_back(); st.back()++; } } else { st.push_back(a[i]); } ans.push_back(a[i]); } while (st.size() != 2) { ans.push_back(st.back()); st.push_back(st.back()); ++done; while (st.size() > 1 && st.back() == st[st.size() - 2]) { st.pop_back(); st.back()++; } } assert(st[1] <= 30); for (int it = st[1]; it < st[1] + k - done; ++it) { ans.push_back(it); } st.clear(); for (int i = 0; i < ans.size(); ++i) { st.push_back(ans[i]); while (st.size() > 1 && st.back() == st[st.size() - 2]) { st.pop_back(); st.back()++; } } for (int x : ans) cout << x << ' '; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 141 ms | 10328 KB | Output is correct |
2 | Correct | 145 ms | 10396 KB | Output is correct |
3 | Correct | 145 ms | 10332 KB | Output is correct |
4 | Correct | 142 ms | 10384 KB | Output is correct |
5 | Correct | 151 ms | 10328 KB | Output is correct |
6 | Correct | 159 ms | 10344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 163 ms | 10296 KB | not a zalsequence |
2 | Correct | 143 ms | 10420 KB | Output is correct |
3 | Incorrect | 142 ms | 10280 KB | not a zalsequence |
4 | Incorrect | 145 ms | 10356 KB | not a zalsequence |
5 | Incorrect | 151 ms | 10428 KB | not a zalsequence |
6 | Incorrect | 146 ms | 10372 KB | not a zalsequence |
7 | Incorrect | 144 ms | 10308 KB | not a zalsequence |
8 | Incorrect | 184 ms | 10456 KB | not a zalsequence |
9 | Incorrect | 133 ms | 9784 KB | not a zalsequence |
10 | Incorrect | 132 ms | 10280 KB | not a zalsequence |
11 | Incorrect | 116 ms | 9888 KB | not a zalsequence |
12 | Incorrect | 92 ms | 11192 KB | not a zalsequence |
13 | Incorrect | 84 ms | 11168 KB | not a zalsequence |
14 | Incorrect | 85 ms | 11192 KB | not a zalsequence |