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 "messy.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> restore_permutation(int n, int w, int r)
{
string s(n, '0');
for(int i=0;i<n;i++)
{
s[i] = '1';
add_element(s);
}
compile_set();
s = "";
s = string(n, '0');
int csum = 0;
vector<int> vis(n, -1);
for(int i=0;i<n-1;i++)
{
for(int j=0;j<n;j++)
{
if(vis[j] != -1)
continue;
s[j] = '1';
if(check_element(s))
{
vis[j] = i;
csum += i;
break;
}
s[j] = '0';
}
}
for(int i=0;i<n;i++)
{
if(vis[i] == -1)
vis[i] = ((n * (n - 1)) / 2) - csum;
}
return vis;
}
# | 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... |