oj.uz

Submission #308963

# Submission time Handle Problem Language Result Execution time Memory
308963 2020-10-02T12:23:17 Z amunduzbaev Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 640 KB 
#include <bits/stdc++.h>
using namespace std;

#include "messy.h"
//#include "grader.cpp"

vector<int>ans;
int n1;

void add(int l,int r){
    string s(n1,'1');
    for(int i = l ; i <= r ;i++) s[i]='0';
    int m = (l+r)/2;
    for( int  i = l ; i <= m; i++){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    if(l!=m)   add(l, m);
    if(m+1!=r) add(m+1, r);
    return;
}
void check(int l,int r,vector<int> v){
    if(l==r){
         ans[v[0]] = l;
         return ;
    }

    string s(n1,'1');
    for(int i=0;i<v.size() ;i++)
        s[v[i]]='0';

    vector <int> vl, vr;
    int m=(l+r)/2;

    for(int i = l ; i <= r; i++){
        s[v[i-l]]='1';
        if(check_element(s))   vl.push_back(v[i-l]);
        else                   vr.push_back(v[i-l]);
        s[v[i-l]]='0';
    }
    check(l,m,vl);
    check(m+1,r,vr);
}
vector<int> restore_permutation(int N, int w, int r) {
    n1=N;
    add(0,n1-1);
    compile_set();

    vector<int>v;

    v.resize(n1);
    ans.resize(n1);

    for(int i=0;i<n1;i++)
        v[i]=i;
    check(0,n1-1,v);

    return ans;
}
/*

4
16 16
1 3 2 0

*/

Compilation message

messy.cpp: In function 'void check(int, int, std::vector<int>)':
messy.cpp:30:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0;i<v.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 0 ms 384 KB n = 8
4 Correct 0 ms 256 KB n = 8
5 Correct 1 ms 256 KB n = 8
6 Correct 1 ms 256 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 1 ms 256 KB n = 8
12 Correct 0 ms 256 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 512 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 3 ms 640 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 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

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 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 512 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 2 ms 512 KB n = 128
15 Correct 2 ms 512 KB n = 128