제출 #541161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
541161		MilosMilutinovic	자동 인형 (IOI18_doll)	C++14	6 / 100	122 ms	10980 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

void create_circuit(int m, vector<int> a) {
  int n = a.size();       
  vector<vector<int>> nxt(m + 1);
  for (int i = 0; i + 1 < n; i++) {
    nxt[a[i]].push_back(a[i + 1]);
  }
  nxt[0].push_back(a[0]);
  nxt[a.back()].push_back(0);
  vector<int> ans(m + 1);
  vector<int> x;
  vector<int> y;
  int idx = 0;
  for (int i = 0; i <= m; i++) {
    if (nxt[i].empty()) {
      ans[i] = 0;
      continue;
    }
    if (nxt[i].size() == 1) {
      ans[i] = nxt[i][0];
      continue;
    }
    vector<int> vec = nxt[i];
    int pw = 1;
    while (pw < (int) vec.size()) pw *= 2;
    //reverse(vec.begin(), vec.end());
    //while ((int) vec.size() % 2 == 1) vec.push_back(-1);
    //reverse(vec.begin(), vec.end());
    vector<int> order(vec.size());
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&](int i, int j) {
      int ni = 0, nj = 0;
      for (int b = 0; b < 30; b++) {
        if (i >> b & 1) {
          ni += (1 << (30 - b));
        }
        if (j >> b & 1) {
          nj += (1 << (30 - b));
        }
      }
      return ni < nj;
    });
    auto tmp = vec;
    for (int i = 0; i < tmp.size(); i++) {
      vec[i] = tmp[order[i]];
    }
    while (vec.size() < pw) vec.push_back(-1);
    vector<int> pref(pw);
    for (int i = 0; i < pw; i++) {
      if (i > 0) {
        pref[i] = pref[i - 1];
      }
      pref[i] += (vec[i] != -1 ? 1 : 0);
    }
    auto Get = [&](int L, int R) {
      int sum = pref[R];
      if (L > 0) {
        sum -= pref[L - 1];
      }
      return sum;
    };
    --idx;
    ans[i] = idx;  
    vector<pair<int, int>> que;
    que.push_back({0, pw - 1});
    for (int b = 0; b < (int) que.size(); b++) {
      int l = que[b].first;
      int r = que[b].second;
      if (l + 1 == r) {
        x.push_back(vec[l] == -1 ? ans[i] : vec[l]);
        y.push_back(vec[r] == -1 ? ans[i] : vec[r]);
        continue;
      }
      int mid = l + r >> 1;
      {
        if (Get(l, mid) != 0) {
          --idx;
          x.push_back(idx);
          que.push_back({l, mid});
        } else {
          x.push_back(ans[i]);
        }
      }
      {
        if (Get(mid + 1, r) != 0) {
          --idx;
          y.push_back(idx);
          que.push_back({mid + 1, r});
        } else {
          y.push_back(ans[i]);
        }
      }
    }
  } 
  answer(ans, x, y);
}

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

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 0; i < tmp.size(); i++) {
      |                     ~~^~~~~~~~~~~~
doll.cpp:51:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |     while (vec.size() < pw) vec.push_back(-1);
      |            ~~~~~~~~~~~^~~~
doll.cpp:78:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   78 |       int mid = l + r >> 1;
      |                 ~~^~~

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