Submission #99078

#TimeUsernameProblemLanguageResultExecution timeMemory
99078figter001Unscrambling a Messy Bug (IOI16_messy)C++14
38 / 100
3 ms404 KiB
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 300;

bool f[nax];

vector<int> restore_permutation(int n, int w, int r) {
	vector<int> ans(n);
	string tmp,cur;
	for(int i=0;i<n;i++)
		tmp += '0';
	cur = tmp;
	for(int i=0;i<n;i++){
		tmp[i] = '1';
		add_element(tmp);
	}
    compile_set();
    for(int i=0;i<n;i++){
    	for(int j=0;j<n;j++){
    		if(f[j])continue;
    		cur[j] = '1';
    		if(check_element(cur)){
    			ans[j] = i;
    			f[j] = 1;
    			break;
    		}
    		cur[j] = '0';
    	}
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...