Submission #198350

#	Time	Username	Problem	Language	Result	Execution time	Memory
198350		stefdasca	Unscrambling a Messy Bug (IOI16_messy)	C++14	Compilation error	0 ms	0 KiB

messy

#include<messy.h>
using namespace std;

int N;
/*
int perm[202];
set<string> test, tru;

// to be removed when submitting
void add_element(string s)
{
    test.insert(s);
}

bool check_element(string s)
{
    if(tru.find(s) != tru.end())
        return 1;
    return 0;
}
void compile_set()
{
    string ans;
    for(int i = 0; i < N; ++i)
        ans += '0';
    for(set<string> ::iterator it = test.begin(); it != test.end(); ++it)
    {
        string ss = *it;
        for(int i = 0; i < N; ++i)
            ans[i] = '0';
        for(int i = 0; i < N; ++i)
            ans[perm[i]] = ss[i];
        tru.insert(ans);
    }
}
*/
int poz[202];
std::vector<int> pospoz[202][202];
void build(int st, int dr)
{
    if(st == dr)
        return;
    std::string s;
    for(int i = 0; i < N; ++i)
        s += '1';
    int mid = (st + dr) / 2;
    for(int i = st; i <= dr; ++i)
        s[i] = '0';
    for(int i = st; i <= mid; ++i)
    {
        s[i] = '1';
        assert((int) s.size() == N);
        add_element(s);
        s[i] = '0';
    }
    build(st, mid);
    build(mid+1, dr);
}
void restore(int st, int dr)
{
    if(st == dr)
    {
        poz[st] = pospoz[st][st][0];
        return;
    }
    std::string s;
    for(int i = 0; i < N; ++i)
        s += '0';
    bool oki[150] = {0};
    for(int i = 0; i < pospoz[st][dr].size(); ++i)
        oki[pospoz[st][dr][i]] = 1;
    for(int i = 0; i < N; ++i)
        if(!oki[i])
            s[i] = '1';
    int mid = (st + dr) / 2;
    for(int i = 0; i < pospoz[st][dr].size(); ++i)
    {
        int pp = pospoz[st][dr][i];
        s[pp] = '1';
        assert((int) s.size() == N);
        bool xxx = check_element(s);
        if(xxx)
            pospoz[st][mid].push_back(pp);
        else
            pospoz[mid+1][dr].push_back(pp);
        s[pp] = '0';
    }
    restore(st, mid);
    restore(mid+1, dr);
}
std::vector<int> restore_permutation(int n, int w, int r)
{
    N = n;
    build(0, n-1);
    compile_set();
    for(int i = 0; i < n; ++i)
        pospoz[0][n-1].push_back(i);
    restore(0, n-1);
    std::vector<int> ans;
    for(int i = 0; i < n; ++i)
        ans.push_back(poz[i]);
    assert((int) ans.size() == N);
    return ans;
}

Compilation message (stderr)

messy.cpp: In function 'void build(int, int)':
messy.cpp:52:9: error: 'assert' was not declared in this scope
         assert((int) s.size() == N);
         ^~~~~~
messy.cpp:52:9: note: suggested alternative: 'qsort'
         assert((int) s.size() == N);
         ^~~~~~
         qsort
messy.cpp: In function 'void restore(int, int)':
messy.cpp:70:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < pospoz[st][dr].size(); ++i)
                    ~~^~~~~~~~~~~~~~~~~~~~~~~
messy.cpp:76:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < pospoz[st][dr].size(); ++i)
                    ~~^~~~~~~~~~~~~~~~~~~~~~~
messy.cpp:80:9: error: 'assert' was not declared in this scope
         assert((int) s.size() == N);
         ^~~~~~
messy.cpp:80:9: note: suggested alternative: 'qsort'
         assert((int) s.size() == N);
         ^~~~~~
         qsort
messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:102:5: error: 'assert' was not declared in this scope
     assert((int) ans.size() == N);
     ^~~~~~
messy.cpp:102:5: note: suggested alternative: 'qsort'
     assert((int) ans.size() == N);
     ^~~~~~
     qsort