oj.uz

Submission #20602

# Submission time Handle Problem Language Result Execution time Memory
20602 2017-02-12T15:45:00 Z model_code Unscrambling a Messy Bug (IOI16_messy) C++11
100 / 100
 5 ms 512 KB 
// name = messy_iz.cpp, type = cpp.g++11

#include "messy.h"


#include <vector>
#include <string>

//#include "messy.h"

using namespace std;

std::vector<int> restore_permutation(int n, int w, int r) {
    for (int len = n / 2; len >= 1; len >>= 1) {
        for (int s = 0; s < n; s += 2 * len) {
            string a = "";
            for (int i = 0; i < n; i++) a += '1';
            for (int i = 0; i < len * 2; i++) a[s + i] = '0';
            for (int i = 0; i < len; i++) {
                string ss = a;
                ss[s + i] = '1';
                add_element(ss);
            }
        }
    }
    compile_set();
    vector<vector<int> > can(n);
    for (int i = 0; i < n; i++) can[0].push_back(i);
    for (int len = n / 2; len >= 1; len >>= 1) {
        for (int s = 0; s < n; s += 2 * len) {
            string a = "";
            for (int i = 0; i < n; i++) a += '1';
            for (int i = 0; i < (int)can[s].size(); i++) a[can[s][i]] = '0';
            vector<int> c1, c2;
            for (int i = 0; i < (int)can[s].size(); i++) {
                string ss = a;
                ss[can[s][i]] = '1';
                if (check_element(ss)) {
                    c1.push_back(can[s][i]);
                } else {
                    c2.push_back(can[s][i]);
                }
            }
            can[s] = c1;
            can[s + len] = c2;
        }
    }
    vector<int> ans(n);
    for (int i = 0; i < n; i++) ans[can[i][0]] = 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 332 KB n = 8
7 Correct 2 ms 384 KB n = 8
8 Correct 2 ms 256 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 384 KB n = 8
13 Correct 2 ms 256 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 2 ms 388 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 3 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 412 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 5 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 4 ms 512 KB n = 128
10 Correct 4 ms 512 KB n = 128
11 Correct 3 ms 512 KB n = 128
12 Correct 4 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 3 ms 512 KB n = 128
5 Correct 3 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 4 ms 512 KB n = 128
13 Correct 3 ms 512 KB n = 128
14 Correct 3 ms 512 KB n = 128
15 Correct 3 ms 512 KB n = 128