oj.uz

Submission #1041005

# Submission time Handle Problem Language Result Execution time Memory
1041005 2024-08-01T13:47:18 Z NeroZein Mechanical Doll (IOI18_doll) C++17
0 / 100
 1000 ms 348 KB 
#include "doll.h"
#include <bits/stdc++.h>

using namespace std; 

int idd; 
int n, m;
vector<int> a;
vector<int> state;
vector<int> c, x, y;

void build(int nd, int l, int r, int elements) {
  //cerr << "ND, l, r, elements: " << nd << ' ' << l << ' ' << r << ' ' << elements << endl; 
  assert(l != r); 
  int sz = 1; 
  while (sz * 2 <= elements) {
    sz *= 2; 
  }
  int mid = (l + r) >> 1;
  if (mid + 1 < r) {
    int rx = --idd; 
    x.push_back(0);
    y.push_back(0); 
    y[-nd - 1] = rx; 
    build(rx, mid + 1, r, sz);     
  }
  if (sz == elements) {
    x[-nd - 1] = -1;
  } else if (l < mid) {
    int lx = --idd; 
    x.push_back(0);
    y.push_back(0);
    x[-nd - 1] = lx;
    build(lx, l, mid, elements - sz); 
  }
}

void dfs(int v, int ptr) {
  //cerr << "V, ptr: " << v << ' ' << ptr << endl; 
  if (v == 0) {
    //assert(ptr == n);
    return; 
  }
  if (v > 0) {
    dfs(c[v], ptr + 1); 
  } else {
    if (state[-v - 1] == 0) {
      if (!x[-v - 1]) {
        x[-v - 1] = a[ptr]; 
      }
      state[-v - 1] ^= 1; 
      dfs(x[-v - 1], ptr); 
    } else {
      if (!y[-v - 1]) {
        y[-v - 1] = a[ptr];
      }
      state[-v - 1] ^= 1; 
      dfs(y[-v - 1], ptr); 
    }
  }
}

void create_circuit(int m_, vector<int> a_) {
  m = m_; 
  a = a_;
  a.push_back(0);
  n = (int) a.size();
  idd = -1; 
  x.push_back(0);
  y.push_back(0);
  int b = 1; 
  while (b < n) {
    b *= 2; 
  }
  build(-1, 0, b - 1, n);
  c.assign(m + 1, -1); 
  state.resize(-idd); 
  dfs(-1, 0);
  answer(c, x, y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1051 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1051 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1051 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1052 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -