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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include "messy.h"
using namespace std;
bool have[1005]={0};
string all;
string temp;
vector < int > restore_permutation(int n, int w, int r)
{
vector < int > t;
int i,j;
for(i=0;i<n;i++) t.push_back(100000);
for(i=0;i<n;i++)
{
all+='0';
temp+='0';
}
for(i=0;i<n;i++)
{
all[i]='1';
add_element(all);
}
compile_set();
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(!have[j])
{
temp[j]='1';
if(check_element(temp))
{
//printf("%d %d\n",i,j);
t[j]=i;
have[j]=1;
break;
}
else temp[j]='0';
}
}
}
return t;
}
# | 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... |