oj.uz

Submission #975446

# Submission time Handle Problem Language Result Execution time Memory
975446 2024-05-05T07:59:22 Z LucaIlie Mechanical Doll (IOI18_doll) C++17
47 / 100
 75 ms 12008 KB 
#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_M = 1e5;
const int MAX_L = (1 << 18);
int ord[MAX_L];
vector<int> adj[MAX_M + 1];

int switchid( int x ) {
    return -(x + 1);
}

void create_circuit( int m, vector<int> a ) {
    int n = a.size();

    vector<int> c( m + 1 ), x, y;

    //if ( n == 16 ) {
        a.push_back( 0 );

        c[0] = a[0];

        int p = ceil( log2( n ) );
        x.resize( (1 << p) - 1 );
        y.resize( (1 << p) - 1 );
        for ( int v = 0; v < (1 << (p - 1)) - 1; v++ ) {
            x[v] = switchid( v * 2 + 1 );
            y[v] = switchid( v * 2 + 2 );
        }
        for ( int a = 0; a < (1 << p); a++ ) {
            int c = 0;
            for ( int b = 0; b < p; b++ ) {
                if ((a >> b) & 1 )
                    c += (1 << (p - 1 - b));
            }
            ord[c] = a;
        }
        int ind = 1;
        for ( int j = 0; j < (1 << p); j++ ) {
            int b = ord[j];
            int v = (1 << (p - 1)) - 1 + b / 2;
            if ( j + 1 + n <= (1 << p)) {
                if ( b % 2 == 0 )
                    x[v] = -1;
                else
                    y[v] = -1;
            } else {
                if ( b % 2 == 0 )
                    x[v] = a[ind];
                else
                    y[v] = a[ind];
                ind++;
            }
        }

        for ( int i = 1; i <= m; i++ )
            c[i] = -1;
    /*} else {
        a.push_back( 0 );
        reverse( a.begin(), a.end() );
        a.push_back( 0 );
        reverse( a.begin(), a.end() );

        for ( int i = 0; i < a.size() - 1; i++ )
            adj[a[i]].push_back( a[i + 1] );

        for ( int i = 0; i <= m; i++ ) {
            if ( adj[i].size() == 0 )
                continue;
            if ( adj[i].size() == 1 ) {
                c[i] = adj[i][0];
                continue;
            }

            int p = ceil( log2( adj[i].size()));
            int r = x.size();
            x.resize( r + (1 << p) - 1 );
            y.resize( r + (1 << p) - 1 );
            c[i] = switchid( r );
            for ( int v = 0; v < (1 << (p - 1)) - 1; v++ ) {
                x[r + v] = switchid( r + v * 2 + 1 );
                y[r + v] = switchid( r + v * 2 + 2 );
            }
            for ( int a = 0; a < (1 << p); a++ ) {
                int c = 0;
                for ( int b = 0; b < p; b++ ) {
                    if ((a >> b) & 1 )
                        c += (1 << (p - 1 - b));
                }
                ord[c] = a;
            }
            int ind = 0;
            for ( int j = 0; j < (1 << p); j++ ) {
                int a = ord[j];
                int v = r + (1 << (p - 1)) - 1 + a / 2;
                if ( j + 1 + adj[i].size() <= (1 << p)) {
                    if ( a % 2 == 0 )
                        x[v] = switchid( r );
                    else
                        y[v] = switchid( r );
                } else {
                    if ( a % 2 == 0 )
                        x[v] = adj[i][ind];
                    else
                        y[v] = adj[i][ind];
                    ind++;
                }
            }
        }
    }*/

    answer( c, x, y );
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 4 ms 2904 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2652 KB Output is partially correct
2 Correct 37 ms 7892 KB Output is correct
3 Partially correct 60 ms 10840 KB Output is partially correct
4 Partially correct 64 ms 11340 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2652 KB Output is partially correct
2 Correct 37 ms 7892 KB Output is correct
3 Partially correct 60 ms 10840 KB Output is partially correct
4 Partially correct 64 ms 11340 KB Output is partially correct
5 Partially correct 69 ms 12008 KB Output is partially correct
6 Partially correct 69 ms 11620 KB Output is partially correct
7 Partially correct 75 ms 11844 KB Output is partially correct
8 Partially correct 68 ms 11572 KB Output is partially correct
9 Partially correct 60 ms 10832 KB Output is partially correct
10 Partially correct 71 ms 11588 KB Output is partially correct
11 Partially correct 65 ms 11340 KB Output is partially correct
12 Partially correct 60 ms 11016 KB Output is partially correct
13 Correct 39 ms 8528 KB Output is correct
14 Partially correct 62 ms 11084 KB Output is partially correct
15 Partially correct 62 ms 11096 KB Output is partially correct
16 Partially correct 3 ms 2904 KB Output is partially correct
17 Correct 36 ms 8528 KB Output is correct
18 Correct 36 ms 8268 KB Output is correct
19 Partially correct 60 ms 10840 KB Output is partially correct
20 Partially correct 66 ms 11584 KB Output is partially correct
21 Partially correct 72 ms 11588 KB Output is partially correct
22 Partially correct 67 ms 11332 KB Output is partially correct