제출 #341321

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341321		blue	자동 인형 (IOI18_doll)	C++11	0 / 100	2 ms	332 KiB

doll

#include "doll.h"
#include <vector>
#include <iostream>
using namespace std;
//
// void answer(vector<int> C, vector<int> X, vector<int> Y)
// {
//     cout << C.size() << ' ' << X.size() << '\n';
//     for(int i = 0; i < C.size(); i++) cout << C[i] << '\n';
//     for(int i = 0; i < X.size(); i++) cout << X[i] << ' ' << Y[i] << '\n';
// }


void create_circuit(int num_triggers, vector<int> trigger_seq)
{
    vector<int> trigger_exit(num_triggers+1, -1);
    vector<int> switch_left_exit, switch_right_exit;

    trigger_exit[0] = trigger_seq[0];

    if(trigger_seq.size() == 1)
    {
        trigger_exit = vector<int>(num_triggers+1, 0);
        answer(trigger_exit, switch_left_exit, switch_right_exit);
        return;
    }

    trigger_exit[ trigger_seq[0] ] = -1; //unnecessary

    int last_row_pow;

    for(last_row_pow = 1; 2*(1 << last_row_pow) < trigger_seq.size(); last_row_pow++); //1<<p is the size of the last row of the binary tree
                                    //2*(1<<p) = 1<<(p+1) <= N < (1<<p+2)

    int last_row_size = (1 << last_row_pow);
    int tree_size = 2 * last_row_size - 1;

    switch_left_exit = vector<int>( tree_size , -1); //2*last_row_size because binary tree
    switch_right_exit = vector<int>( tree_size - 1 , -1);

    for(int i = 1; i <= last_row_size; i++)
    {
        switch_left_exit[i -1] = -2*i;
        switch_right_exit[i -1] = -(2*i + 1);
    }

    // cout << "0 " << C[0] << '\n';
    // for(int i = 1; i < (1 << (p+1)); i++) cout << i << ' ' << X[i-1] << ' ' << Y[i-1] << '\n';

    for(int i = tree_size + 1; i <= tree_size + 2*last_row_size; i++)
    {
        // cout << "switch = " << i << '\n';
        if(i - tree_size <= num_triggers)
        {
            if((i - tree_size) % 2 == 1) switch_left_exit[i/2 -1] = trigger_seq[i - tree_size];
            else switch_right_exit[i/2 -1] = trigger_seq[i - tree_size];
        }
        else if(i == (tree_size + 2*last_row_size))
        {
            switch_right_exit[i/2 -1] = 0;
        }
        else
        {
            if((i - tree_size) % 2 == 1) switch_left_exit[i/2 - 1] = -1;
            else switch_right_exit[i/2 - 1] = -1;
        }
    }

    answer(trigger_exit, switch_left_exit, switch_right_exit);
}

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

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:32:49: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(last_row_pow = 1; 2*(1 << last_row_pow) < trigger_seq.size(); last_row_pow++); //1<<p is the size of the last row of the binary tree
      |                           ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

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