답안 #127534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127534	2019-07-09T13:58:18 Z	Osama_Alkhodairy	Martian DNA (IOI16_dna)	C++17	36 / 100	20 ms	404 KB

dna

#include <bits/stdc++.h>
#include "dna.h"
//~ #include "grader.cpp"
using namespace std;

std::string analyse(int n, int t) {
    int l = 0, r = n;
    while(l <= r){
        int mid = (l + r) / 2;
        if(make_test(string(mid, '0'))) l = mid + 1;
        else r = mid - 1;
    }
    string ret = string(r, '0');
    while(ret.size() != n){
        if(make_test("0" + ret)) ret = '0' + ret;
        else ret = '1' + ret;
    }
    l = 0, r = n - 1;
    while(l <= r){
        int mid = (l + r) / 2;
        if(make_test(ret.substr(mid))) r = mid - 1;
        else l = mid + 1;
    }
    ret = ret.substr(l);
    while(ret.size() != n){
        if(make_test(ret + "0")) ret += '0';
        else ret += '1';
    }
    return ret;
}

Compilation message

dna.cpp: In function 'std::__cxx11::string analyse(int, int)':
dna.cpp:14:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ret.size() != n){
           ~~~~~~~~~~~^~~~
dna.cpp:25:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ret.size() != n){
           ~~~~~~~~~~~^~~~
grader.cpp: In function 'bool make_test(std::__cxx11::string)':
grader.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < p.size(); i++) {
                  ~~^~~~~~~~~~
grader.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i <= ss.size(); i++) {
                  ~~^~~~~~~~~~~~
grader.cpp:28:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (pr[i] == p.size()) {

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	256 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	404 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	3 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	252 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	380 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct

Subtask #3

0 / 64.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	348 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Incorrect	17 ms	376 KB	Too many tests
23	Incorrect	17 ms	404 KB	Too many tests
24	Incorrect	17 ms	376 KB	Too many tests
25	Incorrect	18 ms	380 KB	Too many tests
26	Incorrect	17 ms	376 KB	Too many tests
27	Correct	10 ms	376 KB	Output is correct
28	Correct	10 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	12 ms	376 KB	Output is correct
31	Incorrect	20 ms	376 KB	Too many tests
32	Correct	2 ms	376 KB	Output is correct
33	Incorrect	14 ms	376 KB	Too many tests
34	Incorrect	12 ms	376 KB	Too many tests
35	Incorrect	16 ms	376 KB	Too many tests
36	Incorrect	11 ms	376 KB	Too many tests
37	Incorrect	11 ms	376 KB	Too many tests
38	Correct	13 ms	376 KB	Output is correct
39	Correct	8 ms	376 KB	Output is correct