Submission #95697

#	Time	Username	Problem	Language	Result	Execution time	Memory
95697		cheeheng	Unscrambling a Messy Bug (IOI16_messy)	C++14	38 / 100	3 ms	384 KiB

messy

#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
 
/*
void add_element(string x);
bool check_element(string x);
void compile_set();
*/
 
std::vector<int> restore_permutation(int n, int w, int r) {
    vector<int> p = vector<int>();
 
    char temp[130];
    memset(temp, 0, sizeof(temp));
    for(int i = 0; i < n; i ++){
        temp[i] = '0';
        p.push_back(0);
    }
 
    for(int i = 0; i < n; i ++){
        temp[i] = '1';
        string str = string(temp);
        //printf("%s\n", str.c_str());
        add_element(str);
    }
 
    compile_set();
 
    for(int i = 0; i < n; i ++){
        temp[i] = '0';
    }
 
    int q[130];
    set<int> s;
    for(int i = 0; i < n; i ++){
        q[i] = i;
        s.insert(i);
    }
 
    int cnt = 0;
    for(int i = 0; i < n-1; i ++){
        random_shuffle(q, q+n);
        bool found = false;
        for(int j = 0; j < n-1; j ++){
            if(temp[j] == '1'){continue;}
            temp[j] = '1';
            string str = string(temp);
            //printf("%s\n", str.c_str());
            cnt ++;
            if(check_element(str)){
                p[j] = i;
                s.erase(j);
                found = true;
                //printf("p[%d]=%d\n", j, i);
                break;
            }else{
                temp[j] = '0';
            }
        }
        if(!found){
            s.erase(n-1);
            p[n-1] = i;
            temp[n-1] = '1';
        }
    }
    assert(cnt < (n-1)*n/2);
    p[*s.begin()] = n-1;
    return p;
}
/*
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;
}
 
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;
}
 
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)) {
        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;
}
 
*/

• Subtask 1: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30