# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60750 | 2018-07-24T15:58:32 Z | alenam0161 | Zalmoxis (BOI18_zalmoxis) | C++17 | 321 ms | 18856 KB |
#include <bits/stdc++.h> void fl(); using namespace std; const int N = 1000000+7; int a[N]; stack<int> st; vector<int> ans; void rem(){ while(st.size()>=2){ int z=st.top(); st.pop(); if(z==st.top()){ st.pop(); st.push(z+1); } else{ st.push(z); break; } } } int main(){ int n,k; scanf("%d %d",&n,&k); for(int i=0;i<n;++i){ scanf("%d",a+i); } int s=k; st.push(a[0]); ans.push_back(a[0]); for(int i=1;i<n;++i){ if(a[i]>=st.top()){ while(a[i]>st.top()){ int x=st.top(); ans.push_back(x); st.push(x); rem(); k--; } ans.push_back(a[i]); st.push(a[i]); rem(); } else{ ans.push_back(a[i]); st.push(a[i]); } } while(st.size()!=1){ assert(0); ans.push_back(st.top()); st.push(st.top()); rem(); k--; } int z=st.top(); while(k>0){ ans.push_back(z); z++; k--; } if(ans.size()!=s+n){ assert(0); } for(int i=0;i<ans.size();++i){ printf("%d ",ans[i]); } return 0; } void fl(){ freopen("input.txt","r",stdin); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 160 ms | 16604 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Runtime error | 177 ms | 16700 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
3 | Runtime error | 151 ms | 16748 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Runtime error | 175 ms | 16816 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Runtime error | 162 ms | 16904 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
6 | Runtime error | 141 ms | 16904 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 218 ms | 16904 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Correct | 321 ms | 18836 KB | Output is correct |
3 | Incorrect | 312 ms | 18856 KB | not a zalsequence |
4 | Runtime error | 168 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Runtime error | 164 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
6 | Runtime error | 204 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
7 | Runtime error | 173 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
8 | Runtime error | 202 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
9 | Runtime error | 139 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
10 | Runtime error | 63 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
11 | Runtime error | 108 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
12 | Runtime error | 5 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
13 | Runtime error | 3 ms | 18856 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
14 | Incorrect | 207 ms | 18856 KB | not a zalsequence |