oj.uz

Submission #308417

# Submission time Handle Problem Language Result Execution time Memory
308417 2020-10-01T06:18:33 Z kylych03 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 9 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
//#include "grader.cpp"
int  N;
vector <int> res;
void add (int l , int r){
    if(l==r)
        return;
    string s;
    for(int i  = 0 ; i < N; i++)
        s=s+'1';
    for(int i = l ; i <= r ;i++)
        s[i]='0';
    int mid = (l+r)/2;
    for( int  i = l ; i <= mid; i++){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    add(l, mid);
    add(mid+1, r);
}
void check(int l, int r, vector <int> vec){
    if(l==r){
         res[vec[0]] = l;
         return  ;
    }
    string s;
    vector <int> left, right;
    for(int i  = 0 ; i < N; i++)
        s=s+'1';
    for(int i = 0 ; i <vec.size() ;i++)
        s[vec[i]]='0';
    int mid  = (l + r)  / 2;

    for(int i = l ; i <= r; i++){
        s[vec[i-l]]='1';
        if(check_element(s)){
            left.push_back(vec[i-l]);
        }
        else
            right.push_back(vec[i-l]);
        s[vec[i-l]]='0';
    }
    check(l, mid,left);
    check( mid+1, r, right);
}
vector <int> restore_permutation(int n, int w, int r) {

    N = n;
    add(0, n-1);
    compile_set();
    vector <int > vec;
    vec.resize(n);
    res.resize(n);
    for(int i = 0 ; i < n; i++)
        vec[i] = i;
    check( 0, n-1, vec);
    return res;
}

Compilation message

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 8
2 Correct 1 ms 256 KB n = 8
3 Correct 0 ms 256 KB n = 8
4 Correct 0 ms 256 KB n = 8
5 Correct 0 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 1 ms 256 KB n = 8
10 Correct 0 ms 256 KB n = 8
11 Correct 0 ms 256 KB n = 8
12 Correct 1 ms 256 KB n = 8
13 Correct 0 ms 256 KB n = 8
14 Correct 1 ms 256 KB n = 8
15 Correct 0 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 256 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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