제출 #105153

#제출 시각아이디문제언어결과실행 시간메모리
105153stefdascaHidden Sequence (info1cup18_hidden)C++14
54 / 100
11 ms384 KiB
#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; } } int cntsf0 = 0, cntsf1 = 0; int str = 0; for(int i = 0; i < N; ++i) { qu.clear(); if(cntsf0 - str * (i > 0 && ans[i-1] == 0)) for(int j = 0; j < cntsf0 - str * (i > 0 && ans[i-1] == 0); ++j) qu.push_back(0); else for(int j = 0; j < cntsf1 - str * (i > 0 && ans[i-1] == 1); ++j) qu.push_back(1); for(int j = 0; j < str; ++j) qu.push_back(ans[i-1]); if(nr0 <= nr1) { qu.push_back(1); for(int j = 0; j < nr0; ++j) qu.push_back(0); if(isSubsequence(qu)) ans[i] = 1, ++cntsf1, --nr1; else ans[i] = 0, ++cntsf0, --nr0; } else { qu.push_back(0); for(int j = 0; j < nr1; ++j) qu.push_back(1); if(isSubsequence(qu)) ans[i] = 0, ++cntsf0, --nr0; else ans[i] = 1, ++cntsf1, --nr1; } if(i == 0) str = 1; else if(ans[i] == ans[i-1]) ++str; else str = 1; } return ans; }

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

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