oj.uz

Submission #317169

# Submission time Handle Problem Language Result Execution time Memory
317169 2020-10-29T04:42:07 Z daniel920712 Hidden Sequence (info1cup18_hidden) C++14
44 / 100
 10 ms 404 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 > ans;
vector < int > findSequence (int N)
{
    int i,j,ok=0,now=0,x1=0,y1=0,x;
    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) return temp;
        }
        temp.clear();
        return temp;
    }
    else
    {
        //x=N;
        for(i=0;i<N/2+1;i++)
        {
            temp.push_back(0);
            if(!isSubsequence(temp))
            {
                x=i;
                break;
            }
        }
        temp.clear();
        if(i==N/2+1)
        {
            for(i=0;i<N/2+1;i++)
            {
                temp.push_back(1);
                if(!isSubsequence(temp))
                {
                    x=N-i;
                    break;
                }
            }
        }
        
        x1=0;
        y1=0;
        while(x1<x&&y1<N-x)
        {
            temp.clear();
            for(auto i:ans) temp.push_back(i);
            if(x-x1<=(N-x-y1))
            {
                temp.push_back(1);
                for(j=x1;j<x;j++) temp.push_back(0);
                if(isSubsequence(temp))
                {
                    y1++;
                    ans.push_back(1);
                }
                else
                {
                    x1++;
                    ans.push_back(0);
                }
            }
            else
            {
                temp.push_back(0);
                for(j=y1;j<N-x;j++) temp.push_back(1);
                if(isSubsequence(temp))
                {
                    x1++;
                    ans.push_back(0);
                }
                else
                {
                    y1++;
                    ans.push_back(1);
                }
            }
 
        }
        for(i=x1;i<x;i++) ans.push_back(0);
        for(i=y1;i<N-x;i++) ans.push_back(1);
        return ans;
    }
}

Compilation message

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:12:34: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   12 |     int i,j,ok=0,now=0,x1=0,y1=0,x;
      |                                  ^
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 256 KB Output is correct: Maximum length of a query = 5
4 Correct 3 ms 404 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
24.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 8 ms 256 KB Output is partially correct: Maximum length of a query = 165
2 Partially correct 10 ms 256 KB Output is partially correct: Maximum length of a query = 178
3 Partially correct 5 ms 380 KB Output is partially correct: Maximum length of a query = 188
4 Partially correct 6 ms 256 KB Output is partially correct: Maximum length of a query = 151
5 Partially correct 6 ms 256 KB Output is partially correct: Maximum length of a query = 187
6 Partially correct 5 ms 256 KB Output is partially correct: Maximum length of a query = 160
7 Partially correct 6 ms 256 KB Output is partially correct: Maximum length of a query = 183
8 Partially correct 5 ms 256 KB Output is partially correct: Maximum length of a query = 163
9 Partially correct 7 ms 288 KB Output is partially correct: Maximum length of a query = 199
10 Partially correct 7 ms 256 KB Output is partially correct: Maximum length of a query = 195
11 Partially correct 7 ms 256 KB Output is partially correct: Maximum length of a query = 190
12 Partially correct 5 ms 256 KB Output is partially correct: Maximum length of a query = 151
13 Partially correct 9 ms 256 KB Output is partially correct: Maximum length of a query = 200