Submission #71446

#	Time	Username	Problem	Language	Result	Execution time	Memory
71446		memikakizaki	Hidden Sequence (info1cup18_hidden)	C++14	10 / 100	416 ms	556 KiB

hidden

#include<bits/stdc++.h>
#include "grader.h"

using namespace std;

vector<int> findSequence(int n) {
	vector<int> curr;
	while(curr.size() < n) {
		for(int i = 0; i < curr.size()+1; i++) {
			curr.insert(curr.begin() + i, 0);
			if(!isSubsequence(curr)) {
				curr.erase(curr.begin() + i);
				curr.insert(curr.begin() + i, 1);
				if(!isSubsequence(curr)) {
					curr.erase(curr.begin() + i);
				} else break;
			} else break;
		}
	}
	return curr;
}

Compilation message (stderr)

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:8:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(curr.size() < n) {
        ~~~~~~~~~~~~^~~
hidden.cpp:9:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < curr.size()+1; i++) {
                  ~~^~~~~~~~~~~~~~~
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 / 20
• Subtask 2: 0 / 80