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 <bits/stdc++.h>
#include "messy.h"
std::mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());
using namespace std;
#define IO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define y1 asjfkgasj
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define flsh '\n'<<flush
#define mp make_pair
#define mt make_tuple
#define sz size
#define pii pair<int,int>
#define pll pair<long long,long long>
#define vi vector<int>
#define vll vector<long long>
#define deb(x) cout<< #x <<'='<< x <<flsh;
#define iii int,int,int
#define ull unsigned long long
#define intt long long
#define ld long double
#define dd double
#define OK cout<<"OK\n"<<flsh;
#define setpre(x) fixed<<setprecision(x)
#define mmset(x,y) memset(x,y,sizeof(x))
vi ans;
string s;
vi restore_permutation(int n, int w, int r) {
ans.resize(n);
for(int i=0;i<n;i++) s+='0';
for(int i=0;i<n;i++)
{
s[i]='1';
add_element(s);
}
compile_set();
vector<pii>x;
for(int i=0;i<n;i++) s[i]='0';
for(int j=0;j<n;j++){
x.resize(n);
for(int i=0;i<n;i++)
x[i]={rng()%(n*n),i};
sort(all(x));
for(pii xx : x)
{
int i=xx.S;
if(s[i]=='0')
{
s[i]='1';
if(check_element(s))
{
ans[i]=j;
break;
}
else s[i]='0';
}
}
}
return ans;
}
# | 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... |