oj.uz

Submission #62913

# Submission time Handle Problem Language Result Execution time Memory
62913 2018-07-30T20:04:46 Z Kubalionzzale Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 8 ms 6144 KB 
#include <vector>
#include <iostream>
#include <map>

#include "messy.h"

std::vector<int> ans;
std::string cur[100010] = { "" };
std::vector< std::vector<int> > ansing(100010);
std::map<int, int> mapa;

void insertion(int low, int high, std::string str, int pos)
{
    if (low == high)
        return;

    int mid = low + (high - low) / 2;
    for (int i = low; i <= mid; ++i)
    {
        str[i] = '1';
        add_element(str);
        str[i] = '0';
    }

    for (int i = mid + 1; i <= high; ++i)
    {
        str[i] = '1';
    }

    insertion(low, mid, str, pos * 2 + 1);

    for (int i = mid + 1; i <= high; ++i)
    {
        str[i] = '0';
    }

    str[low] = '1';
    insertion(mid + 1, high, str, pos * 2 + 2);
    str[low] = '0';

    cur[pos] = str;
}

void checking(int low, int high, std::string str, int pos)
{
    if (low == high)
    {
        ans[ansing[pos][0]] = low;
        mapa.insert(std::make_pair(low, ansing[pos][0]));
        return;
    }

    for (int i = 0; i < ansing[pos].size(); ++i)
    {
        int val = ansing[pos][i];

        str[val] = '1';
//        std::cout << str << " " << check_element(str) << " ";
        if (check_element(str))
        {
            ansing[pos * 2 + 1].push_back(val);
        }
        else
        {
            ansing[pos * 2 + 2].push_back(val);
        }

        str[val] = '0';
    }

  //  std::cout << "\n";

    std::string temp = str;

    for (int i = 0; i < ansing[pos * 2 + 2].size(); ++i)
    {
        int val = ansing[pos * 2 + 2][i];

        str[val] = '1';
    }

    int mid = low + (high - low) / 2;

    checking(low, mid, str, pos * 2 + 1);
    temp[mapa[low]] = '1';
    checking(mid + 1, high, temp, pos * 2 + 2);
}

std::vector<int> restore_permutation(int n, int w, int r) {

    std::string str = "";
    for (int i = 0; i < n; ++i)
    {
        str += "0";
        ans.push_back(0);
        ansing[0].push_back(i);
    }

    insertion(0, n - 1, str, 0);
    compile_set();
    checking(0, n - 1, str, 0);
    return ans;
}

Compilation message

messy.cpp: In function 'void checking(int, int, std::__cxx11::string, int)':
messy.cpp:53:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < ansing[pos].size(); ++i)
                     ~~^~~~~~~~~~~~~~~~~~~~
messy.cpp:75:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < ansing[pos * 2 + 2].size(); ++i)
                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5760 KB n = 8
2 Correct 6 ms 5760 KB n = 8
3 Correct 6 ms 5760 KB n = 8
4 Correct 6 ms 5760 KB n = 8
5 Correct 6 ms 5888 KB n = 8
6 Correct 7 ms 5888 KB n = 8
7 Correct 6 ms 5888 KB n = 8
8 Correct 7 ms 5760 KB n = 8
9 Correct 6 ms 5888 KB n = 8
10 Correct 6 ms 5888 KB n = 8
11 Correct 6 ms 5760 KB n = 8
12 Correct 6 ms 5888 KB n = 8
13 Correct 6 ms 5888 KB n = 8
14 Correct 7 ms 5888 KB n = 8
15 Correct 6 ms 5888 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5888 KB n = 32
2 Correct 7 ms 5888 KB n = 32
3 Correct 7 ms 5888 KB n = 32
4 Correct 6 ms 5888 KB n = 32
5 Correct 6 ms 5888 KB n = 32
6 Correct 6 ms 5888 KB n = 32
7 Correct 6 ms 5888 KB n = 32
8 Correct 6 ms 5888 KB n = 32
9 Correct 6 ms 5888 KB n = 32
10 Correct 6 ms 5888 KB n = 32
11 Correct 6 ms 5888 KB n = 32
12 Correct 6 ms 5888 KB n = 32
13 Correct 6 ms 5888 KB n = 32
14 Correct 6 ms 5888 KB n = 32
15 Correct 7 ms 5888 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5888 KB n = 32
2 Correct 6 ms 5888 KB n = 32
3 Correct 6 ms 5888 KB n = 32
4 Correct 6 ms 5888 KB n = 32
5 Correct 6 ms 5760 KB n = 32
6 Correct 7 ms 6016 KB n = 32
7 Correct 7 ms 5760 KB n = 32
8 Correct 6 ms 5888 KB n = 32
9 Correct 6 ms 5888 KB n = 32
10 Correct 6 ms 5888 KB n = 32
11 Correct 6 ms 5888 KB n = 32
12 Correct 6 ms 5888 KB n = 32
13 Correct 6 ms 5888 KB n = 32
14 Correct 6 ms 5888 KB n = 32
15 Correct 6 ms 5760 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6016 KB n = 128
2 Correct 8 ms 6016 KB n = 128
3 Correct 7 ms 6016 KB n = 128
4 Correct 7 ms 6016 KB n = 128
5 Correct 7 ms 6016 KB n = 128
6 Correct 7 ms 6016 KB n = 128
7 Correct 7 ms 6016 KB n = 128
8 Correct 8 ms 6016 KB n = 128
9 Correct 7 ms 6016 KB n = 128
10 Correct 7 ms 6016 KB n = 128
11 Correct 7 ms 6016 KB n = 128
12 Correct 8 ms 6016 KB n = 128
13 Correct 7 ms 6016 KB n = 128
14 Correct 8 ms 6016 KB n = 128
15 Correct 8 ms 6016 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6016 KB n = 128
2 Correct 8 ms 6016 KB n = 128
3 Correct 8 ms 6016 KB n = 128
4 Correct 7 ms 6016 KB n = 128
5 Correct 8 ms 6144 KB n = 128
6 Correct 8 ms 6016 KB n = 128
7 Correct 8 ms 6016 KB n = 128
8 Correct 8 ms 6016 KB n = 128
9 Correct 8 ms 6016 KB n = 128
10 Correct 8 ms 6016 KB n = 128
11 Correct 8 ms 6016 KB n = 128
12 Correct 8 ms 6016 KB n = 128
13 Correct 7 ms 6016 KB n = 128
14 Correct 7 ms 6016 KB n = 128
15 Correct 8 ms 6016 KB n = 128