oj.uz

답안 #775204

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775204 2023-07-06T08:41:20 Z anha3k25cvp Martian DNA (IOI16_dna) C++14
11 / 100
 26 ms 408 KB 
#include <bits/stdc++.h>
#include "dna.h"

using namespace std;

string analyse(int n, int t) {
    int type = 0;
    string ans;
    while (n) {
        type ^= 1;
        string S = ans;
        S += '0' + type;
        int add_right = make_test(S);
        if (add_right) {
            int lo = 1, hi = n;
            while (lo < hi) {
                if (!t)
                    break;
                t --;
                int mid = (lo + hi + 1) / 2;
                S = ans;
                for (int i = 1; i <= mid; i ++)
                    S += '0' + type;
                int val = make_test(S);
                if (val)
                    lo = mid;
                else
                    hi = mid - 1;
            }
            n -= lo;
            for (int i = 1; i <= lo; i ++)
                ans += '0' + type;
            continue;
        }
        S = "";
        S += '0' + type;
        S += ans;
        int add_left = make_test(S);
        if (add_left) {
            int lo = 1, hi = n;
            while (lo < hi) {
                if (!t)
                    break;
                t --;
                int mid = (lo + hi + 1) / 2;
                S = "";
                for (int i = 1; i <= mid; i ++)
                    S += '0' + type;
                S += ans;
                int val = make_test(S);
                if (val)
                    lo = mid;
                else
                    hi = mid - 1;
            }
            n -= lo;
            for (int i = 1; i <= lo; i ++)
                ans = char('0' + type) + ans;
        }
    }
    return ans;
}

Compilation message

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

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 64.0

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