oj.uz

답안 #794850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
794850 2023-07-27T01:14:49 Z bane Martian DNA (IOI16_dna) C++17
36 / 100
 13 ms 488 KB 
        #include <bits/stdc++.h>
        #include "dna.h"
        using namespace std;
         
         
        string analyse(int n, int t) {
         
            int oi = 0, io = 0, ii = 0, oo = 0;
            if (n == 1){
                if (make_test("1"))return "1";
                else return "0";
            }
            oi = make_test("01");
            io = make_test("10");
            ii = make_test("11");
            oo = make_test("00");
            string ans = "";
     
            map<string,int>flag;
            if (oi)flag["01"] = 1;
            if (io)flag["10"] = 1;
            if (ii)flag["11"] = 1;
            if (oo)flag["00"] = 1;
     
            if (oi){
                ans += "01";
            }else if(ii){
                ans += "11";
            }
            else if(oo){
                ans +="00";
            }
            else{
                 ans += "10";
            }
            t-=4;
            while((int)ans.size() < n){
                string a1,a2,a3,a4;
                
                    a1 = ans + "10";
                    a2 = ans + "11";
                    a3 = ans + "00";
                    a4 = ans + "01";
                    string ck = "";
                    ck += ans.back();
                    ck += '1';
                    if (io && flag[ck] && make_test(a1)){
                        ans = a1;
                        continue;
                    }
                    if (flag[ck] && ii && make_test(a2)){
                        ans = a2;
                        continue;
                    }
                    ck[1] = '0';
                    if (flag[ck] &&oo && make_test(a3)){
                        ans = a3;
                        continue;
                    }
                    if (flag[ck] &&oi && make_test(a4)){
                        ans = a4;
                        continue;
                    }
                    a1 = ans + "1";
                    ck[1] = '1';
                    if (flag[ck] && make_test(a1)){
                        ans = a1;
                        break;
                    }
                    ck[1] = '0';
                    a1 = ans + "0";
                    if (flag[ck] && make_test(a1)){
                        ans = a1;
                        break;
                    }
                    break;
                
            }
           
            while((int)ans.size() < n){
                string a1,a2,a3,a4;
                a1 = "10" + ans;
                a2 = "01" + ans;
                a3 = "11" + ans;
                a4 = "00" + ans;
                string ck = "";
                ck += '0';
                ck += ans[0];
                    if (flag[ck] && io){
                        if (make_test(a1)){
                            ans = a1;
                            continue; 
                       }
                    }
                    ck[0] = '1'; 
                    if (oi){
                        if (make_test(a2)){
                            ans = a2;
                            continue;
                        }
                    }

                    if (ii){
                        if (make_test(a3)){
                            ans = a3;
                            continue;
                        }
                    }
                    ck[1] = '0';
                    if (oo){
                        if (make_test(a4)){
                            ans = a4;
                            continue;
                        }
                    }
                    a1 = "1" + ans;
                    if (make_test(a1))return a1;
                    else a1 = "0" + ans;
                    return a1;
                
            }
            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 1 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 0 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 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
25.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 0 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 1 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 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 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
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 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 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 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 Incorrect 13 ms 468 KB Too many tests
23 Incorrect 11 ms 476 KB Too many tests
24 Incorrect 13 ms 468 KB Too many tests
25 Incorrect 8 ms 488 KB Too many tests
26 Incorrect 10 ms 484 KB Too many tests
27 Correct 3 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 3 ms 484 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Incorrect 6 ms 468 KB Too many tests
34 Correct 5 ms 468 KB Output is correct
35 Correct 4 ms 468 KB Output is correct
36 Incorrect 5 ms 476 KB Too many tests
37 Incorrect 5 ms 468 KB Too many tests
38 Correct 7 ms 468 KB Output is correct
39 Correct 3 ms 468 KB Output is correct