oj.uz

Submission #84017

# Submission time Handle Problem Language Result Execution time Memory
84017 2018-11-12T11:49:07 Z Alexa2001 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 7 ms 640 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

inline int last(int x) { return (1<<x) - 1; }

vector<int> restore_permutation(int n, int w, int r)
{
    int i, j, l, k;
    string s;
    vector<int> v[10][200];

    for(l=1; (1<<l) < n; ++l);

    for(i=0; i<l; ++i)
        for(j=0; j<n; ++j)
            if( (j & (1<<i)) == 0 )
            {
                s.clear();
                for(k=0; k<n; ++k)
                    if((k & last(i)) != (j & last(i))) s.push_back('1');
                        else if(k == j) s.push_back('1');
                            else s.push_back('0');
                add_element(s);
            }
    compile_set();

    for(i=0; i<n; ++i) v[0][0].push_back(i);

    for(i=0; i<l; ++i)
    {
        for(j=0; j<=last(i); ++j)
        {
            s.clear();
            for(k=0; k<n; ++k) s.push_back('0');

            for(k=0; k<=last(i); ++k)
                if(k != j)
                    for(auto it : v[i][k])
                        s[it] = '1';

            for(auto val : v[i][j])
            {
                s[val] = '1';
                if(check_element(s)) v[i+1][j].push_back(val);
                    else v[i+1][j + (1<<i)].push_back(val);
                s[val] = '0';
            }
        }
    }

    vector<int> where(n), ans(n);
    for(i=0; i<n; ++i) where[i] = v[l][i][0];
    for(i=0; i<n; ++i) ans[where[i]] = i;
    return ans;
}

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 384 KB n = 8
4 Correct 2 ms 384 KB n = 8
5 Correct 2 ms 384 KB n = 8
6 Correct 2 ms 384 KB n = 8
7 Correct 2 ms 384 KB n = 8
8 Correct 2 ms 384 KB n = 8
9 Correct 2 ms 384 KB n = 8
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 2 ms 384 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 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 #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 1 ms 384 KB n = 32
4 Correct 2 ms 384 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 3 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 4 ms 512 KB n = 128
2 Correct 4 ms 640 KB n = 128
3 Correct 4 ms 512 KB n = 128
4 Correct 3 ms 512 KB n = 128
5 Correct 3 ms 640 KB n = 128
6 Correct 4 ms 640 KB n = 128
7 Correct 4 ms 640 KB n = 128
8 Correct 4 ms 512 KB n = 128
9 Correct 3 ms 512 KB n = 128
10 Correct 4 ms 640 KB n = 128
11 Correct 4 ms 640 KB n = 128
12 Correct 7 ms 512 KB n = 128
13 Correct 4 ms 512 KB n = 128
14 Correct 3 ms 512 KB n = 128
15 Correct 3 ms 640 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 640 KB n = 128
3 Correct 3 ms 512 KB n = 128
4 Correct 3 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 4 ms 640 KB n = 128
9 Correct 3 ms 640 KB n = 128
10 Correct 3 ms 512 KB n = 128
11 Correct 3 ms 640 KB n = 128
12 Correct 3 ms 640 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