| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 526143 | fakhoury | Martian DNA (IOI16_dna) | C++14 | 11 ms | 416 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 "dna.h"
#include <iostream>
#include <cstdlib>
#include <string>
#include <algorithm>
using namespace std;
string analyse(int n, int t) {
srand(2139);
string known, cur;
bool flipped = false;
auto merge = [](string& a, string b, bool flipped) {
if (flipped) {
reverse(b.begin(), b.end());
return b + a;
}
return a + b;
};
auto correct = [&]() {
if (flipped) {
known = merge(known, cur, flipped);
cur.clear();
return;
}
int lo = 0, hi = (int) cur.size(), mi;
while(lo < hi) {
mi = (lo + hi + 1) / 2;
if (make_test(merge(known, cur.substr(0, mi), flipped)))
lo = mi;
else hi = mi - 1;
}
known = merge(known, cur.substr(0, lo), flipped);
cur.clear();
flipped = true;
};
while((int) known.size() < n) {
cur += rand()%2 + '0';
if (make_test(merge(known, cur, flipped))) {
known = merge(known, cur, flipped);
cur.clear();
} else {
cur.back() ^= '0' ^ '1';
}
if (cur.size() == 16u || (int) known.size() + (int) cur.size() == n) {
correct();
}
}
return known;
} Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
