oj.uz

답안 #973661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973661 2024-05-02T09:11:39 Z penguin133 Hidden Sequence (info1cup18_hidden) C++17
15 / 100
 3 ms 692 KB 
#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;
				for(int j = 0; j < num1; j++)qry.push_back(1);
				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)break;
				else if(i != ones - 1 && qry.size() > N / 2 + 3){
					qry.clear();
					for(int j = 0; j < num0; j++)qry.push_back(0);
					qry.push_back(1); qry.push_back(1);
					int tot = N - ones - num1 - (zrs + 1);
					if(tot < 0)break;
					for(int j = 0; j < tot; j++)qry.push_back(0);
				}
				if(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;
				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)break;
				else if(i != ones - 1 && qry.size() > N / 2 + 3){
					qry.clear();
					for(int j = 0; j < num1; j++)qry.push_back(1);
					qry.push_back(0); qry.push_back(0);
					int tot = N - ones - num1 - (zrs + 1);
					if(tot < 0)break;
					for(int j = 0; j < tot; j++)qry.push_back(1);
				}
				if(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:35:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |     if(qry.size() > N)break;
      |        ~~~~~~~~~~~^~~
hidden.cpp:36:41: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     else if(i != ones - 1 && qry.size() > N / 2 + 3){
      |                              ~~~~~~~~~~~^~~~~~~~~~~
hidden.cpp:51:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |   while(ans.size() < N)ans.push_back(0);
      |         ~~~~~~~~~~~^~~
hidden.cpp:71:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |     if(qry.size() > N)break;
      |        ~~~~~~~~~~~^~~
hidden.cpp:72:41: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |     else if(i != ones - 1 && qry.size() > N / 2 + 3){
      |                              ~~~~~~~~~~~^~~~~~~~~~~
hidden.cpp:87:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   87 |   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
15.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 7
2 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 8
3 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 7
4 Correct 0 ms 344 KB Output is correct: Maximum length of a query = 5
5 Partially correct 0 ms 596 KB Output is partially correct: Maximum length of a query = 6

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 692 KB Output is not correct: The length of the returned sequence is not N
2 Halted 0 ms 0 KB -