Submission #1229974

#TimeUsernameProblemLanguageResultExecution timeMemory
1229974MuhammadSaramZalmoxis (BOI18_zalmoxis)C++20
0 / 100
323 ms15364 KiB
#include <bits/stdc++.h> using namespace std; #define all(v) v.begin(), v.end() #define mp make_pair const int M = 31; vector<pair<int,int>> ind[M]; int main() { ios::sync_with_stdio(0); cin.tie(NULL), cout.tie(NULL); int n,k; cin>>n>>k; int a[n]; for (int i=0;i<n;i++) cin>>a[i],ind[a[i]].push_back({i,0}); for (int x=0;x<M;x++) { for (auto [i,b]:ind[x]) { if (b) continue; int pr=0,nx=n; for (int y=x+1;y<M;y++) { int o=lower_bound(all(ind[y]),mp(i,0))-begin(ind[y]); if (o) pr=max(pr,ind[y][o-1].first); if (o<ind[y].size()) nx=min(nx,ind[y][o].first); } int cnt=0; for (int y=0;y<x;y++) { int q=lower_bound(all(ind[y]),mp(pr,0))-begin(ind[y]); int w=lower_bound(all(ind[y]),mp(nx,0))-begin(ind[y]); cnt=cnt/2+q-w; } cnt/=2; if (cnt%2) k--,ind[x].push_back({i,1}); } sort(all(ind[x])); } vector<pair<pair<int,int>,int>> v; for (int x=0;x<M;x++) for (auto i:ind[x]) v.push_back({i,x}); sort(all(v)); for (auto [i,x]:v) { vector<int> p={x}; int cnt=0; if (i.second) { while (k && p.size()) { int s=p.back();p.pop_back(); if (!s) { cnt++; continue; } k--,p.push_back(s-1),p.push_back(s-1); } } for (int s:p) cout<<s<<' '; while (cnt--) cout<<0<<' '; } cout<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...