Submission #54934

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
54934	2018-07-05T13:22:24 Z	luciocf	Martian DNA (IOI16_dna)	C++14	0 / 100	21 ms	1440 KB

#include <bits/stdc++.h>
#include "dna.h"

using namespace std;

int n;

string s;

string get(int k)
{
    string ans = "";
    for (int i = 1; i <= k; i++)
        ans += "0";
    return ans;
}

string get2(int k)
{
    string ans = "";
    for (int i = 1; i <= k; i++)
        ans += s[i];
    return ans;
}

int busca(void)
{
    int ini = 1, fim = n;
    while (ini <= fim)
    {
        int mid = (ini+fim)>>1;

        if (make_test(get(mid))) ini = mid+1;
        else fim = mid-1;
    }
    return fim;
}

int busca2(void)
{
    int ini = 1, fim = n;
    while (ini <= fim)
    {
        int mid = (ini+fim)>>1;

        if (make_test(get2(mid))) ini = mid+1;
        else fim = mid-1;
    }
    return fim;
}

string analyse(int k, int t)
{
    n = k;

    int size = 0;
    s = "";

    if (!make_test("0"))
    {
        for (int i = 1; i <= n; i++) s += "1";
        return s;
    }

    int qtd = busca();
    size = qtd;
    s = get(qtd);

    while (size < n)
    {
        if (!make_test(s+"1"))
        {
            int x = 0;
            for (int i = s.size()-1; i >= 0; i--)
            {
                if (s[i] != '0') break;
                x++;
            }
            if (x > qtd) break;
            s += "0", size++;
        }
        else s += "1", size++;
    }
    int pos = busca2();

    string ans = get2(pos);
    size = ans.size();

    if (size == n) return s;

    while (size < n)
    {
        if (make_test("1"+ans)) ans = "1"+ans;
        else ans = "0"+ans;
        size++;
    }
    return ans;
}

Compilation message

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
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	488 KB	Output is correct
3	Correct	2 ms	728 KB	Output is correct
4	Correct	2 ms	728 KB	Output is correct
5	Correct	2 ms	728 KB	Output is correct
6	Correct	2 ms	728 KB	Output is correct
7	Correct	2 ms	728 KB	Output is correct
8	Correct	2 ms	728 KB	Output is correct
9	Correct	3 ms	844 KB	Output is correct
10	Incorrect	3 ms	844 KB	Wrong DNA
11	Correct	2 ms	844 KB	Output is correct
12	Correct	2 ms	844 KB	Output is correct
13	Correct	2 ms	884 KB	Output is correct
14	Correct	3 ms	884 KB	Output is correct
15	Correct	3 ms	884 KB	Output is correct
16	Correct	2 ms	884 KB	Output is correct
17	Correct	2 ms	884 KB	Output is correct
18	Correct	3 ms	884 KB	Output is correct
19	Correct	2 ms	884 KB	Output is correct
20	Incorrect	3 ms	904 KB	Wrong DNA
21	Correct	3 ms	904 KB	Output is correct
22	Correct	3 ms	904 KB	Output is correct
23	Correct	3 ms	904 KB	Output is correct
24	Correct	3 ms	904 KB	Output is correct

Subtask #2
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	948 KB	Output is correct
2	Correct	3 ms	948 KB	Output is correct
3	Correct	2 ms	952 KB	Output is correct
4	Correct	3 ms	960 KB	Output is correct
5	Correct	2 ms	960 KB	Output is correct
6	Correct	3 ms	964 KB	Output is correct
7	Correct	3 ms	968 KB	Output is correct
8	Correct	3 ms	972 KB	Output is correct
9	Correct	2 ms	976 KB	Output is correct
10	Correct	2 ms	1080 KB	Output is correct
11	Correct	3 ms	1080 KB	Output is correct
12	Correct	3 ms	1080 KB	Output is correct
13	Correct	2 ms	1080 KB	Output is correct
14	Correct	2 ms	1080 KB	Output is correct
15	Correct	2 ms	1080 KB	Output is correct
16	Correct	3 ms	1080 KB	Output is correct
17	Correct	3 ms	1080 KB	Output is correct
18	Correct	3 ms	1080 KB	Output is correct
19	Correct	3 ms	1080 KB	Output is correct
20	Correct	2 ms	1080 KB	Output is correct
21	Correct	3 ms	1080 KB	Output is correct
22	Correct	3 ms	1080 KB	Output is correct
23	Correct	3 ms	1080 KB	Output is correct
24	Correct	2 ms	1080 KB	Output is correct
25	Correct	2 ms	1080 KB	Output is correct
26	Correct	3 ms	1080 KB	Output is correct
27	Correct	3 ms	1080 KB	Output is correct
28	Correct	4 ms	1080 KB	Output is correct
29	Correct	3 ms	1080 KB	Output is correct
30	Correct	2 ms	1080 KB	Output is correct
31	Incorrect	3 ms	1080 KB	Wrong DNA
32	Correct	2 ms	1080 KB	Output is correct
33	Correct	3 ms	1080 KB	Output is correct
34	Correct	2 ms	1200 KB	Output is correct

Subtask #3
0 / 64.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	1200 KB	Output is correct
2	Correct	3 ms	1200 KB	Output is correct
3	Correct	3 ms	1200 KB	Output is correct
4	Correct	3 ms	1332 KB	Output is correct
5	Correct	2 ms	1332 KB	Output is correct
6	Correct	3 ms	1332 KB	Output is correct
7	Correct	2 ms	1332 KB	Output is correct
8	Correct	3 ms	1332 KB	Output is correct
9	Correct	2 ms	1332 KB	Output is correct
10	Correct	2 ms	1332 KB	Output is correct
11	Correct	2 ms	1332 KB	Output is correct
12	Correct	2 ms	1332 KB	Output is correct
13	Correct	2 ms	1332 KB	Output is correct
14	Correct	2 ms	1332 KB	Output is correct
15	Incorrect	3 ms	1332 KB	Wrong DNA
16	Correct	2 ms	1332 KB	Output is correct
17	Correct	4 ms	1332 KB	Output is correct
18	Correct	3 ms	1332 KB	Output is correct
19	Correct	2 ms	1332 KB	Output is correct
20	Correct	3 ms	1332 KB	Output is correct
21	Correct	3 ms	1332 KB	Output is correct
22	Correct	14 ms	1340 KB	Output is correct
23	Correct	17 ms	1344 KB	Output is correct
24	Correct	13 ms	1348 KB	Output is correct
25	Correct	21 ms	1352 KB	Output is correct
26	Correct	20 ms	1356 KB	Output is correct
27	Correct	10 ms	1360 KB	Output is correct
28	Correct	10 ms	1364 KB	Output is correct
29	Correct	3 ms	1368 KB	Output is correct
30	Correct	3 ms	1368 KB	Output is correct
31	Correct	9 ms	1376 KB	Output is correct
32	Correct	3 ms	1380 KB	Output is correct
33	Correct	12 ms	1384 KB	Output is correct
34	Correct	11 ms	1388 KB	Output is correct
35	Correct	11 ms	1392 KB	Output is correct
36	Correct	11 ms	1396 KB	Output is correct
37	Correct	12 ms	1432 KB	Output is correct
38	Correct	8 ms	1436 KB	Output is correct
39	Correct	8 ms	1440 KB	Output is correct

Submission #54934

Compilation message

Subtask #1 0 / 11.0

Subtask #2 0 / 25.0

Subtask #3 0 / 64.0

Subtask #1
0 / 11.0

Subtask #2
0 / 25.0

Subtask #3
0 / 64.0