제출 #831644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831644		OrazB	Martian DNA (IOI16_dna)	C++14	11 / 100	1091 ms	1144 KiB

dna

#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
#define pb push_back

string analyse(int n, int t) {
    vector<string> vec;
    bool tr = make_test("0");
    if (tr == true) vec.pb("0");
    tr = make_test("1");
    if (tr == true) vec.pb("1");
    
    while(1){
        if (vec[0].size() == n) return vec[0];
        vector<string> new_vec;
        for (auto i : vec){
            string a = i, b = i;
            a += '0';
            b += '1';
            bool A = make_test(a);
            bool B = make_test(b);
            if (A == true) new_vec.pb(a);
            if (B == true) new_vec.pb(b);
        }
        vec = new_vec;
    }
}         

컴파일 시 표준 에러 (stderr) 메시지

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:14:27: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   14 |         if (vec[0].size() == n) return vec[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 / 11
• Subtask 2: 0 / 25
• Subtask 3: 0 / 64