oj.uz

답안 #114158

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
114158 2019-05-30T21:23:56 Z IVIosab Martian DNA (IOI16_dna) C++17
0 / 100
 15 ms 384 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

string analyse(int n, int t) {
    int s=0,e=n;
    while(s<e){
        int mid=s+(e-s+1)/2;
        string str="";
        for(int i=0;i<mid;i++){
            str+='0';
        }
        if(make_test(str)){
            s=mid;
        }
        else{
            e=mid-1;
        }
    }
    if(s==0){
        string tcur="";
        for(int i=0;i<n;i++){
            tcur+="1";
        }
        return tcur;
    }
    string cur=string(s,'0'),tcur;
    int cnt=0;
    while(true){
        if(cnt>s){
            break;
        }
        if(make_test(cur+"1")){
            for(int i=0;i<cnt;i++){
                cur+="0";
            }
            cnt=0;
            cur+="1";
            tcur=cur;
        }
        else{
            cnt++;
            cur+="0";
        }
    }
    e=s;
    s=0;
    while(s<e){
        int mid=s+(e-s+1)/2;
        cur=tcur;
        for(int i=0;i<mid;i++){
            cur+="0";
        }
        if(make_test(cur)){
            s=mid;
        }
        else{
            e=mid-1;
        }
    }
    for(int i=0;i<s;i++){
        tcur+="0";
    }
    while(tcur.size()<n){
        if(make_test("1"+tcur)){
            tcur="1"+tcur;
        }
        else{
            tcur="0"+tcur;
        }
    }
    return tcur;
}

Compilation message

dna.cpp: In function 'std::__cxx11::string analyse(int, int)':
dna.cpp:65:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(tcur.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
0 / 11.0

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

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 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 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Incorrect 2 ms 384 KB Wrong DNA
13 Incorrect 2 ms 384 KB Wrong DNA
14 Correct 2 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Incorrect 2 ms 384 KB Wrong DNA
18 Incorrect 2 ms 384 KB Wrong DNA
19 Incorrect 2 ms 384 KB Wrong DNA
20 Incorrect 2 ms 256 KB Wrong DNA
21 Incorrect 2 ms 384 KB Wrong DNA
22 Incorrect 2 ms 384 KB Wrong DNA
23 Incorrect 2 ms 256 KB Wrong DNA
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Incorrect 2 ms 384 KB Wrong DNA
29 Incorrect 2 ms 384 KB Wrong DNA
30 Incorrect 2 ms 384 KB Wrong DNA
31 Incorrect 2 ms 384 KB Wrong DNA
32 Incorrect 2 ms 256 KB Wrong DNA
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 256 KB Output is correct

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Incorrect 2 ms 384 KB Wrong DNA
13 Correct 2 ms 256 KB Output is correct
14 Incorrect 2 ms 256 KB Wrong DNA
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Incorrect 2 ms 256 KB Wrong DNA
18 Incorrect 2 ms 256 KB Wrong DNA
19 Incorrect 2 ms 256 KB Wrong DNA
20 Incorrect 2 ms 256 KB Wrong DNA
21 Incorrect 2 ms 384 KB Wrong DNA
22 Incorrect 10 ms 256 KB Wrong DNA
23 Incorrect 9 ms 384 KB Wrong DNA
24 Incorrect 9 ms 384 KB Wrong DNA
25 Incorrect 9 ms 256 KB Wrong DNA
26 Incorrect 9 ms 384 KB Wrong DNA
27 Incorrect 9 ms 384 KB Wrong DNA
28 Incorrect 9 ms 384 KB Wrong DNA
29 Correct 13 ms 384 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 7 ms 384 KB Output is correct
32 Correct 15 ms 384 KB Output is correct
33 Incorrect 9 ms 384 KB Wrong DNA
34 Incorrect 9 ms 384 KB Wrong DNA
35 Incorrect 10 ms 384 KB Wrong DNA
36 Incorrect 9 ms 384 KB Wrong DNA
37 Incorrect 9 ms 384 KB Wrong DNA
38 Correct 11 ms 384 KB Output is correct
39 Correct 11 ms 384 KB Output is correct