제출 #1302874

#제출 시각아이디문제언어결과실행 시간메모리
1302874yusifmHidden Sequence (info1cup18_hidden)C++20
0 / 100
1035 ms412 KiB
//pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int>findSequence(int n)
{
    vector<int>res,ans;
    while(ans.size()<n)
    {
        res.clear();
        for(int i=0;i<ans.size();i++)
        {
            res.push_back(ans[i]);
        }
        res.push_back(0);
        if(isSubsequence(res))
        {
            ans.push_back(0);
        }
        else
        {
            res.pop_back(),res.push_back(1);
            if(isSubsequence(res))
            {
                ans.push_back(1);
            }
            else
            {
                break;
            }
        }
    }
    while(ans.size()<n)
    {
        res.clear();
        for(int i=0;i<ans.size();i++)
        {
            res.push_back(ans[i]);
        }
        res.push_back(0);
        if(isSubsequence(res))
        {
            ans.push_back(0);
        }
        else
        {
            res.pop_back(),res.push_back(1);
            if(isSubsequence(res))
            {
                ans.push_back(1);
            }
        }
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

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
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...