제출 #740589

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
740589		danikoynov	자동 인형 (IOI18_doll)	C++14	37 / 100	362 ms	32080 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 2e5 + 10;

int n, m;
vector < int > g[maxn];
vector < int > c, x, y;

struct state
{
    int dev, lf_child, rf_child;
    vector < int > fin;

    state()
    {
        dev = 0;
        lf_child = rf_child = -1;
        fin.clear();
    }
};

void create_node(int v)
{
    if (g[v].size() == 0)
        return;

    if (g[v].size() == 1)
    {
        c[v] = g[v][0];
        return;
    }
    int nec = 2, st = 0;
    while(nec < g[v].size())
        nec *= 2, st ++;
    ///cout << g[v].size() << " " << nec << " : " << st << endl;
    vector < state > gen;
    int sz = x.size();
    state it;
    it.dev = ++ sz;
    c[v] = -it.dev;
    it.fin.push_back(1);
    gen.push_back(it);
    for (int step = 0; step < st; step ++)
    {
        vector < state > new_gen;
        for (int i = 0; i < gen.size(); i ++)
        {
            state new_state;
            new_state.dev = ++ sz;
            gen[i].lf_child = - new_state.dev;
            for (int cur : gen[i].fin)
                new_state.fin.push_back(cur);
            new_gen.push_back(new_state);
            new_state = state();

            new_state.dev = ++ sz;
            gen[i].rf_child = - new_state.dev;
            for (int cur : gen[i].fin)
                new_state.fin.push_back(cur + (1 << step));
            new_gen.push_back(new_state);
        }
        for (state cur : gen)
        {
            x.push_back(cur.lf_child);
            y.push_back(cur.rf_child);
        }
        gen = new_gen;
    }
    ///cout << "fine" << endl;
    int offset = gen.size() * 2 - g[v].size();
    int to = 0;

    vector < int > vec;
    for (int i = gen.size() - 1; i >= 0; i --)
    {
int lf_path = gen[i].fin[0], rf_path = gen[i].fin[0] + (1 << st);
if (vec.size() < g[v].size())
    vec.push_back(rf_path);
if (vec.size() < g[v].size())
    vec.push_back(lf_path);
    }

    sort(vec.begin(), vec.end());
    map < int, int > mp;
    for (int i = 0; i < vec.size(); i ++)
    {
        mp[vec[i]] = i + 1;
    }
    for (int i = 0; i < gen.size(); i ++)
    {
        ///cout << gen[i].fin.size() << endl;
        int lf_path = gen[i].fin[0], rf_path = gen[i].fin[0] + (1 << st);
        if (mp[lf_path] == 0)
            x.push_back(-it.dev);
        else
            x.push_back(g[v][mp[lf_path] - 1]);
        if (mp[rf_path] == 0)
            y.push_back(-it.dev);
        else
            y.push_back(g[v][mp[rf_path] - 1]);


        ///cout << v << " :: " << lf_path << " : " << rf_path << endl;
        /**if (to < g[v].size())
            x.push_back(g[v][to] ++);
        else
            x.push_back(- it.dev);
        if (rf_path > offset)
            y.push_back(g[v][rf_path - offset - 1]);
        else
            y.push_back(-it.dev);*/
    }
}
void create_circuit(int M, vector<int> A)
{
    n = A.size();
    m = M;

    c.resize(m + 1);
    g[0].push_back(A[0]);
    for (int i = 1; i < A.size(); i ++)
    {
        g[0].push_back(A[i]);
    }
    g[0].push_back(0);
    create_node(0);
    for (int i = 0; i <= m; i ++)
        c[i] = -1;
    /**for (int i = 0; i <= m; i ++)
    {
        create_node(i);
        continue;

    }*/
    /**for (int i = 0; i <= m; i ++)
        cout << c[i] << " ";
    cout << endl;
    for (int i = 0; i < x.size(); i ++)
        cout << x[i] << " " << y[i] << endl;*/
    answer(c, x, y);
}

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

doll.cpp: In function 'void create_node(int)':
doll.cpp:36:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     while(nec < g[v].size())
      |           ~~~~^~~~~~~~~~~~~
doll.cpp:49:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<state>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (int i = 0; i < gen.size(); i ++)
      |                         ~~^~~~~~~~~~~~
doll.cpp:88:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for (int i = 0; i < vec.size(); i ++)
      |                     ~~^~~~~~~~~~~~
doll.cpp:92:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<state>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     for (int i = 0; i < gen.size(); i ++)
      |                     ~~^~~~~~~~~~~~
doll.cpp:73:9: warning: unused variable 'offset' [-Wunused-variable]
   73 |     int offset = gen.size() * 2 - g[v].size();
      |         ^~~~~~
doll.cpp:74:9: warning: unused variable 'to' [-Wunused-variable]
   74 |     int to = 0;
      |         ^~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:124:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |     for (int i = 1; i < A.size(); i ++)
      |                     ~~^~~~~~~~~~

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