oj.uz

Submission #32048

# Submission time Handle Problem Language Result Execution time Memory
32048 2017-09-23T10:59:54 Z chonka Unscrambling a Messy Bug (IOI16_messy) C++
100 / 100
 4 ms 640 KB 
#include<iostream>
#include<stdio.h>
#include<vector>
#include<string>

#include "messy.h"


using namespace std ;

#define MAXN 157
int N ;

void init ( int l , int r ) {
    if ( l >= r ) { return ; }
    int i ;
    string cur ;
    cur.clear ( ) ;
    for ( i = 0 ; i < N ; i ++ ) {
        cur += '1' ;
    }
    for ( i = l ; i <= r ; i ++ ) {
        cur[ i ] = '0' ;
    }
    int mid = ( l + r ) / 2 ;
    for ( i = l ; i <= mid ; i ++ ) {
        cur[ i ] = '1' ;
        add_element ( cur ) ;
        cur[ i ] = '0' ;
    }
    init ( l , mid ) ;
    init ( mid + 1 , r ) ;
}
vector < int > solve ( vector < int > v ) {
    if ( v.size ( ) <= 1 ) { return v ; }
    int i ;
    string cur ;
    cur.clear ( ) ;
    for ( i = 0 ; i < N ; i ++ ) {
        cur += '1' ;
    }
    int sz = v.size ( ) ;
    for ( i = 0 ; i < sz ; i ++ ) {
        cur[ v[ i ] ] = '0' ;
    }
    vector < int > l , r ;
    l.clear ( ) ;
    r.clear ( ) ;
    for ( i = 0 ; i < sz ; i ++ ) {
        cur[ v[ i ] ] = '1' ;
        if ( check_element ( cur ) == true ) {
            l.push_back ( v[ i ] ) ;
        }
        else {
            r.push_back ( v[ i ] ) ;
        }
        cur[ v[ i ] ] = '0' ;
    }

    l = solve ( l ) ;
    r = solve ( r ) ;
    sz = r.size ( ) ;
    for ( i = 0 ; i < sz ; i ++ ) {
        l.push_back ( r[ i ] ) ;
    }
    return l ;
}

std::vector<int> restore_permutation(int n, int w, int r) {
    N = n ;
    init ( 0 , n - 1 ) ;
    compile_set();
    int i , j ;
    vector < int > aux ;
    aux.clear ( ) ;
    for ( i = 0 ; i < n ; i ++ ) {
        aux.push_back ( i ) ;
    }
    aux = solve ( aux ) ;
    vector < int > ret ;
    ret.clear ( ) ;
    for ( i = 0 ; i < n ; i ++ ) {
        for ( j = 0 ; j < n ; j ++ ) {
            if ( aux[ j ] == i ) { ret.push_back ( j ) ; break ; }
        }
    }
    return ret ;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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