oj.uz

답안 #770079

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770079 2023-06-30T18:11:04 Z Andrei Hidden Sequence (info1cup18_hidden) C++17
0 / 100
 4 ms 296 KB 
#include <bits/stdc++.h>

#include "grader.h"

using namespace std;

vector <int> aux;

int cntPref[2];
int cntSuff[2];

vector <int> ans;

vector <int> findSequence(int n)
{
    aux.push_back(1);
    while((int)aux.size()<=n)
    {
        if(isSubsequence(aux)==1)
            cntSuff[1]++;
        aux.push_back(1);
    }

    cntSuff[0]=n-cntSuff[1];

    while((int)ans.size()<n)
    {
        if(cntPref[0]+1+cntSuff[1]<cntPref[1]+1+cntSuff[0])
        {
            aux.clear();
            for(int i=1; i<=cntPref[0]+1; i++)
                aux.push_back(0);
            for(int i=1; i<=cntSuff[1]; i++)
                aux.push_back(1);

            if(isSubsequence(aux)==1)
                ans.push_back(0);
            else
                ans.push_back(1);
        }
        else
        {
            aux.clear();
            for(int i=1; i<=cntPref[1]+1; i++)
                aux.push_back(0);
            for(int i=1; i<=cntSuff[0]; i++)
                aux.push_back(1);

            if(isSubsequence(aux)==1)
                ans.push_back(1);
            else
                ans.push_back(0);
        }

        cntPref[ans.back()]++;
        cntSuff[ans.back()]--;
    }

    return ans;
}

Compilation message

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

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 296 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 4 ms 208 KB Output is not correct: The returned sequence does not match the hidden one
2 Halted 0 ms 0 KB -