oj.uz

답안 #105163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105163 2019-04-10T18:51:57 Z stefdasca Hidden Sequence (info1cup18_hidden) C++14
0 / 100
 7 ms 256 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int>findSequence(int N)
{
    vector<int> ans (N, 0);
    vector<int> qu;
    vector<int> qu1;
    int nr0 = 0, nr1 = 0;
    while(1)
    {
        qu.push_back(0);
        qu1.push_back(1);
        if(isSubsequence(qu))
            ++nr0;
        else
        {
            nr1 = N - nr0;
            break;
        }
        if(isSubsequence(qu1))
            ++nr1;
        else
        {
            nr0 = N - nr1;
            break;
        }
    }
    if(nr0 == N)
        return ans;
    if(nr0 == 0)
    {
        for(int j = 0; j < N; ++j)
            ans[j] = 1;
        return ans;
    }
    int cntsf0 = 0, cntsf1 = 0;
    for(int i = 0; i < N; ++i)
    {
        qu.clear();
        if(cntsf0 <= cntsf1)
            for(int j = 0; j <= cntsf0; ++j)
                qu.push_back(0);
        else
            for(int j = 0; j <= cntsf1; ++j)
                qu.push_back(1);
        if(nr0 <= nr1)
            for(int j = 0; j < nr0; ++j)
                qu.push_back(0);
        else
            for(int j = 0; j < nr1; ++j)
                qu.push_back(1);
        if(isSubsequence(qu))
            if(cntsf0 <= cntsf1)
                ans[i] = 0, ++cntsf0, --nr0;
            else
                ans[i] = 1, ++cntsf1, --nr1;
        else
            if(cntsf0 <= cntsf1)
                ans[i] = 1, ++cntsf1, --nr1;
            else
                ans[i] = 0, ++cntsf0, --nr0;
    }
    return ans;
}

Compilation message

grader.cpp: In function 'int main()':
grader.cpp:28:43: warning: format '%d' expects argument of type 'int', but argument 3 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     fprintf (fifo_out, "%d\n", ans.size ());
                                ~~~~~~~~~~~^
grader.cpp:29:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<ans.size () && i < N; i++)
                   ~^~~~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output is not correct: The returned sequence does not match the hidden one
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 256 KB Output is not correct: The returned sequence does not match the hidden one
2 Halted 0 ms 0 KB -