oj.uz

Submission #282614

# Submission time Handle Problem Language Result Execution time Memory
282614 2020-08-24T15:51:51 Z Atill83 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 544 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
int cnt = 0;
void gen(int n, int l, int r){
    
    if(l > r || l == r) return;
    string s;
    for(int i = 0; i < n; i++){
        s += '1';
    }

    int m = (l + r) / 2;
    for(int i = l; i <= r; i++){
        s[i] = '0';
    }

    for(int i = l; i <= m; i++){
        s[i] = '1';
        cnt++;
        //cerr<<s<<endl;
        add_element(s);
        s[i] = '0';
    }
    gen(n, l, m);
    gen(n, m + 1, r);
}
vector<int> ans;
void solve(int n, int l, int r, vector<int> ind){
    string s;
    if(l == r){
        ans[ind[0]] = l;
        return;
    }
    for(int i = 0; i < n; i++){
        s += "1";
    }

    int m = (l + r) / 2;
    
    for(int i = 0; i < ind.size(); i++)
        s[ind[i]] = '0';

    vector<int> a, b;
    
    for(int i = 0; i < ind.size(); i++){
        s[ind[i]] = '1';
        if(check_element(s)){
            a.push_back(ind[i]);
        }else{
            b.push_back(ind[i]);
        }
        s[ind[i]] = '0';
    }
    assert(a.size() == ind.size() / 2);
    assert(b.size() == ind.size() / 2);
    solve(n, l, m, a);
    solve(n, m + 1, r, b);
}



vector<int> restore_permutation(int n, int w, int r) {
    ans.resize(n, 0);
    gen(n, 0, n - 1);
    compile_set();
    vector<int> cur;
    for(int i = 0; i < n; i++){
        cur.push_back(i);
    }
    solve(n, 0, n - 1, cur);
    return ans;
}

Compilation message

messy.cpp: In function 'void solve(int, int, int, std::vector<int>)':
messy.cpp:41:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i = 0; i < ind.size(); i++)
      |                    ~~^~~~~~~~~~~~
messy.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i = 0; i < ind.size(); i++){
      |                    ~~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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