답안 #317045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
317045 2020-10-29T01:24:02 Z 8e7 Hidden Sequence (info1cup18_hidden) C++14
10 / 100
8 ms 256 KB
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include "grader.h"
#define ll long long
#define pii pair<int, int>
#define maxn 200005
using namespace std;

vector < int > findSequence (int n) {
	for (int i = 0;i < (1<<n);i++) {
		vector<int> v;
		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;
		}
	}
	return vector<int>();
}

Compilation message

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 3 ms 256 KB Output is partially correct: Maximum length of a query = 8
2 Partially correct 3 ms 256 KB Output is partially correct: Maximum length of a query = 10
3 Partially correct 3 ms 256 KB Output is partially correct: Maximum length of a query = 8
4 Partially correct 8 ms 256 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 1 ms 256 KB Output is partially correct: Maximum length of a query = 7
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output is not correct: The length of the returned sequence is not N
2 Halted 0 ms 0 KB -