제출 #296133

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
296133		Mercenary	Unscrambling a Messy Bug (IOI16_messy)	C++14	100 / 100	2 ms	512 KiB

messy

#include <vector>

#include "messy.h"
#include<bits/stdc++.h>

using namespace std;

void solve(int n , int l , int r){
    if(l == r)return;
    string s(n , '1');
    for(int i = l ; i <= r ; ++i){
        s[i - 1] = '0';
    }
    int mid = l + r >> 1;
    for(int i = l ; i <= mid ; ++i){
        s[i - 1] = '1';
        add_element(s);
        s[i - 1] = '0';
    }
    solve(n , l , mid);
    solve(n , mid + 1 , r);
}
vector<int> res;

void trace(int n , int l , int r , vector<int> val){
    if(l == r){
        res[val[0] - 1] = l - 1;
        return;
    }
    string s(n , '1');
    for(auto & c : val)s[c - 1] = '0';
    int mid = l + r >> 1;
    vector<int> valL , valR;
    for(auto & c : val){
        s[c - 1] = '1';
        if(check_element(s))valL.push_back(c);
        else valR.push_back(c);
        s[c - 1] = '0';
    }
//    cout << valL.size() << " " << valR.size() << endl;
    trace(n , l , mid , valL);
    trace(n , mid + 1 , r , valR);
}

std::vector<int> restore_permutation(int n, int w, int r) {
    solve(n , 1 , n);
    compile_set();
    res.resize(n , 0);
    vector<int> val(n,0);iota(val.begin(),val.end(),1);
    trace(n , 1 , n , val);
    return res;
}

#ifdef LOCAL
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <cstdlib>
#include <iostream>
#include "messy.h"

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() {
    freopen("A.INP","r",stdin);
    freopen("A.OUT","w",stdout);
    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;
}

#endif // LOCAL

컴파일 시 표준 에러 (stderr) 메시지

messy.cpp: In function 'void solve(int, int, int)':
messy.cpp:14:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   14 |     int mid = l + r >> 1;
      |               ~~^~~
messy.cpp: In function 'void trace(int, int, int, std::vector<int>)':
messy.cpp:32:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |     int mid = l + r >> 1;
      |               ~~^~~

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