oj.uz

Submission #317056

# Submission time Handle Problem Language Result Execution time Memory
317056 2020-10-29T01:36:25 Z daniel920712 Hidden Sequence (info1cup18_hidden) C++14
20 / 100
 400 ms 26000 KB 
#include<bits/stdc++.h>
#include "grader.h"

using namespace std;
vector < pair < vector < int > , int > > all;
vector < int > temp;
vector < int > tt;
queue < pair < vector < int > , int > > BFS;
vector < int > findSequence (int N)
{
    int i,j,ok=0,now=0;
    if(N<=10)
    {
        for(i=0;i<(1<<(N/2+1));i++)
        {
            temp.clear();
            for(j=0;j<(N/2+1);j++)
            {
                if(i&(1<<j)) temp.push_back(1);
                else temp.push_back(0);
            }
            all.push_back(make_pair(temp,isSubsequence(temp)));
        }
        for(i=0;i<(1<<N);i++)
        {
            temp.clear();
            for(j=0;j<N;j++)
            {
                if(i&(1<<j)) temp.push_back(1);
                else temp.push_back(0);
            }
            ok=1;
            for(auto j:all)
            {
                now=0;
                for(auto k:temp)
                {
                    if(now<N/2+1&&k==j.first[now]) now++;
                }
                if(now==N/2+1&&j.second==0) ok=0;
                if(now!=N/2+1&&j.second==1) ok=0;
            }
            if(ok)
            {
                //printf("aa\n");
                return temp;
            }
        }
        temp.clear();
        return temp;
    }
    else
    {
        temp.clear();
        temp.push_back(0);
        BFS.push(make_pair(temp,1));

        temp.clear();
        temp.push_back(1);
        BFS.push(make_pair(temp,1));
        while(!BFS.empty())
        {
            temp=BFS.front().first;
            if(isSubsequence(temp))
            {
                if(BFS.front().second==N) return temp;
                tt=temp;
                tt.push_back(0);
                BFS.push(make_pair(tt,BFS.front().second+1));

                tt=temp;
                tt.push_back(1);
                BFS.push(make_pair(tt,BFS.front().second+1));

            }
            BFS.pop();
        }
    }


}

Compilation message

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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct: Maximum length of a query = 5
2 Correct 2 ms 256 KB Output is correct: Maximum length of a query = 6
3 Correct 1 ms 372 KB Output is correct: Maximum length of a query = 5
4 Correct 2 ms 256 KB Output is correct: Maximum length of a query = 5
5 Correct 1 ms 256 KB Output is correct: Maximum length of a query = 4

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2320 ms 26000 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -