제출 #1235664

#제출 시각아이디문제언어결과실행 시간메모리
1235664AishaHidden Sequence (info1cup18_hidden)C++20
10 / 100
273 ms408 KiB
#include "bits/stdc++.h"
#include "grader.h"

using namespace std;

vector <int> findSequence(int n) {
    for (int mask = (1 << n) - 1; mask >= 0; mask --) {
        bool ok = true;
      //  cout << mask << endl;

        for (int mask1 = 0; mask1 < (1 << n); mask1 ++) {
          //  cout << "mask1 = " << mask1 << endl;
            vector <int> a;
            for (int i = 0; i < n; i ++) {
                if (mask1 & (1 << i)) a.push_back((mask & (1 << i)) > 0);
            }

            if (a.size() == 0) continue;
            //if (a.size() > n / 2 + 1) continue;
          //  for (int i : a) cout << i << ' ';
           // cout << endl;
            ok &= isSubsequence(a);
            if (ok == false) break;
        }

        if (!ok) continue;
        vector <int> a;
        for (int i = 0; i < n; i ++) a.push_back((mask & (1 << i)) > 0);
        return a;
    }
    return {0};
}

컴파일 시 표준 에러 (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...