제출 #1227458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1227458		walizamanee	자동 인형 (IOI18_doll)	C++20	0 / 100	1096 ms	11860 KiB

doll

#include<bits/stdc++.h>
#include "doll.h"
using namespace std;
int trie[400001][2] , boss[400001] , here , n , lol;
vector<int> a;

void gettrie( int me , int pw ) {
  int ekhane = 1;
  for( int z = 0; z < pw ; z++ ) {
     if( ((me) & ( 1 << z )) >= 1 ) {
        if( trie[ekhane][1] == -1e8 ) {
          trie[ekhane][1] = (here);
          boss[here] = ekhane;
          here++;
        }
        ekhane = trie[ekhane][1];
     }
     else{
        if( trie[ekhane][0] == -1e8 ) {
          trie[ekhane][0] = (here);
          boss[here] = ekhane;
          here++;
        }
        ekhane = trie[ekhane][0];
     }
  }
  if( (me & ( 1 << pw )) > 0 ) {
       trie[ekhane][1] = (-1) * (a[me]);
  }
  else{
     if( (me | ( 1 << pw )) <= n ) {
        trie[ekhane][0] = (-1) * (a[me]);
     }
     else{
        here--;
        lol = boss[ekhane];
        if( trie[lol][0] == ekhane ) trie[lol][0] =  (-1) * (a[me]);
        else  trie[lol][1] =  (-1) * (a[me]);
     }
     
  }

}

void create_circuit(int M, vector<int> A) {
  a = A;
  //a.push_back(0);
  int two = 0;
  n = a.size();
  for( int z = 0; z <= 2 * n; z++ ) {
    trie[z][0] = -1e8;
    trie[z][1] = -1e8;
  }
  n;
  here = 2;
  while( (1 << two) <= n ) two++;
  for( int z = 1; z < ((1 << two) - n); z++ ) a.push_back(-1);
  a.push_back(0);
  n = (int)a.size() - 1;
  
  for( int z = 0; z <= n; z++ ) {
    //cerr << z << "\n";
     gettrie(z , two);
  }
  vector<int> c(M + 1);
   vector<int> x(here - 1), y(here - 1);
  for( int z = 0; z <= M; z++ ) c[z] = -1;
  for( int z = 1; z < here; z++ ) {
      if( trie[z][0] > -1e8 ) {
         x[z - 1] = (trie[z][0] * (-1));
        y[z - 1] = (trie[z][1] * (-1));
      }
   }
   for( int z = 1; z < here; z++ ) {
    cerr << trie[z][0] << " " << trie[z][1] << "\n";
   } 
   cerr << two << "\n";
   for( int z = 0; z < here - 1; z++ ) {
     cerr << x[z] << " " << y[z] << "\n";
   }
  answer(c, x, y);
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 18
• Subtask 6: 0 / 56