oj.uz

답안 #412205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
412205 2021-05-26T15:39:09 Z nxteru Martian DNA (IOI16_dna) C++14
36 / 100
 1000 ms 804 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

string analyse(int n, int t) {
    string ans;
    bool st=false;
    int m=t-n;
    while(n-ans.size()>=m+ans.size()-1){
        if((m-2)*(m-1)/2>=n-ans.size()){
            st=true;
            break;
        }
        m--;
        string p;
        for(int i=0;i<m+ans.size()-1;i++)p+='0';
        if(!make_test(p))break;
        else ans=p;
    }
    string y;
    if(st)m--;
    while(ans.size()<n){
        if(y.size()==m-1){
            if(st){
                if(make_test(ans+y)){
                    m--;
                    ans+=y;
                    y="";
                    continue;
                }
            }
            for(int i=0;i<m-2;i++){
                if(!make_test(ans+'0'))break;
                ans+='0';
            }
            break;
        }else{
            if(make_test(ans+y+'1')){
                ans=ans+y+'1';
                y="";
            }else y+='0';
        }
    }
    while(ans.size()<n){
        if(make_test('1'+ans))ans='1'+ans;
        else ans='0'+ans;
    }
    return ans;
}

Compilation message

dna.cpp: In function 'std::string analyse(int, int)':
dna.cpp:10:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |         if((m-2)*(m-1)/2>=n-ans.size()){
      |            ~~~~~~~~~~~~~^~~~~~~~~~~~~~
dna.cpp:16:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         for(int i=0;i<m+ans.size()-1;i++)p+='0';
      |                     ~^~~~~~~~~~~~~~~
dna.cpp:22:21: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |     while(ans.size()<n){
      |           ~~~~~~~~~~^~
dna.cpp:23:20: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   23 |         if(y.size()==m-1){
      |            ~~~~~~~~^~~~~
dna.cpp:44:21: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |     while(ans.size()<n){
      |           ~~~~~~~~~~^~
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 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 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 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 288 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 288 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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 248 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 268 KB Output is correct
11 Correct 2 ms 280 KB Output is correct
12 Correct 2 ms 280 KB Output is correct
13 Correct 2 ms 272 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 288 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 292 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 292 KB Output is correct
24 Correct 1 ms 292 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 372 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 4 ms 292 KB Output is correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 4 ms 364 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 5 ms 460 KB Output is correct
14 Correct 5 ms 332 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 6 ms 332 KB Output is correct
17 Correct 6 ms 368 KB Output is correct
18 Correct 5 ms 332 KB Output is correct
19 Correct 5 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Correct 5 ms 332 KB Output is correct
22 Correct 11 ms 296 KB Output is correct
23 Correct 13 ms 380 KB Output is correct
24 Correct 13 ms 296 KB Output is correct
25 Correct 13 ms 332 KB Output is correct
26 Correct 11 ms 332 KB Output is correct
27 Correct 7 ms 332 KB Output is correct
28 Correct 7 ms 332 KB Output is correct
29 Execution timed out 1078 ms 804 KB Time limit exceeded
30 Correct 7 ms 332 KB Output is correct
31 Correct 7 ms 332 KB Output is correct
32 Execution timed out 1084 ms 536 KB Time limit exceeded
33 Correct 11 ms 332 KB Output is correct
34 Correct 9 ms 332 KB Output is correct
35 Correct 9 ms 332 KB Output is correct
36 Correct 9 ms 400 KB Output is correct
37 Correct 10 ms 408 KB Output is correct
38 Execution timed out 1083 ms 712 KB Time limit exceeded
39 Execution timed out 1092 ms 576 KB Time limit exceeded