oj.uz

Submission #646542

# Submission time Handle Problem Language Result Execution time Memory
646542 2022-09-30T03:01:43 Z slime Mechanical Doll (IOI18_doll) C++14
74 / 100
 89 ms 10016 KB 
#include "doll.h"
#include "bits/stdc++.h"
using namespace std;

void create_circuit(int M, std::vector<int> A);

void answer(std::vector<int> C, std::vector<int> X, std::vector<int> Y);

int lg(int x) {
  return 32 - __builtin_clz(x) - 1;
}
vector<int> X, Y;

void create_circuit(int M, std::vector<int> A) {
  int N = A.size();
  vector<int> C(M + 1);
  for(int i=0; i<=M; i++) C[i] = 0;
  C[0] = A[0];
  vector<int> sequence;
  for(int i=0; i+1<N; i++) {
    sequence.push_back(A[i+1]);
    C[A[i]] = -1;
  }
  if(N % 2 == 0) sequence.push_back(-1);
  X.resize(N + lg(N));
  Y.resize(N + lg(N));
  int L = sequence.size();
  
  int bitcount = 1 + lg(L);
  int nxt = 0;
  int uwu = bitcount;
  for(int i=bitcount-1; i>=0; i--) {
    int val = (1 << i);
    Y[nxt] = (i == 0 ? 12073412 : nxt+1);
    // tree of size val: val - 1 swithces
    if(!(L & (1 << i))) X[nxt] = 0;
    else X[nxt] = uwu;
    nxt++;
    if(!(L & (1 << i))) continue;
    int seq = uwu + 1;
    for(int j=uwu; j<uwu+val/2-1; j++) {
      X[j] = seq;
      seq++;
      Y[j] = seq;
      seq++;
    }
    for(int j=uwu+val/2-1; j<uwu+val-1; j++) {
      X[j] = Y[j] = -1;
    }
    uwu += val - 1;
  }

  // Non-negative: switch
  // -1: to-be trigger
  // -2: origin

  int id = 0;
  int visits = 0;
  int state[N + lg(N)];
  for(int i=0; i<N+lg(N); i++) state[i] = 0;


  while(1) {
    int cur = 0;
    int prv;
    char u;
    bool done = 0;
    while(1) {
      //if(cur == 12073412) cout << "end\n";
      //else if(cur != -1) cout << -(cur + 1) << "\n";
      if(cur == -1) {
        if(u == 'X') X[prv] = -(sequence[id] + 1);
        else Y[prv] = -(sequence[id] + 1);
        //cout << sequence[id] << "\n";
        id++;
        break;
      }
      else if(cur == 12073412) {
        done = 1;
        break;
      }
      else if(state[cur] == 0) {
        state[cur] ^= 1;
        prv = cur;
        u = 'X';
        cur = X[cur];
      }
      else {
        state[cur] ^= 1;
        prv = cur;
        u = 'Y';
        cur = Y[cur];
      }
    }
    visits++;
    if(done) break;
  }


  for(int i=0; i<N+lg(N); i++) {
    if(X[i] == 12073412) X[i] = 0;
    else X[i] = -(X[i] + 1);
    if(Y[i] == 12073412) Y[i] = 0;
    else Y[i] = -(Y[i] + 1);
  }


  //for(int i=0; i<N+lg(N); i++) cout << state[i];
  //cout << "\n";

  answer(C, X, Y);
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 53 ms 6492 KB Output is correct
3 Correct 59 ms 6420 KB Output is correct
4 Correct 80 ms 9616 KB Output is correct

Subtask #6
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 53 ms 6492 KB Output is correct
3 Correct 59 ms 6420 KB Output is correct
4 Correct 80 ms 9616 KB Output is correct
5 Correct 89 ms 10016 KB Output is correct
6 Correct 85 ms 9760 KB Output is correct
7 Correct 87 ms 9896 KB Output is correct
8 Correct 82 ms 9668 KB Output is correct
9 Correct 52 ms 6456 KB Output is correct
10 Correct 83 ms 9760 KB Output is correct
11 Correct 84 ms 9708 KB Output is correct
12 Correct 53 ms 6488 KB Output is correct
13 Correct 54 ms 6468 KB Output is correct
14 Correct 55 ms 6568 KB Output is correct
15 Correct 56 ms 6680 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 52 ms 6424 KB Output is correct
18 Correct 53 ms 6484 KB Output is correct
19 Correct 53 ms 6420 KB Output is correct
20 Correct 84 ms 9636 KB Output is correct
21 Correct 84 ms 9620 KB Output is correct
22 Correct 82 ms 9664 KB Output is correct