oj.uz

Submission #445593

# Submission time Handle Problem Language Result Execution time Memory
445593 2021-07-18T19:43:16 Z FEDIKUS Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>

#include "messy.h"

using namespace std;

typedef string str;

void dodaj(int n,int l,int r){
    if(l==r) return;
    str s;
    for(int i=0;i<n;i++){
        if(l<=i && i<=r) s+='0';
        else s+='1';
    }
    int mid=l+(r-l)/2;
    for(int i=l;i<=mid;i++){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    dodaj(n,l,mid);
    dodaj(n,mid+1,r);
}

vector<int> spoji(vector<int> a,vector<int> b){
    for(int i=0;i<b.size();i++) a.push_back(b[i]);
    return a;
}

vector<int> resi(int n,int l,int r,vector<int> &gde){
    if(l==r) return gde;
    vector<int> gde1;
    vector<int> gde2;
    str s;
    for(int i=0;i<n;i++){
        if(binary_search(gde.begin(),gde.end(),i)) s+='0';
        else s+='1';
    }
    for(int i:gde){
        s[i]='1';
        if(check_element(s)) gde1.push_back(i);
        else gde2.push_back(i);
        s[i]='0';
    }
    int mid=l+(r-l)/2;
    return spoji(resi(n,l,mid,gde1),resi(n,mid+1,r,gde2));
}

vector<int> shiftuj(vector<int> a){
    vector<int> ret(a.size());
    for(int i=0;i<a.size();i++){
        ret[a[i]]=i;
    }
    return ret;
}

std::vector<int> restore_permutation(int n, int w, int r) {
    dodaj(n,0,n-1);
    compile_set();
    vector<int> gde;
    for(int i=0;i<n;i++) gde.push_back(i);
    return shiftuj(resi(n,0,n-1,gde));
}
/*
4 16 16
2 1 3 0
*/

Compilation message

messy.cpp: In function 'std::vector<int> spoji(std::vector<int>, std::vector<int>)':
messy.cpp:27:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0;i<b.size();i++) a.push_back(b[i]);
      |                 ~^~~~~~~~~
messy.cpp: In function 'std::vector<int> shiftuj(std::vector<int>)':
messy.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(int i=0;i<a.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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