oj.uz

답안 #973487

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973487 2024-05-02T05:31:14 Z shoryu386 Hidden Sequence (info1cup18_hidden) C++17
34 / 100
 4 ms 956 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

vector < int > findSequence (int N){
	
	vector<int> test;
	int numOnes = 0;
	for (int x = 1; x <= N; x++){
		test.push_back(1);
		
		if (isSubsequence(test)){
			numOnes++;
		}
		else break;
	}
	
	int filler[numOnes+1]; memset(filler, 0, sizeof(filler));
	test.clear();
	
	for (int x = 0; x <= numOnes; x++){
		while (true){
			filler[x]++;
			test.clear();
			for (int y = 0; y < numOnes; y++){
				for (int z = 0; z < filler[y]; z++){
					test.push_back(0);
				}
				test.push_back(1);
			}
			for (int z = 0; z < filler[numOnes]; z++){
				test.push_back(0);
			}
			
			if (test.size() <= N && isSubsequence(test)){
				continue;
			}
			else {filler[x]--; break;}
		}
	}
	
	test.clear();
	for (int y = 0; y < numOnes; y++){
		for (int z = 0; z < filler[y]; z++){
			test.push_back(0);
		}
		test.push_back(1);
	}
	for (int z = 0; z < filler[numOnes]; z++){
		test.push_back(0);
	}
			
	
	return test;
	
	
	
}

Compilation message

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:36:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |    if (test.size() <= N && isSubsequence(test)){
      |        ~~~~~~~~~~~~^~~~
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 0 ms 344 KB Output is partially correct: Maximum length of a query = 8
2 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 10
3 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 8
4 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 7

Subtask #2
24.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 3 ms 444 KB Output is partially correct: Maximum length of a query = 165
2 Partially correct 3 ms 944 KB Output is partially correct: Maximum length of a query = 178
3 Partially correct 4 ms 704 KB Output is partially correct: Maximum length of a query = 190
4 Partially correct 3 ms 688 KB Output is partially correct: Maximum length of a query = 153
5 Partially correct 4 ms 704 KB Output is partially correct: Maximum length of a query = 188
6 Partially correct 3 ms 440 KB Output is partially correct: Maximum length of a query = 172
7 Partially correct 4 ms 956 KB Output is partially correct: Maximum length of a query = 192
8 Partially correct 4 ms 688 KB Output is partially correct: Maximum length of a query = 164
9 Partially correct 4 ms 948 KB Output is partially correct: Maximum length of a query = 200
10 Partially correct 4 ms 956 KB Output is partially correct: Maximum length of a query = 199
11 Partially correct 3 ms 952 KB Output is partially correct: Maximum length of a query = 190
12 Partially correct 4 ms 696 KB Output is partially correct: Maximum length of a query = 199
13 Partially correct 4 ms 956 KB Output is partially correct: Maximum length of a query = 200