| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1352409 | hmms127 | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 0 ms | 344 KiB |
#include "messy.h"
#include "bits/stdc++.h"
using namespace std;
#define f1(n) for(int i=0;i<n;i++)
#define f3(n) for(int j=0;j<n;j++)
#define f2(m,n,q) for(int i=m;i<n;i+=q)
#define f4(m,n,q) for(int j=m;j<n;j+=q)
#define pb push_back
using pr=pair<int,int>;
using ar=array<int,3>;
vector<int> restore_permutation(int n, int w, int r) {
string s;
f1(n)s+='0';
f1(n){s[i]='1';add_element(s);}
compile_set();
bool ok[n]={};vector<int>ans(n);
f1(n){
string s;f3(n)s+='0';
vector<int>v;
f3(n){
if(ok[j])s[j]='1';
else v.pb(j);
}
for(auto it:v){
string t=s;
t[it]='1';
if(check_element(t)){
ok[it]=1;
ans[i]=it;
break;
}
}
}
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... | ||||
