oj.uz

Submission #121355

# Submission time Handle Problem Language Result Execution time Memory
121355 2019-06-26T12:14:16 Z Charis02 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 18 ms 512 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include "messy.h"
#define rep(i,a,b) for(int i = a;i < b;i++)

using namespace std;

/*
namespace helper {

    set<string> set_;
    bool compiled = false;
    int n;
    vector<int> p;
    int w;
    int r;

    int read_int() {
        int x;
        cin >> x;
        return x;
    }

}

using namespace helper;


// A convenience function.
int get_p(int i) {
    int ret = p[i];
    return ret;
}


void wa() {
    printf("WA\n");
    exit(0);
}

bool check(const string& x) {
    if ((int)x.length() != n) {
        return false;
    }
    for (int i = 0; i < n; i++) {
        if (x[i] != '0' && x[i] != '1') {
            return false;
        }
    }
    return true;
}

void add_element(string x) {
    if (--w < 0 || compiled || !check(x)) {
//        cout << x << endl;
        wa();
    }
    set_.insert(x);
}

bool check_element(string x) {
    if (--r < 0 || !compiled || !check(x)) {
        wa();
    }
    return set_.count(x);
}

void compile_set() {
    if (compiled) {
        wa();
    }
    compiled = true;
    set<string> compiledSet;
    string compiledElement = string(n, ' ');
    for (set<string>::iterator it = set_.begin(); it != set_.end(); it++) {
        string s = *it;
        for (int i = 0; i < n; i++) {
            compiledElement[i] = s[get_p(i)];
        }
        compiledSet.insert(compiledElement);
    }
    set_ = compiledSet;
}

*/
vector < int > result(230);

void init(int low,int high,int n)
{
    if(low == high)
        return;

    int mid = (low+high)/2;

    string s = "";

    rep(i,0,n)
        s += "1";

    rep(i,low,high+1)
        s[i] = '0';

    rep(i,low,mid+1)
    {
        s[i] = '1';

      //  cout << low << " " << high << " " << s << endl;

        add_element(s);

        s[i] = '0';
    }

    init(low,mid,n);
    init(mid+1,high,n);

    return;
}

void solve(int low,int high,int n,vector < int > pos)
{
    if(low == high)
    {
        result[low] = pos[0];
        return;
    }

    int mid = (low+high)/2;
    vector < int > posl;
    vector < int > posr;
    string s = "";

    rep(i,0,n)
        s+="1";

    rep(i,0,pos.size())
    {
        s[pos[i]] = '0';
    }

    rep(i,0,pos.size())
    {
        int x = pos[i];
        s[x] = '1';

      //  cout << x << " " << s << " " << check_element(s) << endl;

        if(check_element(s))
            posl.push_back(x);
        else
            posr.push_back(x);

        s[x] = '0';
    }

    solve(low,mid,n,posl);
    solve(mid+1,high,n,posr);

    return;
}

std::vector<int> restore_permutation(int n, int w, int r)
{
    init(0,n-1,n);
    compile_set();

    vector < int > v;
    rep(i,0,n)
        v.push_back(i);

    result.resize(n);
    solve(0,n-1,n,v);

    vector < int > ans = result;

    rep(i,0,result.size())
        ans[result[i]] = i;

    return ans;
}

/*
int main() {
    n = read_int();
    w = read_int();
    r = read_int();
    p = vector<int>(n);
    for (int i = 0; i < n; i++) {
        p[i] = read_int();
    }
    vector<int> answer = restore_permutation(n, w, r);

    if (answer.size() != n) {
        printf("WA\n");
        return 0;
    }


    printf("%d", answer[0]);

    for (int i = 1; i < n; i++) {
        printf(" %d", answer[i]);
    }
    printf("\n");
    return 0;
}
*/

Compilation message

messy.cpp: In function 'void solve(int, int, int, std::vector<int>)':
messy.cpp:6:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,a,b) for(int i = a;i < b;i++)
messy.cpp:138:9:
     rep(i,0,pos.size())
         ~~~~~~~~~~~~~~              
messy.cpp:138:5: note: in expansion of macro 'rep'
     rep(i,0,pos.size())
     ^~~
messy.cpp:6:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,a,b) for(int i = a;i < b;i++)
messy.cpp:143:9:
     rep(i,0,pos.size())
         ~~~~~~~~~~~~~~              
messy.cpp:143:5: note: in expansion of macro 'rep'
     rep(i,0,pos.size())
     ^~~
messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:6:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,a,b) for(int i = a;i < b;i++)
messy.cpp:178:9:
     rep(i,0,result.size())
         ~~~~~~~~~~~~~~~~~           
messy.cpp:178:5: note: in expansion of macro 'rep'
     rep(i,0,result.size())
     ^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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