Submission #789308

#TimeUsernameProblemLanguageResultExecution timeMemory
789308NothingXDUnscrambling a Messy Bug (IOI16_messy)C++17
38 / 100
1 ms340 KiB
#include <vector> #include "messy.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef complex<ld> point; void debug_out() {cerr << endl;} template<typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << ' '; debug_out(T...); } #define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__) #define F first #define S second #define all(x) x.begin(), x.end() #define MP(x, y) make_pair(x, y) vector<int> restore_permutation(int n, int w, int r) { string s; for (int i = 0; i < n; i++){ s.push_back('0'); } for (int i = 0; i < n; i++){ s[i] = '1'; add_element(s); } compile_set(); vector<int> ans(n); for (int i = 0; i < n; i++){ s[i] = '0'; } for (int i = 0; i < n; i++){ for (int j = 0; j < n; j++){ if (s[j] == '1') continue; s[j] = '1'; if (!check_element(s)){ s[j] = '0'; continue; } ans[j] = i; break; } } return ans; }
#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...