oj.uz

Submission #162294

# Submission time Handle Problem Language Result Execution time Memory
162294 2019-11-07T13:46:17 Z popovicirobert Martian DNA (IOI16_dna) C++14
36 / 100
 16 ms 508 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

std::string analyse(int n, int t) {
    srand(time(NULL));

    if(make_test("0") == 0) {
        string sol;
        sol.resize(n);
        fill(sol.begin(), sol.end(), '1');
        return sol;
    }

    string sol = "0";
    int cnt = 0;

    while(sol.size() < n) {
        sol.push_back(rand() % 2 + '0');
        if(make_test(sol)) {
            cnt = 0;
            continue;
        }
        sol.back() = '0' + ((sol.back() - '0') ^ 1);
        cnt++;
        if(cnt == 12) {
            break;
        }
    }
    while(make_test(sol) == 0) {
        sol.pop_back();
    }
    while(sol.size() < n) {
        sol = "0" + sol;
        if(make_test(sol)) {
            continue;
        }
        sol[0] = '1';
    }
    return sol;
}

Compilation message

dna.cpp: In function 'std::__cxx11::string analyse(int, int)':
dna.cpp:19:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(sol.size() < n) {
           ~~~~~~~~~~~^~~
dna.cpp:34:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(sol.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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 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 380 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 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 380 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 252 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 376 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 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 272 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 256 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 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 6 ms 508 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 252 KB Output is correct
24 Correct 2 ms 256 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 256 KB Output is correct
30 Correct 12 ms 376 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct

Subtask #3
0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 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 380 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 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 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 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 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 11 ms 376 KB Output is correct
23 Incorrect 16 ms 376 KB Too many tests
24 Correct 14 ms 376 KB Output is correct
25 Correct 16 ms 376 KB Output is correct
26 Incorrect 13 ms 376 KB Too many tests
27 Correct 8 ms 376 KB Output is correct
28 Correct 9 ms 376 KB Output is correct
29 Correct 10 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 10 ms 376 KB Output is correct
32 Correct 10 ms 376 KB Output is correct
33 Incorrect 11 ms 376 KB Too many tests
34 Incorrect 11 ms 376 KB Too many tests
35 Incorrect 11 ms 376 KB Too many tests
36 Correct 10 ms 376 KB Output is correct
37 Correct 10 ms 376 KB Output is correct
38 Incorrect 11 ms 376 KB Too many tests
39 Incorrect 12 ms 376 KB Too many tests