제출 #1241363

#제출 시각아이디문제언어결과실행 시간메모리
1241363MateiKing80Zalmoxis (BOI18_zalmoxis)C++20
35 / 100
253 ms327680 KiB
#include <bits/stdc++.h> using namespace std; const int K = 1e6 + 5; int n, k, acum, v[K]; vector<int> deBagat[K]; void trie(int nr) { if (v[acum] == nr) { acum ++; return; } trie(nr - 1); if (acum > n || v[acum] > nr - 1) { k --; deBagat[acum - 1].push_back(nr - 1); return; } trie(nr - 1); } void print(int nr) { if (k == 0) { cout << nr << " "; return; } print(nr - 1), print(nr - 1); } signed main() { cin >> n >> k; for (int i = 1; i <= n; i ++) cin >> v[i]; acum = 1; trie(30); for (int i = 1; i <= n; i ++) { cout << v[i] << " "; for (auto j : deBagat[i]) print(j); } cout << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...