oj.uz

Submission #856403

# Submission time Handle Problem Language Result Execution time Memory
856403 2023-10-03T11:59:17 Z LucaIlie Unscrambling a Messy Bug (IOI16_messy) C++17
70 / 100
 1 ms 604 KB 
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

string s0, s1, s;
vector<int> ans;

void divide1( int l, int r, int x ) {
    if ( l > r )
        return;

    int mid = (l + r) / 2;
    for ( int i = l; i <= mid; i++ ) {
        s = s0;
        s[x] = s[mid] = s[i] = '1';
        add_element( s );
    }

    divide1( l, mid - 1, mid );
    divide1( mid + 1, r, mid );
}

void divide2( int l, int r, int x, vector<int> v ) {
    if ( l > r )
        return;

    /*printf( "%d %d\n", l, r );
    for ( int i: v )
        cout << i << " ";
    printf( "\n" );*/

    if ( l == r ) {
        ans[l] = v[0];
        return;
    }

    int mid = (l + r) / 2;

    int p = -1;
    for ( int i: v ) {
        s = s0;
        s[x] = s[i] = '1';
        if ( p == -1 && check_element( s ) )
            p = i;
    }
    ans[mid] = p;
    //printf( "%d\n", p );

    vector<int> leftt, rightt;
    for ( int i: v ) {
        if ( i == p )
            continue;

        s = s0;
        s[x] = s[p] = s[i] = '1';
        if ( leftt.size() < mid - l && check_element( s ) )
            leftt.push_back( i );
        else
            rightt.push_back( i );
    }

    divide2( l, mid - 1, p, leftt );
    divide2( mid + 1, r, p, rightt );
}

vector<int> restore_permutation( int n, int w, int r ) {
    ans.resize( n );
    s0 = s1 = "";
    for ( int i = 0; i < n; i++ ) {
        s0 += '0';
        s1 += '1';
    }

    int mid = (0 + n - 1) / 2;
    divide1( 0, mid - 1, mid );
    divide1( mid + 1, n - 1, mid );
    for ( int i = 0; i < mid; i++ ) {
        s = s1;
        s[i] = '0';
        add_element( s );
    }
    s = s0;
    s[mid] = '1';
    add_element( s );
    compile_set();

    int p;
    vector<int> leftt, rightt;
    for ( int i = 0; i < n; i++ ) {
        s = s0;
        s[i] = '1';
        if ( check_element( s ) ) {
            p = i;
            continue;
        }

        s = s1;
        s[i] = '0';
        if ( check_element( s ) )
            leftt.push_back( i );
        else
            rightt.push_back( i );
    }
    divide2( 0, mid - 1, p, leftt );
    ans[mid] = p;
    divide2( mid + 1, n - 1, p, rightt );

    vector<int> perm( n );
    for ( int i = 0; i < n; i++ )
        perm[ans[i]] = i;

    return perm;
}

Compilation message

messy.cpp: In function 'void divide2(int, int, int, std::vector<int>)':
messy.cpp:57:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |         if ( leftt.size() < mid - l && check_element( s ) )
      |              ~~~~~~~~~~~~~^~~~~~~~~
messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:107:12: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
  107 |     divide2( mid + 1, n - 1, p, rightt );
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 344 KB n = 8
4 Correct 0 ms 348 KB n = 8
5 Correct 0 ms 348 KB n = 8
6 Correct 0 ms 344 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 348 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 0 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 1 ms 348 KB n = 32
13 Correct 0 ms 348 KB n = 32
14 Correct 0 ms 348 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 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 1 ms 348 KB n = 32
11 Correct 1 ms 348 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 1 ms 348 KB n = 32
14 Correct 0 ms 348 KB n = 32
15 Correct 1 ms 348 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 604 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 1 ms 416 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 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 604 KB n = 128

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 604 KB grader returned WA
2 Halted 0 ms 0 KB -