oj.uz

답안 #67125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
67125 2018-08-13T11:02:03 Z ege_eksi Hidden Sequence (info1cup18_hidden) C++14
10 / 100
 400 ms 452 KB 
#include<bits/stdc++.h>
#include "grader.h"

using namespace std;

vector<int> S;

bool generateAll(int n)
{
	if(S.size() == n)
	{
		if(isSubsequence(S) == true)
		{
			return true;
		}
		else
		{
			return false;
		}
	}
	
	S.push_back(0);
	
	if(generateAll(n) == true)
	{
		return true;
	}
	
	S.pop_back();
	
	S.push_back(1);
	
	if(generateAll(n) == true)
	{
		return true;
	}
	
	S.pop_back();
	
	return false;
}

vector < int > findSequence (int N)
{
	generateAll(N);
	
	return S;
}

Compilation message

hidden.cpp: In function 'bool generateAll(int)':
hidden.cpp:10:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(S.size() == n)
     ~~~~~~~~~^~~~
grader.cpp: In function 'int main()':
grader.cpp:28:43: warning: format '%d' expects argument of type 'int', but argument 3 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     fprintf (fifo_out, "%d\n", ans.size ());
                                ~~~~~~~~~~~^
grader.cpp:29:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<ans.size () && i < N; i++)
                   ~^~~~~~~~~~~~

Subtask #1
10.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 4 ms 376 KB Output is partially correct: Maximum length of a query = 8
2 Partially correct 7 ms 440 KB Output is partially correct: Maximum length of a query = 10
3 Partially correct 4 ms 440 KB Output is partially correct: Maximum length of a query = 8
4 Partially correct 3 ms 440 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 3 ms 440 KB Output is partially correct: Maximum length of a query = 7

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 685 ms 452 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -