oj.uz

Submission #433421

# Submission time Handle Problem Language Result Execution time Memory
433421 2021-06-19T18:21:36 Z Kanaifu Martian DNA (IOI16_dna) C++14
100 / 100
 12 ms 392 KB 
#include <bits/stdc++.h>
#include "dna.h"
#include <cstdlib>
//#include "grader.cpp"

using namespace std;

mt19937 randseed(time(nullptr));

std::string analyse(int n, int t)
{
    bool suff = false;
    int last = 0;
    string sub = "";
    string las = "";
    int calls = 0;
    while ((int)las.size()<n)
    {
        //cout<<las<<" "<<sub<<"\n";
        if (suff)
        {
            sub = "0" + sub;
            if (!make_test(sub))
            {
                sub[0] = '1';
            }
            las = sub;
            continue;
        }
        int koristi =  randseed() % 2;
        if (koristi)
        {
            sub += "1";
            if (make_test(sub))
            {
                las = sub;
                last = 0;
            }
            else
            {
                sub.back()= '0';
                last++;
                if (last>6)
                {
                    int ind = las.size();
                    if (make_test(las+sub[ind]))
                    {
                        las+=sub[ind];
                        last--;
                        continue;
                    }
                    suff=true;
                    sub = las;
                    continue;
                }
            }
        }
        else
        {
            sub += "0";
            if (make_test(sub))
            {
                las = sub;
                last = 0;
            }
            else
            {
                sub.back() = '1';
                last++;
                if (last>6)
                {
                    int ind = las.size();
                    if (make_test(las+sub[ind]))
                    {
                        las+=sub[ind];
                        last--;
                        continue;
                    }
                    suff=true;
                    sub = las;
                    continue;
                }
            }
        }
        //cout<<las<<" ";
    }
    return las;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:16:9: warning: unused variable 'calls' [-Wunused-variable]
   16 |     int calls = 0;
      |         ^~~~~
grader.cpp: In function 'bool make_test(std::string)':
grader.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for (int i = 0; i < p.size(); i++) {
      |                  ~~^~~~~~~~~~
grader.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for (int i = 1; i <= ss.size(); i++) {
      |                  ~~^~~~~~~~~~~~
grader.cpp:28:13: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   if (pr[i] == p.size()) {

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct

Subtask #3
64.0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 9 ms 332 KB Output is correct
23 Correct 8 ms 368 KB Output is correct
24 Correct 12 ms 368 KB Output is correct
25 Correct 10 ms 332 KB Output is correct
26 Correct 10 ms 392 KB Output is correct
27 Correct 7 ms 332 KB Output is correct
28 Correct 7 ms 380 KB Output is correct
29 Correct 8 ms 332 KB Output is correct
30 Correct 8 ms 332 KB Output is correct
31 Correct 8 ms 380 KB Output is correct
32 Correct 8 ms 368 KB Output is correct
33 Correct 10 ms 332 KB Output is correct
34 Correct 8 ms 332 KB Output is correct
35 Correct 8 ms 332 KB Output is correct
36 Correct 9 ms 332 KB Output is correct
37 Correct 7 ms 332 KB Output is correct
38 Correct 10 ms 332 KB Output is correct
39 Correct 10 ms 336 KB Output is correct