제출 #1057740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1057740		1ne	Unscrambling a Messy Bug (IOI16_messy)	C++14	0 / 100	1 ms	604 KiB

messy

#include <vector>
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> restore_permutation(int n, int w, int r) {
	 string s;
	 for (int i = 0;i<n;++i){
	 	s+='0';
	 }
	 for (int i  = 0;i<n;++i){
	 	s[i] = '1';
	 	add_element(s);
	 }
    compile_set();
  	 vector<int>pos(n,-1);
  	 string cur;
  	 for (int i = 0;i<n;++i){
  	 	cur+='0';
  	 }                            
  	 for (int i = 0;i<n;++i){
  	 	int left = 0,right = n - 1,ps = -1;
  	 	while(left<=right){
  	 		int mid = (left + right)>>1;
  	 		string new_cur = cur;
  	 		for (int j = 0;j<=mid;++j){
  	 			new_cur[j] = '1';
  	 		}
  	 		if (check_element(new_cur)){
  	 			right = mid - 1;
  	 			ps = mid;
  	 		}
  	 		else{
  	 			left = mid + 1;
  	 		}
  	 	}
  	 	//cur_bit is in the region between 0...pos
  	 	//pos is not the last bit of the given bits of numbers
  	 	//
    	for (int j = 0;j<=ps;++j){
    		if (cur[j] == '1')continue;
    		cur[j] = '1';
    		if (check_element(cur)){
    			pos[i] = j;
    			break;		
    		}
    		cur[j] = '0';	
    	 }
  	 }
  	 vector<int>inv(n);
  	 for (int i = 0;i<n;++i){
  	 	inv[pos[i]] = i;
  	 }
    return inv;
}

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