# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21910 | sampriti | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 4 ms | 512 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 "messy.h"
#include <vector>
#include <string>
#include <algorithm>
#include <cassert>
using namespace std;
int N;
void add_strings(int L, int R, string base) {
if(L == R) return;
int mid = (L + R)/2;
for(int i = L; i <= mid; i++) {
base[i] = '1';
add_element(base);
base[i] = '0';
}
base = string(N, '0');
string left = base, right = base;
for(int i = mid + 1; i <= R; i++) left[i] = '1';
for(int i = L; i <= mid; i++) right[i] = '1';
add_strings(L, mid, left);
add_strings(mid + 1, R, right);
}
vector<int> ans_rev;
# | 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... |