제출 #1186157

#제출 시각아이디문제언어결과실행 시간메모리
1186157hamzabc자동 인형 (IOI18_doll)C++20
85.55 / 100
51 ms11944 KiB
#include "doll.h"
#include <bits/stdc++.h>


using namespace std;
#define all(x) x.begin(), x.end()
#define sp << " " <<
vector<vector<int>> goes;
vector<int> X, Y;
vector<array<int, 3>> dvm;


void wire(int num, int l, int r, int ret = -1, int retto = 0, int repeattime = 1, int layer = 0, int number = 0){
  bool finalise = false;
  if (ret == -1){
    finalise = true;
    int loog = __lg(r - l + 1);
    if (r - l + 1 == (1 << loog)){
      repeattime = (1 << loog);
      ret = 0;
    }else{
      repeattime = (1 << loog) * 2;
      retto = -X.size();
      ret = repeattime - r + l - 1;
    }
  }
  int swc = X.size() - 1;
  bool backed = false;
  if (ret >= repeattime / 2){
    backed = true;
    ret -= repeattime / 2;
    X[swc] = retto;
  }else{
    if (repeattime == 2){
      // X[swc] = goes[num][number - min(standart, (number + 1) / 2)];
      dvm.push_back({ number, swc, 1 });
    }else{
      X[swc] = -X.size() - 1;
      X.push_back(0);
      Y.push_back(0);
      wire(num, l, r - repeattime / 2, ret, retto, repeattime / 2, layer + 1, number);
    }
  }
  if (repeattime == 2){
    number += (1 << layer);
    dvm.push_back({ number, swc, 0 });
    // Y[swc] = goes[num][number - min(standart, (number + 1) / 2)];
  }else{
    Y[swc] = -X.size() - 1;
    X.push_back(0);
    Y.push_back(0);
    if (backed){
      wire(num, r - repeattime / 2 + 1, r, ret, retto, repeattime / 2, layer + 1, number + (1 << layer));
    }else{
      wire(num, r - repeattime / 2 + 1, r, 0, 0, repeattime / 2, layer + 1, number + (1 << layer));
    }
  }
  if (finalise){
    sort(all(dvm));
    int j = 0;
    for (auto i : dvm){
      if (i[2]){
        X[i[1]] = goes[num][j];
      }else{
        Y[i[1]] = goes[num][j];
      }
      j++;
    }
    dvm.clear();
  }
}


void create_circuit(int M, vector<int> A) {
  int N = A.size();
  vector<int> Ret(M + 1);
  goes.resize(M + 1);
  goes[0].push_back(A[0]);
  for (int i = 0; i < N; i++){
    if (i == N - 1){
      goes[A[i]].push_back(0);
    }else{
      goes[A[i]].push_back(A[i + 1]);
    }
  }
  for (int i = 0; i <= M; i++){
    if (goes[i].size() < 2){
      if (goes[i].size())
        Ret[i] = goes[i][0];
    }else{
      X.push_back(0);
      Y.push_back(0);
      Ret[i] = -X.size();
      wire(i, 0, goes[i].size() - 1);
    }
  }
  answer(Ret, X, Y);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...