# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60790 | 2018-07-24T16:59:33 Z | alenam0161 | Zalmoxis (BOI18_zalmoxis) | C++17 | 335 ms | 10772 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 n,k; void rek(int x){ if(!x||k<=1){ ans.push_back(x); return; } k--; rek(x-1); rek(x-1); } int main(){ 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){ 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(); } while(st.size()!=1){ ans.push_back(st.top()); st.push(st.top()); rem(); k--; } int z=st.top(); while(k>0){ ans.push_back(z); z++; k--; st.pop(); st.push(z); if(z>40)break; } if(k) rek(st.top()); 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 | Correct | 290 ms | 10332 KB | Output is correct |
2 | Correct | 247 ms | 10596 KB | Output is correct |
3 | Correct | 246 ms | 10596 KB | Output is correct |
4 | Correct | 238 ms | 10596 KB | Output is correct |
5 | Correct | 228 ms | 10596 KB | Output is correct |
6 | Correct | 273 ms | 10596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 238 ms | 10604 KB | not a zalsequence |
2 | Correct | 245 ms | 10604 KB | Output is correct |
3 | Incorrect | 250 ms | 10640 KB | not a zalsequence |
4 | Incorrect | 310 ms | 10660 KB | not a zalsequence |
5 | Incorrect | 335 ms | 10708 KB | not a zalsequence |
6 | Incorrect | 312 ms | 10772 KB | not a zalsequence |
7 | Incorrect | 278 ms | 10772 KB | not a zalsequence |
8 | Incorrect | 264 ms | 10772 KB | not a zalsequence |
9 | Incorrect | 251 ms | 10772 KB | not a zalsequence |
10 | Incorrect | 257 ms | 10772 KB | not a zalsequence |
11 | Incorrect | 182 ms | 10772 KB | not a zalsequence |
12 | Incorrect | 184 ms | 10772 KB | not a zalsequence |
13 | Incorrect | 122 ms | 10772 KB | not a zalsequence |
14 | Incorrect | 204 ms | 10772 KB | not a zalsequence |