oj.uz

답안 #69578

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
69578 2018-08-21T09:15:51 Z Mamnoon_Siam Hidden Sequence (info1cup18_hidden) C++17
34 / 100
 13 ms 580 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;

vector<int> make(int ones, vector<int> zs) {
	vector<int> ret;
	for(int i = 0; i < zs[0]; i++)
		ret.emplace_back(0);
	for(int i = 1; i < zs.size(); i++) {
		ret.emplace_back(1);
		for(int j = 0; j < zs[i]; j++)
			ret.emplace_back(0);
	} return ret;
}

int ask(int N, vector<int> vec) {
	if(vec.size() > N) return 0;
	return isSubsequence(vec);
}

vector <int> findSequence (int N) {
	int ones = 3;
	for(int i = 1; i <= N; i++) {
		if(ask(N, make(i, vector<int>(i + 1, 0)))) {
			ones = i;
		} else break;
	}
	vector<int> zs(ones + 1, 0);
	for(int it = 0; it < zs.size(); it++) {
		for(zs[it] = 1; ask(N, make(ones, zs)); zs[it]++) {}
		zs[it]--;
	}
	return make(ones, zs);
}

Compilation message

hidden.cpp: In function 'std::vector<int> make(int, std::vector<int>)':
hidden.cpp:9:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < zs.size(); i++) {
                 ~~^~~~~~~~~~~
hidden.cpp: In function 'int ask(int, std::vector<int>)':
hidden.cpp:17:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(vec.size() > N) return 0;
     ~~~~~~~~~~~^~~
hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:29:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int it = 0; it < zs.size(); it++) {
                  ~~~^~~~~~~~~~~
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.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 248 KB Output is partially correct: Maximum length of a query = 8
2 Partially correct 2 ms 336 KB Output is partially correct: Maximum length of a query = 10
3 Partially correct 2 ms 368 KB Output is partially correct: Maximum length of a query = 8
4 Partially correct 2 ms 368 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 2 ms 432 KB Output is partially correct: Maximum length of a query = 7

Subtask #2
24.0 / 80.0

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