| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 796662 | Malix | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 2080 ms | 340 KiB |
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 <bits/stdc++.h>
using namespace std;
#include "messy.h"
std::vector<int> restore_permutation(int n, int w, int r) {
string a(n, '0');
for(int i=0;i<n-1;i++){a[i]='1';add_element(a);}
compile_set();
vector<int> ans(n, n-1);
bool is_true=0;
string b(n, '0');int c=0;
for(int i=0;i<n-1;i++){
is_true=0;c=0;
while(!is_true){
if(b[c]!='1'){
b[c]='1';
is_true=check_element(b);
if(!is_true){b[c]='0';c++;}
}
if(c>=n)is_true=1;
}
ans[c]=i;
}
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... | ||||
