This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <vector>
#include <cstdlib>
#include <cstdio>
#include "messy.h"
#include <iostream>
using namespace std;
int tag[100];
std::vector<int> restore_permutation(int n, int w, int r) {
string x,s;
vector<int>p(n);
for(int i=0;i<n;i++)s+='0';
for(int i=0;i<n;i++)p[i]=-1;
x=s;
for(int i=0;i<n;i++)
{
s[i]='1';
add_element(s);
}
compile_set();
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)tag[j]=0;
for(int j=0;j<n;j++)
{
long long int tmp=rand()%n;
while(tag[tmp]==1)
{
tmp=rand()%n;
}
if(p[tmp]==-1)x[tmp]='1';
else continue;
if(check_element(x)==true)
{
p[tmp]=i;
break;
}
x[tmp]='0';
tag[tmp]=1;
}
}
return p;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |