# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401284 | victoriad | 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 "dna.h"
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <fstream>
#include <cstdlib>
using namespace std;
std::string analyse(int n, int t) {
vector<string>v;
if(n==1){
if(make_test("0"))return "0";
return "1";
}
else{
if(make_test("01")){
v.push_back("01");
}
if(make_test("00")){
v.push_back("00");
}
if(make_test("11")){
v.push_back("11");
}
if(make_test("10")){
v.push_back("10");
}
if(n==2){
return v[0];
}
int l=v.size();
if(n>2){
for(int i=0;i<l;i++){
string s=v[i];
s[2]='1';
if(make_test(s)){
v.push_back(s);
if(n==3)return s;
break;
}
s[2]=='1';
if(make_test(s)){
v.push_back(s);
if(n==3)return s;
break;
}
}
}
int x=v.size();
for(int i=l;i<x;i++){
string s=v[i];
s[3]='1';
if(make_test(s)){
v.push_back(s);
if(n==4)return s;
break;
}
s[3]=='1';
if(make_test(s)){
v.push_back(s);
if(n==4)return s;
break;
}
}
l=v.size();
for(int i=x;i<l;i++){
string s=v[i];
s[4]='1';
if(make_test(s)){
v.push_back(s);
if(n==5)return s;
break;
}
s[4]=='1';
if(make_test(s)){
v.push_back(s);
if(n==5)return s;
break;
}
}
}