답안 #692069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
692069 2023-02-01T06:20:15 Z maks007 Hidden Sequence (info1cup18_hidden) C++14
10 / 100
400 ms 228 KB
#include<bits/stdc++.h>
#include "grader.h"

using namespace std;

vector < int > findSequence (int N)
{
	vector <int> v;
	for(int i = 0; i < (1 << N); i ++) {
		for(int j = 0; j < N; j ++) {
			if(i & (1 << j)) v.push_back(1);
			else v.push_back(0);
		}
		if(isSubsequence(v)) return v;
		v.clear();
	}
}

Compilation message

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:17:1: warning: control reaches end of non-void function [-Wreturn-type]
   17 | }
      | ^
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++)
      |                   ~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 208 KB Output is partially correct: Maximum length of a query = 8
2 Partially correct 3 ms 228 KB Output is partially correct: Maximum length of a query = 10
3 Partially correct 2 ms 208 KB Output is partially correct: Maximum length of a query = 8
4 Partially correct 6 ms 208 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 1 ms 208 KB Output is partially correct: Maximum length of a query = 7
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1511 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -