oj.uz

답안 #740470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
740470 2023-05-12T14:04:27 Z danikoynov 자동 인형 (IOI18_doll) C++14
53 / 100
 158 ms 33028 KB 
#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 << 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();
        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);
            ///cout << v << " :: " << lf_path << " : " << rf_path << endl;
            if (lf_path > offset)
                x.push_back(g[v][lf_path - offset - 1]);
            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[A[i - 1]].push_back(A[i]);
    }
    g[A.back()].push_back(0);
    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);
}

Compilation message

doll.cpp: In function 'void create_node(int)':
doll.cpp:27:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   27 |     if (g[v].size() == 0)
      |     ^~
doll.cpp:30:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   30 |         if (g[v].size() == 1)
      |         ^~
doll.cpp:36:19: 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:31: 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:74:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<state>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for (int i = 0; i < gen.size(); i ++)
      |                         ~~^~~~~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:96:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |     for (int i = 1; i < A.size(); i ++)
      |                     ~~^~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 28 ms 8952 KB Output is correct
3 Correct 23 ms 8560 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 12 ms 6100 KB Output is correct
6 Correct 34 ms 10260 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 28 ms 8952 KB Output is correct
3 Correct 23 ms 8560 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 12 ms 6100 KB Output is correct
6 Correct 34 ms 10260 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 51 ms 10816 KB Output is correct
9 Correct 50 ms 11956 KB Output is correct
10 Correct 89 ms 14836 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 3 ms 4912 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 28 ms 8952 KB Output is correct
3 Correct 23 ms 8560 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 12 ms 6100 KB Output is correct
6 Correct 34 ms 10260 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 51 ms 10816 KB Output is correct
9 Correct 50 ms 11956 KB Output is correct
10 Correct 89 ms 14836 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 3 ms 4912 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 97 ms 16392 KB Output is correct
15 Correct 56 ms 10216 KB Output is correct
16 Correct 86 ms 12816 KB Output is correct
17 Correct 3 ms 4892 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4928 KB Output is correct
20 Correct 88 ms 14444 KB Output is correct
21 Correct 3 ms 4952 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 3 ms 5000 KB Output is partially correct
2 Correct 60 ms 19460 KB Output is correct
3 Partially correct 101 ms 31492 KB Output is partially correct
4 Partially correct 122 ms 33028 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 3 ms 5000 KB Output is partially correct
2 Correct 60 ms 19460 KB Output is correct
3 Partially correct 101 ms 31492 KB Output is partially correct
4 Partially correct 122 ms 33028 KB Output is partially correct
5 Partially correct 121 ms 18496 KB Output is partially correct
6 Partially correct 148 ms 19652 KB Output is partially correct
7 Partially correct 128 ms 19276 KB Output is partially correct
8 Partially correct 158 ms 20264 KB Output is partially correct
9 Partially correct 97 ms 21028 KB Output is partially correct
10 Partially correct 147 ms 24044 KB Output is partially correct
11 Partially correct 151 ms 20800 KB Output is partially correct
12 Partially correct 107 ms 15360 KB Output is partially correct
13 Partially correct 89 ms 14468 KB Output is partially correct
14 Partially correct 87 ms 14172 KB Output is partially correct
15 Partially correct 80 ms 13716 KB Output is partially correct
16 Partially correct 5 ms 5256 KB Output is partially correct
17 Partially correct 84 ms 13192 KB Output is partially correct
18 Partially correct 79 ms 13260 KB Output is partially correct
19 Partially correct 94 ms 13724 KB Output is partially correct
20 Partially correct 109 ms 16396 KB Output is partially correct
21 Partially correct 136 ms 18652 KB Output is partially correct
22 Partially correct 108 ms 15680 KB Output is partially correct