oj.uz

답안 #1069262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069262 2024-08-21T18:26:31 Z andrei_iorgulescu 자동 인형 (IOI18_doll) C++14
71.553 / 100
 1000 ms 15124 KB 
#include <bits/stdc++.h>
#include "doll.h"
#warning That's not FB, that's my FB

using namespace std;

int n,m;
vector<int> a;
vector<vector<int>> pos;
vector<int> unde;
int cur = 1;

vector<int> c, x, y;

int ngl, kgl, pgl;

void build(int nume, int l, int r)
{
    int mij = (l + r) / 2;
    if (mij <= pgl)
        x[-nume - 1] = c[ngl];
    else
    {
        if (l != mij)
        {
            x[-nume - 1] = -cur;
            cur++;
            x.push_back(0);
            y.push_back(0);
            build(x[-nume - 1], l, mij);
        }
        else
        {
            //int pz = pos[ngl][unde[ngl]] + 1;
            //unde[ngl]++;
            x[-nume - 1] = 2 * n + ngl;
        }
    }
    if (mij + 1 != r)
    {
        y[-nume - 1] = -cur;
        cur++;
        x.push_back(0);
        y.push_back(0);
        build(y[-nume - 1], mij + 1, r);
    }
    else
    {
        //int pz = pos[ngl][unde[ngl]] + 1;
        //unde[ngl]++;
        y[-nume - 1] = 2 * n + ngl;
    }
}

void build_sgt(int nod)
{
    c[nod] = -cur;
    cur++;
    x.push_back(0);
    y.push_back(0);
    ngl = nod;
    kgl = __lg(pos[nod].size());
    if ((1 << kgl) < pos[nod].size())
        kgl++;
    pgl = (1 << kgl) - (int)pos[nod].size();
    build(c[nod], 1, (1 << kgl));
}

int cr = 1;
vector<int> how;

void gogo(int nod)
{
    if (nod == 0)
        return;
    if (nod >= 1)
    {
        gogo(c[nod]);
        return;
    }
    if (how[-nod - 1] == 0)
    {
        how[-nod - 1] = 1;
        if (x[-nod - 1] > 2 * n)
        {
            x[-nod - 1] = a[cr];
            cr++;
        }
        gogo(x[-nod - 1]);
    }
    else
    {
        how[-nod - 1] = 0;
        if (y[-nod - 1] > 2 * n)
        {
            y[-nod - 1] = a[cr];
            cr++;
        }
        gogo(y[-nod - 1]);
    }
}

void create_circuit(int M, vector<int> A)
{
    n = A.size();
    a = A;
    m = M;
    pos.resize(m + 1);
    unde.resize(m + 1);
    for (int i = 0; i < a.size(); i++)
        pos[a[i]].push_back(i);
    a.push_back(0);
    c.resize(m + 1);
    c[0] = a[0];
    for (int i = 1; i <= m; i++)
    {
        if (pos[i].empty())
            c[i] = 0;
        else if (pos[i].size() == 1)
            c[i] = a[pos[i][0] + 1];
        else
            build_sgt(i);
    }
    /*for (auto it : c)
        cout << it << ' ';
    cout << endl;
    for (auto it : x)
        cout << it << ' ';
    cout << endl;
    for (auto it : y)
        cout << it << ' ';
    cout << endl;*/
    how.resize(cur - 1);
    gogo(a[0]);
    answer(c, x, y);
}

Compilation message

doll.cpp:3:2: warning: #warning That's not FB, that's my FB [-Wcpp]
    3 | #warning That's not FB, that's my FB
      |  ^~~~~~~
doll.cpp: In function 'void build_sgt(int)':
doll.cpp:63:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     if ((1 << kgl) < pos[nod].size())
      |         ~~~~~~~~~~~^~~~~~~~~~~~~~~~~
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:110:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     for (int i = 0; i < a.size(); i++)
      |                     ~~^~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 22 ms 7180 KB Output is correct
3 Correct 14 ms 5968 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 22 ms 8756 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 22 ms 7180 KB Output is correct
3 Correct 14 ms 5968 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 22 ms 8756 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Execution timed out 1079 ms 6840 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 22 ms 7180 KB Output is correct
3 Correct 14 ms 5968 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 6 ms 4188 KB Output is correct
6 Correct 22 ms 8756 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Execution timed out 1079 ms 6840 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 52 ms 7112 KB Output is correct
3 Correct 53 ms 6632 KB Output is correct
4 Correct 79 ms 10148 KB Output is correct

Subtask #6
41.5530038336 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 52 ms 7112 KB Output is correct
3 Correct 53 ms 6632 KB Output is correct
4 Correct 79 ms 10148 KB Output is correct
5 Partially correct 61 ms 14044 KB Output is partially correct
6 Partially correct 69 ms 14776 KB Output is partially correct
7 Partially correct 70 ms 15124 KB Output is partially correct
8 Partially correct 61 ms 13784 KB Output is partially correct
9 Partially correct 52 ms 7468 KB Output is partially correct
10 Partially correct 73 ms 12304 KB Output is partially correct
11 Partially correct 74 ms 11840 KB Output is partially correct
12 Partially correct 47 ms 8272 KB Output is partially correct
13 Partially correct 41 ms 9488 KB Output is partially correct
14 Partially correct 40 ms 9876 KB Output is partially correct
15 Partially correct 39 ms 10144 KB Output is partially correct
16 Partially correct 1 ms 604 KB Output is partially correct
17 Partially correct 38 ms 7628 KB Output is partially correct
18 Partially correct 39 ms 8312 KB Output is partially correct
19 Partially correct 41 ms 7572 KB Output is partially correct
20 Partially correct 61 ms 12008 KB Output is partially correct
21 Partially correct 63 ms 11332 KB Output is partially correct
22 Partially correct 56 ms 11336 KB Output is partially correct