# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
60804 | 2018-07-24T17:13:21 Z | alenam0161 | Zalmoxis (BOI18_zalmoxis) | C++17 | 389 ms | 10612 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==0||k<=1){ ans.push_back(x); return; } k--; rek(x-1); rek(x-1); } int main(){ // fl(); 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>30)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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 291 ms | 10332 KB | Output is correct |
2 | Correct | 235 ms | 10368 KB | Output is correct |
3 | Correct | 284 ms | 10368 KB | Output is correct |
4 | Correct | 322 ms | 10536 KB | Output is correct |
5 | Correct | 278 ms | 10544 KB | Output is correct |
6 | Correct | 263 ms | 10544 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 389 ms | 10544 KB | not a zalsequence |
2 | Correct | 363 ms | 10544 KB | Output is correct |
3 | Incorrect | 314 ms | 10572 KB | not a zalsequence |
4 | Incorrect | 285 ms | 10572 KB | not a zalsequence |
5 | Incorrect | 242 ms | 10576 KB | not a zalsequence |
6 | Incorrect | 236 ms | 10612 KB | not a zalsequence |
7 | Incorrect | 214 ms | 10612 KB | not a zalsequence |
8 | Incorrect | 263 ms | 10612 KB | not a zalsequence |
9 | Incorrect | 214 ms | 10612 KB | not a zalsequence |
10 | Incorrect | 148 ms | 10612 KB | not a zalsequence |
11 | Incorrect | 207 ms | 10612 KB | not a zalsequence |
12 | Incorrect | 122 ms | 10612 KB | not a zalsequence |
13 | Incorrect | 146 ms | 10612 KB | not a zalsequence |
14 | Incorrect | 120 ms | 10612 KB | not a zalsequence |