oj.uz

답안 #765490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
765490 2023-06-24T15:07:19 Z Ahmed57 Hidden Sequence (info1cup18_hidden) C++17
34 / 100
 75 ms 320 KB 
#include "grader.h"

#include<bits/stdc++.h>
using namespace std;
vector<int> valid(vector<int> ch,int n,int x,int lx,int rx){
    if(ch.size()<=n)return ch;
    vector<int> vl;
    int a = 0 , b = 0;
    for(int i = 0;i<ch.size();i++){
        if(ch[i]==x){
            a++;
        }else b++;
    }
    for(int i = 0;i<rx-b;i++){
        vl.push_back(!x);
    }for(int i = 0;i<lx-a;i++){
        vl.push_back(x);
    }
    return vl;
}
vector<int>findSequence(int N){
    int x= 0;
    vector<int>ch;
    for(int i = 0;i<N/2+1;i++)ch.push_back(x);
    if(isSubsequence(ch))x = 1;
    ch.clear();
    int cut = 0;
    for(int i = 1;i<=N/2+1;i++){
        ch.push_back(x);
        if(!isSubsequence(ch)){
            cut = i-1;
            break;
        }
    }
    vector<int> ans(N);
    for(int i = 0;i<N;i++)ans[i] = !x;
    for(int i = 1;i<=cut;i++){
        int l = 0;
        ch.clear();
        for(int j = 0;j<i;j++)ch.push_back(x);
        ch.push_back(!x);
        while(isSubsequence(valid(ch,N,x,cut,N-cut))){
            l++;
            ch.push_back(!x);
            if(ch.size()>N){
                break;
            }
        }
        long long lol = N-((cut-i)+l);
        if(lol<=0){
            return {0};
        }
        ans[lol-1] = x;
    }
    return ans;
}

Compilation message

hidden.cpp: In function 'std::vector<int> valid(std::vector<int>, int, int, int, int)':
hidden.cpp:6:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    6 |     if(ch.size()<=n)return ch;
      |        ~~~~~~~~~^~~
hidden.cpp:9:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i = 0;i<ch.size();i++){
      |                   ~^~~~~~~~~~
hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:45:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |             if(ch.size()>N){
      |                ~~~~~~~~~^~
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 1 ms 208 KB Output is partially correct: Maximum length of a query = 6
2 Partially correct 1 ms 208 KB Output is partially correct: Maximum length of a query = 7
3 Partially correct 1 ms 208 KB Output is partially correct: Maximum length of a query = 6
4 Partially correct 1 ms 208 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 1 ms 208 KB Output is partially correct: Maximum length of a query = 6

Subtask #2
24.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 37 ms 208 KB Output is partially correct: Maximum length of a query = 90
2 Partially correct 56 ms 208 KB Output is partially correct: Maximum length of a query = 96
3 Partially correct 67 ms 208 KB Output is partially correct: Maximum length of a query = 106
4 Partially correct 27 ms 208 KB Output is partially correct: Maximum length of a query = 83
5 Partially correct 65 ms 304 KB Output is partially correct: Maximum length of a query = 111
6 Partially correct 67 ms 288 KB Output is partially correct: Maximum length of a query = 151
7 Partially correct 75 ms 208 KB Output is partially correct: Maximum length of a query = 135
8 Partially correct 30 ms 208 KB Output is partially correct: Maximum length of a query = 96
9 Partially correct 67 ms 208 KB Output is partially correct: Maximum length of a query = 121
10 Partially correct 55 ms 304 KB Output is partially correct: Maximum length of a query = 105
11 Partially correct 60 ms 320 KB Output is partially correct: Maximum length of a query = 97
12 Partially correct 67 ms 208 KB Output is partially correct: Maximum length of a query = 150
13 Partially correct 66 ms 208 KB Output is partially correct: Maximum length of a query = 106