Submission #308958

#TimeUsernameProblemLanguageResultExecution timeMemory
308958amunduzbaevUnscrambling a Messy Bug (IOI16_messy)C++14
49 / 100
2 ms384 KiB
#include <bits/stdc++.h> using namespace std; #include "messy.h" //#include "grader.cpp" int ran[200000]; vector<string>v; int n1; void add(){ string s(n1,'0'); s[0]='0'; for(int i=1;i<n1;i++) s[i]='1'; int last=1; for(int i=0;i<n1-1;i++){ add_element(s); s[last]='0'; last++; } //cout<<"worked\n"; } void check(){ string s(n1,'0'); for(int i=0;i<n1-1;i++){ for(int j=0;j<n1;j++){ if(s[ran[j]]=='0'){ s[ran[j]]='1'; if(check_element(s)) { v.push_back(s); break; } else s[ran[j]]='0'; } } } } vector<int> restore_permutation(int N, int w, int r) { n1=N; for(int i=0;i<n1;i++) ran[i]=i; srand(time(0)); random_shuffle(ran,ran+n1); add(); compile_set(); check(); int vs=v.size(); vector<int> a(n1,0); for(int i=0;i<vs;i++){ //cout<<v[i]<<"\n"; for(int j=0;j<n1;j++){ a[j]+=(v[i][j]-'0'); } } return a; } /* 4 16 16 1 3 2 0 */
#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...