oj.uz

답안 #963365

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963365 2024-04-14T21:42:07 Z biank Hidden Sequence (info1cup18_hidden) C++14
34 / 100
 6 ms 1220 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

#define sz(x) int(x.size())

bool query(int k, vector<int> s, int c) {
    s.push_back(k ^ 1);
    while (c--) s.push_back(k);
    return isSubsequence(s);
}

vector<int> findSequence(int N) {
    int l = 0, r = N + 1;
    vector<int> s0, s1;
    int n = 0, k = 0;
    while (true) {
        s0.push_back(0);
        if (!isSubsequence(s0)) {
            k = 0;
            break;
        }
        s1.push_back(1);
        if (!isSubsequence(s1)) {
            k = 1;
            break;
        }
        n++;
    }
    int m = N - n;
    vector<int> ans;
    int i = 0, j = 0;
    while (i < n || j < m) {
        if (i >= n || (j < m && query(k, ans, n - i))) {
            ans.push_back(k ^ 1);
            j++;
        } else {
            ans.push_back(k);
            i++;
        }
    }
    return ans;
}

Compilation message

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:15:9: warning: unused variable 'l' [-Wunused-variable]
   15 |     int l = 0, r = N + 1;
      |         ^
hidden.cpp:15:16: warning: unused variable 'r' [-Wunused-variable]
   15 |     int l = 0, r = N + 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
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 1 ms 344 KB Output is partially correct: Maximum length of a query = 10
3 Partially correct 1 ms 344 KB Output is partially correct: Maximum length of a query = 8
4 Correct 0 ms 344 KB Output is correct: Maximum length of a query = 5
5 Partially correct 1 ms 344 KB Output is partially correct: Maximum length of a query = 7

Subtask #2
24.0 / 80.0

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