제출 #594273

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594273		Soumya1	자동 인형 (IOI18_doll)	C++17	100 / 100	132 ms	23060 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
#ifdef __LOCAL__
  #include <debug_local.h>
#endif
using namespace std;
const int mxN = 1e6 + 5;
int l[mxN], r[mxN], name[mxN];
int X[mxN], Y[mxN], state[mxN];
int cur = 1, take;
vector<int> ord;
void build(int x, int lx, int rx) {
  if (lx == rx) return;
  l[x] = 2 * x;
  r[x] = 2 * x + 1;
  int mx = (lx + rx) >> 1;
  build(2 * x, lx, mx);
  build(2 * x + 1, mx + 1, rx);
}
int compress(int x) {
  if (!l[x]) {
    take--;
    return 1e9;
  }
  int rr = compress(r[x]);
  int ll = -1;
  if (take) ll = compress(l[x]);
  name[x] = cur++;
  X[name[x]] = ll, Y[name[x]] = rr;
  return name[x];
}
void find_leaf(int x, int par = 0) {
  if (x == -1) {
    return;
  }
  if (x == 1e9) {
    ord.push_back(par);
    return;
  }
  if (state[x]) find_leaf(Y[x], x);
  else find_leaf(X[x], x);
  state[x] ^= 1;
}
void create_circuit(int m, vector<int> A) {
  vector<int> c(m + 1);
  c[0] = A[0];
  if (A.size() == 1) {
    answer(c, {}, {});
    return;
  }
  vector<int> ad[m + 1];
  A.push_back(0);
  for (int i = 0; i + 1 < A.size(); i++) {
    ad[A[i]].push_back(A[i + 1]);
  }
  int need = 0;
  for (int i = 1; i <= m; i++) {
    need += ad[i].size();
  }
  int x = 1;
  while (x < need) x *= 2;
  build(1, 1, x);
  take = need;
  compress(1);
  while (ord.size() < need) {
    find_leaf(name[1]);
  }
  for (int i = 1; i < cur; i++) {
    if (X[i] == -1) X[i] = -name[1];
    else X[i] *= -1;
    Y[i] *= -1;
  }
  for (int i = 0; i < ord.size(); i++) {
    if (i + 1 < A.size() - 1) {
      if (X[ord[i]] == -1e9) X[ord[i]] = A[i + 1];
      else Y[ord[i]] = A[i + 1];
    } else if (i + 1 < ord.size()) {
      if (X[ord[i]] == -1e9) X[ord[i]] = -name[1];
      else Y[ord[i]] = -name[1];
    } else {
      Y[ord[i]] = 0;
    }
  }
  for (int i = 1; i < c.size(); i++) c[i] = -name[1];
  vector<int> retx(cur - 1), rety(cur - 1);
  for (int i = 1; i < cur; i++) {
    retx[i - 1] = X[i];
    rety[i - 1] = Y[i];
  }
  answer(c, retx, rety);
}

컴파일 시 표준 에러 (stderr) 메시지

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:53:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for (int i = 0; i + 1 < A.size(); i++) {
      |                   ~~~~~~^~~~~~~~~~
doll.cpp:65:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |   while (ord.size() < need) {
      |          ~~~~~~~~~~~^~~~~~
doll.cpp:73:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |   for (int i = 0; i < ord.size(); i++) {
      |                   ~~^~~~~~~~~~~~
doll.cpp:74:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     if (i + 1 < A.size() - 1) {
      |         ~~~~~~^~~~~~~~~~~~~~
doll.cpp:77:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     } else if (i + 1 < ord.size()) {
      |                ~~~~~~^~~~~~~~~~~~
doll.cpp:84:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   for (int i = 1; i < c.size(); i++) c[i] = -name[1];
      |                   ~~^~~~~~~~~~

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