답안 #973647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
973647	2024-05-02T08:59:09 Z	penguin133	Hidden Sequence (info1cup18_hidden)	C++17	0 / 100	3 ms	696 KB

hidden

#include <bits/stdc++.h>
using namespace std;
#include "grader.h"
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

vector < int > findSequence (int N)
{
	vector <int> x;
	for(int i = 0; i < N / 2 + 1; i++)x.push_back(0);
	if(isSubsequence(x)){
		int ones = 0;
		while(1){
			x.clear();
			for(int i = 0; i < ones + 1; i++)x.push_back(1);
			if(isSubsequence(x))ones++;
			else break;
		}
		vector <int> ans;
		int num0 = 0, num1 = 0;
		for(int i = 0; i < ones; i++){
			int zrs = 0;
			while(1){
				vector <int> qry;
				if(num1 < num0)for(int j = 0; j < i; j++)qry.push_back(1);
				else {
					for(int j = 0; j < num0; j++)qry.push_back(0);
				}
				for(int j = 0; j < zrs + 1; j++)qry.push_back(0);
				for(int j = 0; j < ones - i; j++)qry.push_back(1);
				if(qry.size() <= N && isSubsequence(qry))zrs++;
				else break;
			}
			for(int j = 0; j < zrs; j++)ans.push_back(0);
			ans.push_back(1);
			num0 += zrs; num1 += 1;
		}
		while(ans.size() < N)ans.push_back(0);
		return ans;
	}
	else{
		int ones = 0;
		while(1){
			x.clear();
			for(int i = 0; i < ones + 1; i++)x.push_back(0);
			if(isSubsequence(x))ones++;
			else break;
		}
		vector <int> ans;
		int num0 = 0, num1 = 0;
		for(int i = 0; i < ones; i++){
			int zrs = 0;
			while(1){
				vector <int> qry;
				if(num1 < num0)for(int j = 0; j < i; j++)qry.push_back(1);
				else {
					for(int j = 0; j < num0; j++)qry.push_back(0);
				}
				for(int j = 0; j < zrs + 1; j++)qry.push_back(1);
				for(int j = 0; j < ones - i; j++)qry.push_back(0);
				if(qry.size() <= N && isSubsequence(qry))zrs++;
				else break;
			}
			for(int j = 0; j < zrs; j++)ans.push_back(1);
			ans.push_back(0);
			num0++; num1 += zrs;
		}
		while(ans.size() < N)ans.push_back(1);
		return ans;
	}
}

Compilation message

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:38:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |     if(qry.size() <= N && isSubsequence(qry))zrs++;
      |        ~~~~~~~~~~~^~~~
hidden.cpp:45:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |   while(ans.size() < N)ans.push_back(0);
      |         ~~~~~~~~~~~^~~
hidden.cpp:68:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   68 |     if(qry.size() <= N && isSubsequence(qry))zrs++;
      |        ~~~~~~~~~~~^~~~
hidden.cpp:75:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   75 |   while(ans.size() < N)ans.push_back(1);
      |         ~~~~~~~~~~~^~~
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

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	Output is not correct: The returned sequence does not match the hidden one
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	2 ms	696 KB	Output is partially correct: Maximum length of a query = 86
2	Partially correct	2 ms	696 KB	Output is partially correct: Maximum length of a query = 92
3	Incorrect	3 ms	444 KB	Output is not correct: The returned sequence does not match the hidden one
4	Halted	0 ms	0 KB	-