oj.uz

Submission #375331

# Submission time Handle Problem Language Result Execution time Memory
375331 2021-03-09T09:21:40 Z Mamnoon_Siam Swap (BOI16_swap) C++17
68 / 100
 932 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second

const int N = 4e5 + 3;

unordered_map<int, vi> dp[N];
int a[N], n, nn;
vi todo[N];

vi merge(vi& p, vi& q, int x) {
  vi r; r.reserve(sz(p)+sz(q)+1);
  r.emplace_back(x);
  int pw = 1;
  int i = 0, j = 0;
  while(i < sz(p) or j < sz(q)) {
    r.insert(r.end(), p.begin()+i, p.begin()+min(sz(p), i+pw));
    r.insert(r.end(), q.begin()+j, q.begin()+min(sz(q), j+pw));
    i = min(i+pw, sz(p));
    j = min(j+pw, sz(q));
    pw *= 2;
  }
  return r;
}

int main(int argc, char* argv[]) {
  cin.sync_with_stdio(0); cin.tie(0);
  cin.exceptions(cin.failbit);
#ifdef LOCAL
  freopen("in", "r", stdin);
#endif
  cin >> n;
  nn = 1;
  while(nn-1 < n) nn *= 2;
  nn--;
  for(int i = 1; i <= n; ++i)
    cin >> a[i];
  for(int i = n+1; i <= nn; ++i)
    a[i] = n+1;
  for(int i:{1,2,3})
    if(i <= nn) todo[1].emplace_back(a[i]);
  for(int i = 2; i <= nn; ++i) {
    for(int j:{i,2*i,2*i+1})
      if(j <= nn) todo[i].emplace_back(a[j]);
    int u = i;
    while(u != 1) {
      if(u & 1)
        todo[i].emplace_back(a[u^1]);
      todo[i].emplace_back(a[u >>= 1]);
    }
  }
  for(int i = nn/2+1; i <= nn; ++i) {
    for(int x : todo[i])
      dp[i][x] = {x};
  }
  for(int u = nn/2; u >= 1; --u) {
    for(int k : todo[u]) {
      vi& ret = dp[u][k];
      { // don't use any edge
        vi& l = dp[2*u][a[2*u]];
        vi& r = dp[2*u+1][a[2*u+1]];
        ret = merge(l, r, k);
      }
      { // use only left edge
        vi& l = dp[2*u][k];
        vi& r = dp[2*u+1][a[2*u+1]];
        vi tmp = merge(l, r, a[2*u]);
        ret = min(ret, tmp);
      }
      { // use only right edge
        vi& l = dp[2*u][a[2*u]];
        vi& r = dp[2*u+1][k];
        vi tmp = merge(l, r, a[2*u+1]);
        ret = min(ret, tmp);
      }
      { // use both edges
        vi& l = dp[2*u][k];
        vi& r = dp[2*u+1][a[2*u]];
        vi tmp = merge(l, r, a[2*u+1]);
        ret = min(ret, tmp);
      }
    }
    for(int v:{2*u,2*u+1}) {
      // for(auto pa : dp[v]) pa.second.clear();
      dp[v].clear();
    }
  }
  vi ans = dp[1][a[1]];
  for(int i = 0; i < n; ++i)
    cout << ans[i] << ' ';
  cout << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31724 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 23 ms 31724 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31724 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 23 ms 31724 KB Output is correct
6 Correct 24 ms 31724 KB Output is correct
7 Correct 23 ms 31724 KB Output is correct
8 Correct 26 ms 31724 KB Output is correct
9 Correct 25 ms 31724 KB Output is correct
10 Correct 25 ms 31648 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31724 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 23 ms 31724 KB Output is correct
6 Correct 24 ms 31724 KB Output is correct
7 Correct 23 ms 31724 KB Output is correct
8 Correct 26 ms 31724 KB Output is correct
9 Correct 25 ms 31724 KB Output is correct
10 Correct 25 ms 31648 KB Output is correct
11 Correct 31 ms 32620 KB Output is correct
12 Correct 32 ms 32620 KB Output is correct
13 Correct 30 ms 32620 KB Output is correct
14 Correct 30 ms 32620 KB Output is correct
15 Correct 30 ms 32620 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31724 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 23 ms 31724 KB Output is correct
6 Correct 24 ms 31724 KB Output is correct
7 Correct 23 ms 31724 KB Output is correct
8 Correct 26 ms 31724 KB Output is correct
9 Correct 25 ms 31724 KB Output is correct
10 Correct 25 ms 31648 KB Output is correct
11 Correct 31 ms 32620 KB Output is correct
12 Correct 32 ms 32620 KB Output is correct
13 Correct 30 ms 32620 KB Output is correct
14 Correct 30 ms 32620 KB Output is correct
15 Correct 30 ms 32620 KB Output is correct
16 Correct 914 ms 113516 KB Output is correct
17 Correct 932 ms 113516 KB Output is correct
18 Correct 911 ms 113516 KB Output is correct
19 Correct 908 ms 113644 KB Output is correct
20 Correct 919 ms 113516 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31724 KB Output is correct
2 Correct 26 ms 31724 KB Output is correct
3 Correct 24 ms 31724 KB Output is correct
4 Correct 23 ms 31724 KB Output is correct
5 Correct 23 ms 31724 KB Output is correct
6 Correct 24 ms 31724 KB Output is correct
7 Correct 23 ms 31724 KB Output is correct
8 Correct 26 ms 31724 KB Output is correct
9 Correct 25 ms 31724 KB Output is correct
10 Correct 25 ms 31648 KB Output is correct
11 Correct 31 ms 32620 KB Output is correct
12 Correct 32 ms 32620 KB Output is correct
13 Correct 30 ms 32620 KB Output is correct
14 Correct 30 ms 32620 KB Output is correct
15 Correct 30 ms 32620 KB Output is correct
16 Correct 914 ms 113516 KB Output is correct
17 Correct 932 ms 113516 KB Output is correct
18 Correct 911 ms 113516 KB Output is correct
19 Correct 908 ms 113644 KB Output is correct
20 Correct 919 ms 113516 KB Output is correct
21 Runtime error 516 ms 262148 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -