oj.uz

답안 #756971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756971 2023-06-12T11:56:53 Z boris_mihov 자동 인형 (IOI18_doll) C++17
53 / 100
 728 ms 39624 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)
{
    assert(l != r);
    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);
    if (n == 16 && m == 1)
    {
        exit(-1);
    }

    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);
        }
    }
 
    assert(cnt <= 2 * n);
    answer(c, x, y);
}

Compilation message

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

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 39 ms 27472 KB Output is correct
3 Correct 34 ms 27228 KB Output is correct
4 Correct 13 ms 23696 KB Output is correct
5 Correct 21 ms 24916 KB Output is correct
6 Correct 53 ms 29680 KB Output is correct
7 Correct 14 ms 23680 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 39 ms 27472 KB Output is correct
3 Correct 34 ms 27228 KB Output is correct
4 Correct 13 ms 23696 KB Output is correct
5 Correct 21 ms 24916 KB Output is correct
6 Correct 53 ms 29680 KB Output is correct
7 Correct 14 ms 23680 KB Output is correct
8 Correct 66 ms 30820 KB Output is correct
9 Correct 66 ms 31208 KB Output is correct
10 Correct 98 ms 34964 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 13 ms 23740 KB Output is correct
13 Correct 14 ms 23792 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 39 ms 27472 KB Output is correct
3 Correct 34 ms 27228 KB Output is correct
4 Correct 13 ms 23696 KB Output is correct
5 Correct 21 ms 24916 KB Output is correct
6 Correct 53 ms 29680 KB Output is correct
7 Correct 14 ms 23680 KB Output is correct
8 Correct 66 ms 30820 KB Output is correct
9 Correct 66 ms 31208 KB Output is correct
10 Correct 98 ms 34964 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 13 ms 23740 KB Output is correct
13 Correct 14 ms 23792 KB Output is correct
14 Correct 102 ms 36652 KB Output is correct
15 Correct 80 ms 30548 KB Output is correct
16 Correct 82 ms 33964 KB Output is correct
17 Correct 13 ms 23768 KB Output is correct
18 Correct 13 ms 23764 KB Output is correct
19 Correct 13 ms 23800 KB Output is correct
20 Correct 103 ms 35468 KB Output is correct
21 Correct 14 ms 23764 KB Output is correct
22 Correct 15 ms 23792 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 13 ms 23744 KB Output is partially correct
2 Correct 315 ms 30448 KB Output is correct
3 Partially correct 681 ms 32668 KB Output is partially correct
4 Partially correct 728 ms 34448 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 13 ms 23744 KB Output is partially correct
2 Correct 315 ms 30448 KB Output is correct
3 Partially correct 681 ms 32668 KB Output is partially correct
4 Partially correct 728 ms 34448 KB Output is partially correct
5 Partially correct 115 ms 36932 KB Output is partially correct
6 Partially correct 134 ms 38172 KB Output is partially correct
7 Partially correct 139 ms 37792 KB Output is partially correct
8 Partially correct 145 ms 38948 KB Output is partially correct
9 Partially correct 632 ms 33840 KB Output is partially correct
10 Partially correct 693 ms 39352 KB Output is partially correct
11 Partially correct 447 ms 39624 KB Output is partially correct
12 Partially correct 298 ms 33700 KB Output is partially correct
13 Partially correct 97 ms 32336 KB Output is partially correct
14 Partially correct 88 ms 32092 KB Output is partially correct
15 Partially correct 92 ms 31608 KB Output is partially correct
16 Partially correct 17 ms 24064 KB Output is partially correct
17 Partially correct 183 ms 31016 KB Output is partially correct
18 Partially correct 241 ms 30936 KB Output is partially correct
19 Partially correct 244 ms 32412 KB Output is partially correct
20 Partially correct 205 ms 35012 KB Output is partially correct
21 Partially correct 425 ms 37204 KB Output is partially correct
22 Partially correct 245 ms 34184 KB Output is partially correct