Submission #76587

#TimeUsernameProblemLanguageResultExecution timeMemory
76587tmwilliamlin168Swap (BOI16_swap)C++14
68 / 100
773 ms263168 KiB
#include <bits/stdc++.h> using namespace std; const int mxN=2e5; int n, a[mxN+1], cdi; unordered_map<int, int> di[mxN+1]; vector<int> dp[mxN*18*2]; void mrg(vector<int> &v, vector<int> &a, vector<int> &b) { for(int l=1, i=0, j=0; i<a.size()||j<b.size(); i+=l, j+=l, l*=2) { for(int k=0; k<l&&i+k<a.size(); ++k) v.push_back(a[i+k]); for(int k=0; k<l&&j+k<b.size(); ++k) v.push_back(b[j+k]); } } int c(int i, int b) { auto it=di[i].find(b); if(it!=di[i].end()) return it->second; int r=cdi++; di[i][b]=r; if(2*i+1<=n) { if(a[2*i+1]<b&&a[2*i+1]<a[2*i]) { vector<int> v1={a[2*i+1]}, v2={a[2*i+1]}; mrg(v1, dp[c(2*i, a[2*i])], dp[c(2*i+1, b)]); mrg(v2, dp[c(2*i, b)], dp[c(2*i+1, a[2*i])]); dp[r]=min(v1, v2); vector<int>().swap(v1); vector<int>().swap(v2); } else { dp[r]={min(b, a[2*i])}; mrg(dp[r], dp[c(2*i, max(b, a[2*i]))], dp[c(2*i+1, a[2*i+1])]); } } else if(2*i<=n) dp[r]={min(b, a[2*i]), max(b, a[2*i])}; else dp[r]={b}; return r; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i=1; i<=n; ++i) cin >> a[i]; for(int b : dp[c(1, a[1])]) cout << b << " "; }

Compilation message (stderr)

swap.cpp: In function 'void mrg(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
swap.cpp:10:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int l=1, i=0, j=0; i<a.size()||j<b.size(); i+=l, j+=l, l*=2) {
                         ~^~~~~~~~~
swap.cpp:10:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int l=1, i=0, j=0; i<a.size()||j<b.size(); i+=l, j+=l, l*=2) {
                                     ~^~~~~~~~~
swap.cpp:11:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<l&&i+k<a.size(); ++k)
                     ~~~^~~~~~~~~
swap.cpp:13:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<l&&j+k<b.size(); ++k)
                     ~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...