Submission #76607

#TimeUsernameProblemLanguageResultExecution timeMemory
76607tmwilliamlin168Swap (BOI16_swap)C++14
68 / 100
1076 ms251584 KiB
#include <bits/stdc++.h> using namespace std; const int mxN=2e5; int n, a[mxN+1]; vector<int> dp[mxN+1][36], v1, v2; 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 main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i=1; i<=n; ++i) cin >> a[i]; for(int i=n; i; --i) { for(int j=0; i>>j; ++j) { for(int k=0; k<1+((i>>j&1)&&i>>j>1); ++k) { int b=i>>j^k, c=j*2+k; if(2*i+1<=n) { if(a[2*i+1]<a[b]&&a[2*i+1]<a[2*i]) { v1={a[2*i+1]}; v2={a[2*i+1]}; mrg(v1, dp[2*i][0], dp[2*i+1][c+2]); mrg(v2, dp[2*i][c+2], dp[2*i+1][1]); dp[i][c]=min(v1, v2); } else { dp[i][c]={min(a[b], a[2*i])}; mrg(dp[i][c], dp[2*i][a[b]>a[2*i]?c+2:0], dp[2*i+1][0]); } } else if(2*i<=n) dp[i][c]={min(a[b], a[2*i]), max(a[b], a[2*i])}; else dp[i][c]={a[b]}; } } if(2*i+1<=n) for(int j=0; j<2; ++j) for(int k=0; k<36; ++k) vector<int>().swap(dp[2*i+j][k]); } for(int b : dp[1][0]) cout << b << " "; }

Compilation message (stderr)

swap.cpp: In function 'void mrg(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
swap.cpp:9: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:9: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:10:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<l&&i+k<a.size(); ++k)
                     ~~~^~~~~~~~~
swap.cpp:12: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...