oj.uz

Submission #742792

# Submission time Handle Problem Language Result Execution time Memory
742792 2023-05-17T00:57:14 Z ALTAKEXE Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 496 KB 
#include "messy.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
 
vector<int> restore_permutation(int n, int w, int r){
    int k = __builtin_ctz(n);
 
    for(int i = 0; i < n; i++) for(int j = 0; j < k; j++){
        if(!(i&(1<<j))) continue;
        if(j == 0){
            str s(n, '0');
            s[i] = '1';
            add_element(s);
            continue;
        }
        str s(n, '0');
        for(int l = 0; l < n; l++){
            if(l%(1<<j) + i%(1<<j) == (1<<j)-1) s[l] = '1';
        }
        s[i] = '1';
        add_element(s);
    }
 
    compile_set();
 
    vector<int> p(n, 0);
    vector<str> sth(n);
 
    for(int j = 0; j < k; j++){
        if(j == 0){
            for(int i = 0; i < n; i++){
                str s(n, '0');
                s[i] = '1';
                if(check_element(s)) p[i]+=(1<<j);
            }
            continue;
        }
 
        for(int h = 0; h < (1<<j); h++){
            sth[h] = str(n, '0');
            for(int i = 0; i < n; i++)
                if(p[i]%(1<<j) + h == (1<<j)-1) sth[h][i] = '1';
        }
 
        for(int i = 0; i < n; i++){
            str s = sth[p[i]%(1<<j)];
            s[i] = '1';
            if(check_element(s)) p[i]+=(1<<j);
        }
    }
 
    return p;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 0 ms 300 KB n = 8
4 Correct 1 ms 228 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 300 KB n = 8
11 Correct 1 ms 304 KB n = 8
12 Correct 1 ms 296 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 1 ms 296 KB n = 8

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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