oj.uz

Submission #880024

# Submission time Handle Problem Language Result Execution time Memory
880024 2023-11-28T15:18:37 Z StefanL2005 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

int N;
/*
void add_element(string s)
{
    cout<< "Added " << s << "\n";
}

void compile_set()
{
    cout<< "COMPILING SETS" << "\n";
}

bool check_element(string s)
{
    cout<< "Checking " << s << "\n"; 
    int ans; cin>> ans;
    return ans;
}
*/
void AddRecursive(int p1, int p2)
{
    string bit(N, '1');
    if (p2 - p1 == 1)
    {
        bit.replace(0, bit.length(), bit.length(), '1');
        bit[p1] = '0';
        add_element(bit);
        return;
    }

    bit.replace(p1, (p2 - p1 + 1), (p2 - p1 + 1), '0');

    int m = (p1 + p2) >> 1;
    for (int i = p1; i <= m; i++)
    {
        bit[i] = '1';
        add_element(bit);
        bit[i] = '0';
    }

    AddRecursive(p1, m);
    AddRecursive(m + 1, p2);
}

void CheckRecursive(int p1, int p2, vector<int> &CheckBit, vector<int> &result)
{
    string bit(N, '1');
    for (int i = 0; i < CheckBit.size(); i++)
        bit[CheckBit[i]] = '0';

    if (p2 - p1 == 1)
    {
        bit[CheckBit[0]] = '1';

        if (check_element(bit))
        {        
            result[CheckBit[1]] = p1;
            result[CheckBit[0]] = p2;
        }
        else
        {
            result[CheckBit[1]] = p2;
            result[CheckBit[0]] = p1;
        }
       return;
    }

    vector<int> BotHalf, TopHalf;

    for (int i = 0; i < CheckBit.size(); i++)
    {
        bit[CheckBit[i]] = '1';

        if (check_element(bit))
            BotHalf.push_back(CheckBit[i]);
        else
            TopHalf.push_back(CheckBit[i]);

       bit[CheckBit[i]] = '0';
    }
    
    int m = (p1 + p2) >> 1;

    CheckRecursive(p1, m, BotHalf, result);
    CheckRecursive(m + 1, p2, TopHalf, result);
}

vector<int> restore_permutation(int n, int w, int r)
{
    N = n;

    AddRecursive(0, n - 1);
    compile_set();

    vector<int> CheckBit(n);
    vector<int> result(n);
    for (int i = 0; i < n; i++)
        CheckBit[i] = i;
    
    CheckRecursive(0, n - 1, CheckBit, result);
    return result;
}
/*
int main()
{
    int n = 8, w = 0, r = 0;
    vector<int> v(100);

    vector<int> ans = restore_permutation(n, w, r);

    return 0;
}
*/

Compilation message

messy.cpp: In function 'void CheckRecursive(int, int, std::vector<int>&, std::vector<int>&)':
messy.cpp:52:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for (int i = 0; i < CheckBit.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~
messy.cpp:74:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for (int i = 0; i < CheckBit.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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