# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76611 | tmwilliamlin168 | Swap (BOI16_swap) | C++14 | 936 ms | 232748 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int mxN=2e5;
int n, a[mxN+1];
vector<int> dp[mxN+1][36], v1, v2;
bool v[mxN+1][36];
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];
v[1][0]=1;
for(int i=1; 2*i+1<=n; ++i) {
for(int j=0; j<36; ++j) {
if(!v[i][j])
continue;
int b=i>>j/2^j&1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |