oj.uz

답안 #756189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756189 2023-06-11T09:38:19 Z boris_mihov 자동 인형 (IOI18_doll) C++17
53 / 100
 700 ms 41168 KB 
#include "doll.h"
#include <algorithm>
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>

typedef long long llong;
const int MAXN = 1000000 + 10;
const int MAXS = 1000000 + 10;
const int INF  = 1e9;

int n, m, cnt;
std::vector <int> x, y, c;
std::vector <int> g[MAXN];
int perm[MAXN];
int treeRoot;

void rec(int l, int r, int node, int root)
{
    if (l + 1 == r)
    {
        if (perm[l] < g[node].size()) y[root - 1] = g[node][perm[l]];
        else y[root - 1] = -treeRoot;

        if (perm[r] < g[node].size()) x[root - 1] = g[node][perm[r]];
        else x[root - 1] = -treeRoot;
        return;
    }

    int mid = (l + r) / 2;
    x.push_back(0);
    x.push_back(0);
    y.push_back(0);
    y.push_back(0);
    cnt += 2;

    y[root - 1] = -(cnt - 1);
    x[root - 1] = -cnt;
    rec(l, mid, node, -y[root - 1]);
    rec(mid + 1, r, node, -x[root - 1]);
}

int reversed(int x, int bits)
{
    int res = 0;
    for (int i = 0 ; i < bits ; ++i)
    {
        if (x & (1 << i))
        {
            res |= (1 << bits - 1 - i);
        }
    }

    return res;
}

void create_circuit(int M, std::vector <int> A)
{
    m = M; n = A.size(); A.push_back(0);
    for (int i = 1 ; i <= n ; ++i)
    {   
        g[A[i - 1]].push_back(A[i]);
    }

    c.resize(m + 1); c[0] = A[0];
    for (int i = 1 ; i <= m ; ++i)
    {
        if (g[i].empty())
        {
            continue;
        }

        if (g[i].size() == 1)
        {
            c[i] = g[i][0];
        } else
        {
            int sz = 1, bits = 0;
            while (sz < g[i].size())
            {
                sz <<= 1;
                bits++;
            }

            c[i] = -(++cnt);
            x.push_back(0);
            y.push_back(0);
            std::reverse(g[i].begin(), g[i].end());
            std::iota(perm, perm + sz, 0);
            std::sort(perm, perm + sz, [&](int x, int y)
            {
                return reversed(x, bits) < reversed(y, bits);
            });

            treeRoot = cnt;
            rec(0, sz - 1, i, cnt);
        }
    }

    answer(c, x, y);
}

Compilation message

doll.cpp: In function 'void rec(int, int, int, int)':
doll.cpp:23:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         if (perm[l] < g[node].size()) y[root - 1] = g[node][perm[l]];
      |             ~~~~~~~~^~~~~~~~~~~~~~~~
doll.cpp:26:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         if (perm[r] < g[node].size()) x[root - 1] = g[node][perm[r]];
      |             ~~~~~~~~^~~~~~~~~~~~~~~~
doll.cpp: In function 'int reversed(int, int)':
doll.cpp:51:35: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   51 |             res |= (1 << bits - 1 - i);
      |                          ~~~~~~~~~^~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |             while (sz < g[i].size())
      |                    ~~~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23676 KB Output is correct
2 Correct 36 ms 27512 KB Output is correct
3 Correct 37 ms 27252 KB Output is correct
4 Correct 15 ms 23764 KB Output is correct
5 Correct 21 ms 24960 KB Output is correct
6 Correct 45 ms 29032 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23676 KB Output is correct
2 Correct 36 ms 27512 KB Output is correct
3 Correct 37 ms 27252 KB Output is correct
4 Correct 15 ms 23764 KB Output is correct
5 Correct 21 ms 24960 KB Output is correct
6 Correct 45 ms 29032 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 57 ms 29868 KB Output is correct
9 Correct 67 ms 30324 KB Output is correct
10 Correct 84 ms 33552 KB Output is correct
11 Correct 12 ms 23736 KB Output is correct
12 Correct 15 ms 23784 KB Output is correct
13 Correct 14 ms 23764 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23676 KB Output is correct
2 Correct 36 ms 27512 KB Output is correct
3 Correct 37 ms 27252 KB Output is correct
4 Correct 15 ms 23764 KB Output is correct
5 Correct 21 ms 24960 KB Output is correct
6 Correct 45 ms 29032 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 57 ms 29868 KB Output is correct
9 Correct 67 ms 30324 KB Output is correct
10 Correct 84 ms 33552 KB Output is correct
11 Correct 12 ms 23736 KB Output is correct
12 Correct 15 ms 23784 KB Output is correct
13 Correct 14 ms 23764 KB Output is correct
14 Correct 101 ms 35228 KB Output is correct
15 Correct 63 ms 29636 KB Output is correct
16 Correct 80 ms 32480 KB Output is correct
17 Correct 13 ms 23764 KB Output is correct
18 Correct 13 ms 23764 KB Output is correct
19 Correct 16 ms 23796 KB Output is correct
20 Correct 97 ms 33924 KB Output is correct
21 Correct 14 ms 23764 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 14 ms 23764 KB Output is partially correct
2 Correct 343 ms 30304 KB Output is correct
3 Partially correct 700 ms 32668 KB Output is partially correct
4 Partially correct 700 ms 35916 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 14 ms 23764 KB Output is partially correct
2 Correct 343 ms 30304 KB Output is correct
3 Partially correct 700 ms 32668 KB Output is partially correct
4 Partially correct 700 ms 35916 KB Output is partially correct
5 Partially correct 115 ms 38404 KB Output is partially correct
6 Partially correct 149 ms 39732 KB Output is partially correct
7 Partially correct 132 ms 39176 KB Output is partially correct
8 Partially correct 149 ms 40332 KB Output is partially correct
9 Partially correct 667 ms 34760 KB Output is partially correct
10 Partially correct 682 ms 40940 KB Output is partially correct
11 Partially correct 454 ms 41168 KB Output is partially correct
12 Partially correct 308 ms 34680 KB Output is partially correct
13 Partially correct 94 ms 33216 KB Output is partially correct
14 Partially correct 93 ms 32976 KB Output is partially correct
15 Partially correct 78 ms 32616 KB Output is partially correct
16 Partially correct 15 ms 24092 KB Output is partially correct
17 Partially correct 188 ms 32116 KB Output is partially correct
18 Partially correct 238 ms 31956 KB Output is partially correct
19 Partially correct 255 ms 33176 KB Output is partially correct
20 Partially correct 211 ms 36420 KB Output is partially correct
21 Partially correct 422 ms 38732 KB Output is partially correct
22 Partially correct 235 ms 35680 KB Output is partially correct