oj.uz

Submission #525035

# Submission time Handle Problem Language Result Execution time Memory
525035 2022-02-10T14:27:14 Z Farhan_HY Hidden Sequence (info1cup18_hidden) C++14
10 / 100
 243 ms 524292 KB 
#include<bits/stdc++.h>
#include "grader.h"
#define pb push_back

using namespace std;
vector<vector<int>> prop;
vector<int> v;

void bt(int i, int n)
{
    if (i == n)
    {
        prop.pb(v);
        return;
    }
    v.pb(0);
    bt(i + 1, n);
    v.pop_back();
    v.pb(1);
    bt(i + 1, n);
    v.pop_back();
}

vector < int > findSequence (int N)
{
    bt(0, N);
    for(auto x: prop)
    {
        if (isSubsequence(x))
            return x;
    }
}

Compilation message

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
   32 | }
      | ^
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
10.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 284 KB Output is partially correct: Maximum length of a query = 8
2 Partially correct 4 ms 292 KB Output is partially correct: Maximum length of a query = 10
3 Partially correct 2 ms 200 KB Output is partially correct: Maximum length of a query = 8
4 Partially correct 1 ms 200 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 1 ms 200 KB Output is partially correct: Maximum length of a query = 7

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Runtime error 243 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -