oj.uz

Submission #856627

# Submission time Handle Problem Language Result Execution time Memory
856627 2023-10-04T06:55:58 Z LucaIlie Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 1 ms 628 KB 
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

string s0, s;
vector<int> ans;

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

    string s1 = s0;
    for ( int i = l; i <= r; i++ )
        s1[i] = '1';

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

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

void divide2( int l, int r, vector<int> v ) {
    if ( l > r )
        return;
    
    if ( l == r ) {
        ans[l] = v[0];
        return;
    }

    string s1 = s0;
    for ( int i: v )
        s1[i] = '1';

    int mid = (l + r) / 2;
    vector<int> leftt, rightt;
    for ( int i: v ) {
        s = s1;
        s[i] = '0';
        if ( check_element( s ) )
            leftt.push_back( i );
        else
            rightt.push_back( i );
    }

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

vector<int> restore_permutation( int n, int w, int r ) {
    ans.resize( n );
    for ( int i = 0; i < n; i++ )
        s0 += '0';
    vector<int> v;
    for ( int i = 0; i < n; i++ )
        v.push_back( i );

    divide1( 0, n - 1 );
    compile_set();
    divide2( 0, n - 1, v );

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

    return perm;
}

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 344 KB n = 8
5 Correct 0 ms 348 KB n = 8
6 Correct 0 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 348 KB n = 8
11 Correct 0 ms 344 KB n = 8
12 Correct 0 ms 344 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 344 KB n = 32
2 Correct 0 ms 348 KB n = 32
3 Correct 1 ms 348 KB n = 32
4 Correct 0 ms 348 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 1 ms 504 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 344 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 0 ms 348 KB n = 32
12 Correct 0 ms 348 KB n = 32
13 Correct 0 ms 348 KB n = 32
14 Correct 1 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 604 KB n = 128
4 Correct 1 ms 628 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 600 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
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB n = 128
2 Correct 1 ms 600 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 432 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 1 ms 600 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 432 KB n = 128