제출 #282323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
282323		AKaan37	Unscrambling a Messy Bug (IOI16_messy)	C++17	38 / 100	2 ms	384 KiB

messy

//Bismillahirrahmanirrahim

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

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,vis[li];
int cev;
string s;
string v;

std::vector<int> restore_permutation(int n, int w, int r) {
	srand(time(NULL));
	for(int i=0;i<n;i++)s+='1';
	for(int i=n-1;i>=0;i--){
		s[i]='0';
		add_element(s);
	}
	compile_set();
	vector<int> vec;
	string vv;
	FOR vv+='1';
	FOR vec.pb(0);
	for(int i=n-1;i>=0;i--){
		for(int j=0;j<n;j++)vis[j]=0;
		for(int j=0;j<n;j++){
			int jj=rand()%n;
			if(vis[jj]){j--;continue;}
			vis[jj]=1;
			vis[jj]=1;
			v=vv;
			if(vv[jj]=='0'){continue;}
			v[jj]='0';
			if(check_element(v)){
				vv[jj]='0';
				vec[jj]=i;
				break;
			}
		}
	}
	return vec;
}

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