oj.uz

답안 #923279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923279 2024-02-07T04:48:31 Z vjudge1 Hidden Sequence (info1cup18_hidden) C++17
10 / 100
 400 ms 476 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int>ans;
void dfs(int n,vector<int>s){
    if(!isSubsequence(s)){
        return;
    }
    if(s.size()==n){
        ans=s;
        return;
    }else{
        s.push_back(0);
        dfs(n,s);
        s.pop_back();
        s.push_back(1);
        dfs(n,s);
    }
}
vector<int>findSequence(int n){
    dfs(n,{});
    return ans;
}

Compilation message

hidden.cpp: In function 'void dfs(int, std::vector<int>)':
hidden.cpp:9:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    9 |     if(s.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 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 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 9
5 Partially correct 1 ms 344 KB Output is partially correct: Maximum length of a query = 7

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1805 ms 476 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -