# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729722 | StefanL2005 | Martian DNA (IOI16_dna) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
ifstream in("dna.in");
ofstream out("dna.out");
string S;
int t;
bool make_test(string p)
{
if (S.find(p) != -1)
return true;
return false;
}
// +48
void search_back(int c1, int c2, string &str)
{
int ans = c1;
while (c1 <= c2)
{
int m = (c1 + c2) / 2;
if (make_test(str.substr(0, m)) == false)
c2 = m - 1;
else
{
ans = m;
c1 = m + 1;
}
}
if (make_test(str.substr(0, ans)) == true)
str = str.substr(0, ans);
}
string analyse(int n, int t)
{
string str("");
int flaws = 0;
while (str.length() < n && flaws < 18)
{
int bit = rand() % 2;
bool is_there = make_test(str + char(bit + 48));
if (is_there == true)
{
flaws = 0;
str.push_back(char(bit + 48));
}
else
{
flaws++;
str.push_back(char((bit + 1) % 2 + 48));
}
}
if (n > 18)
search_back(str.length() - 18, str.length(), str);
else
search_back(0, str.length(), str);
int l = n - str.length();
for (int i = 0; i < l; i++)
{
int bit = rand() % 2;
bool is_there = make_test(char(bit + 48) + str);
if (is_there == true)
str = char(bit + 48) + str;
else
str = char((bit + 1) % 2 + 48) + str;
}
return str;
}
int main()
{
cin>> S >> t;
return 0;
}