| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 592825 | tarche | Martian DNA (IOI16_dna) | C++17 | 13 ms | 468 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 <bits/stdc++.h>
using namespace std;
int lengthLongestZeroChain(int n) {
int low = 0, high = n;
while (low + 1 < high) {
int mid = (low + high) / 2;
string s(mid, '0');
if (make_test(s)) {
low = mid;
} else {
high = mid;
}
}
return low;
}
void findStringEnding(string& s, string& chain) {
int n = (int)chain.length();
int low = 0, high = n;
while (low + 1 < high) {
int mid = (low + high) / 2;
chain = string(mid, '0');
if (make_test(s + chain)) {
low = mid;
} else {
high = mid;
}
}
s += string(low, '0');
}
void growSubstringRight(string& s, string& chain) {
if (make_test(s + chain + '1')) {
s += chain + '1';
chain = "";
} else {
chain += '0';
}
}
void growSubstringLeft(string& s) {
if (make_test('1' + s)) {
s = "1" + s;
} else {
s = "0" + s;
}
}
string analyse(int n, int t) {
int zeroChainLen = lengthLongestZeroChain(n);
string curr(zeroChainLen, '0'), chain = "";
while ((int)chain.length() <= zeroChainLen && (int)curr.length() < n) {
growSubstringRight(curr, chain);
}
findStringEnding(curr, chain);
while ((int)curr.length() < n) {
growSubstringLeft(curr);
}
return curr;
}
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... | ||||
