| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1293551 | hyakup | Martian DNA (IOI16_dna) | C++20 | 8 ms | 476 KiB |
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
string analyse(int n, int t) {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int max_wrong = 12;
int wrong_count = 0;
string s;
// Solve Prefix
while(wrong_count < max_wrong){
int bit = rng()%2;
s = (char)('0' + bit) + s;
if( make_test(s) ) wrong_count = 0;
else{
wrong_count++;
s[0] = (char)('0' + 1 - bit);
}
}
// Solve Wrong
vector<char> wrong_bits;
for( int i = 0; i < max_wrong; i++ ) wrong_bits.push_back(s[i]);
s.erase(s.begin(), s.begin() + max_wrong);
while( wrong_count > 0 ){
s = wrong_bits.back() + s;
wrong_bits.pop_back();
if( !make_test(s) ) break;
wrong_count--;
}
s.erase(s.begin());
// Solve Suffix
while( s.size() < n ){
s.push_back('0');
if( !make_test(s) ) s.back() = '1';
}
return s;
}
컴파일 시 표준 에러 (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... | ||||
