oj.uz

답안 #410850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
410850 2021-05-23T20:18:30 Z nichke Hidden Sequence (info1cup18_hidden) C++14
10 / 100
 400 ms 328 KB 
#include <bits/stdc++.h>
#include <grader.h>
using namespace std;

vector<int> vv;

bool isSubsequence(vector<int> vi);

vector<int> findSequence(int N) {
	vector<int> v;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= v.size(); j++) {
			vv = v;
			vv.insert(vv.begin() + j, 0);
			if (isSubsequence(vv)) {
				v = vv;
				break;
			}
			vv = v;
			vv.insert(vv.begin() + j, 1);
			if (isSubsequence(vv)) {
				v = vv;
				break;
			}
		}
	}
	return v;
}

Compilation message

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:12:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |   for (int j = 0; j <= v.size(); j++) {
      |                   ~~^~~~~~~~~~~
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
10.0 / 20.0

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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 320 ms 328 KB Output is partially correct: Maximum length of a query = 165
2 Execution timed out 402 ms 304 KB Time limit exceeded
3 Halted 0 ms 0 KB -