Submission #1319133

#	Time	Username	Problem	Language	Result	Execution time	Memory
1319133		ghammazhassan	Hidden Sequence (info1cup18_hidden)	C++20	34 / 100	3 ms	432 KiB

hidden

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

using namespace std;

static int maxQ = 0;
static vector < int > theRealAnswer;

vector<int> findSequence(int n){
	deque<int>a;
	int k=n/2+1;
	a.push_back(0);
	bool f;
	vector<int>l;
	while (a.size()<=k){
		l.clear();
		for (int i:a)l.push_back(i);
		f=isSubsequence(l);
		if (!f){
			a.pop_back();
			break;
		}
		a.push_back(0);
	}
	int c0=0,c1=0;
	if (!f){
		c0=a.size();
		c1=n-c0;
	}
	else{
		a.clear();
		a.push_back(1);
		while (a.size()<=k){
			l.clear();
			for (int i:a)l.push_back(i);
			f=isSubsequence(l);
			if (!f){
				a.pop_back();
				break;
			}
			a.push_back(1);
		}
		c1=a.size();
		c0=n-c1;
	}
	vector<int>o={0,1};
	if (c0>c1){
		swap(o[0],o[1]);
		swap(c0,c1);
	}
	a.clear();
	for (int i=0;i<c0;i++){
		a.push_back(o[0]);
	}
	vector<int>ans(n);
	vector<int>cn;
	while (cn.size()+a.size()<n){
		vector<int>b;
		for (int i:cn){
			b.push_back(i);
		}
		b.push_back(o[1]);
		for (int i:a){
			b.push_back(i);
		}
		f=isSubsequence(b);
		if (f){
			cn.push_back(o[1]);
		}
		else{
			cn.push_back(o[0]);
			a.pop_front();
		}
	}
	for (int i:a)cn.push_back(i);
	return cn;

}

Compilation message (stderr)

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

• Subtask 1: 10 / 20
• Subtask 2: 24 / 80