# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
57444 | Crown | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 5 ms | 640 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 <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
int n;
vector<int> sol;
void add(int L, int R)
{
if(L == R) return;
int mid = (L+R)/2;
string base;
for(int i = 0; i< n; i++)
{
if(i< L || i> R) base += "1";
else base += "0";
}
for(int i = L; i<= mid; i++)
{
base[i] = '1';
add_element(base);
base[i] = '0';
}
add(L, mid); add(mid+1, R);
# | 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... |