제출 #284957

#제출 시각아이디문제언어결과실행 시간메모리
284957user202729Unscrambling a Messy Bug (IOI16_messy)C++17
20 / 100
1 ms384 KiB
// moreflags=grader.cpp #include <vector> // 15 // Almost misread the problem statement... // compile_set must be called exactly once. // naive solution. #include "messy.h" std::vector<int> restore_permutation(int n, int w, int r) { std::string tmp(n, '0'); for(int i=0; i<n-1; ++i){ tmp[i]='1'; add_element(tmp); } compile_set(); tmp.assign(n, '0'); std::vector<int> result(n); for(int target=0; target<n; ++target){ for(int i=0; i<n; ++i) if(tmp[i]=='0'){ tmp[i]='1'; if(target==n-1 or check_element(tmp)){ result[target]=i; break; } tmp[i]='0'; } } return result; }
#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...