제출 #1174621

#제출 시각아이디문제언어결과실행 시간메모리
1174621hengliaoHidden Sequence (info1cup18_hidden)C++20
0 / 100
2 ms436 KiB
#include<bits/stdc++.h> #include "grader.h" using namespace std; #define F first #define S second #define pb push_back #define vll vector<ll> #define pll pair<ll, ll> typedef int ll; vector < int > findSequence (int n) { vector < int > ans (n, 0); ll cnt0=0, cnt1=0; vll q; while(cnt0<n){ q.pb(0); if(isSubsequence(q)){ cnt0++; } else{ break; } } cnt1=n-cnt0; for(ll i=0;i<n;i++){ for(ll j=0;j<2;j++){ q.clear(); for(ll k=0;k<i;k++){ q.pb(ans[k]); } q.pb(j); if(j==0){ for(ll rep=0;rep<cnt1;rep++){ q.pb(1); } } else{ for(ll rep=0;rep<cnt0;rep++){ q.pb(0); } } if(isSubsequence(q)){ ans[i]=j; if(j==0) cnt0--; else cnt1--; break; } else{ ans[i]=j^1; if(j==0) cnt1--; else cnt0--; break; } } } 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...