Submission #449910

#TimeUsernameProblemLanguageResultExecution timeMemory
449910osmanallazovUnscrambling a Messy Bug (IOI16_messy)C++14
20 / 100
1 ms332 KiB
#include <bits/stdc++.h> #include "messy.h" #define MAXN 256 using namespace std; int p[MAXN]; bool b[MAXN]; vector<int>v; vector<int>restore_permutation(int n, int w, int r) { if(n==8){ add_element("10000000"); add_element("11000000"); add_element("11100000"); add_element("11110000"); add_element("11111000"); add_element("11111100"); add_element("11111110"); add_element("11111111"); compile_set(); string x="00000000"; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(x[j]=='1')continue; x[j]='1'; if(check_element(x)){ p[i]=j; break; } x[j]='0'; } } } for(int i=0;i<n;i++) v.push_back(p[i]); return vector<int>(v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...