oj.uz

답안 #923371

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923371 2024-02-07T07:04:09 Z vjudge1 Hidden Sequence (info1cup18_hidden) C++11
10 / 100
 5 ms 708 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
// vector<int>s={0,0,1,1};
// bool isSubsequence(vector<int>t){
//     int p=0;
//     for(auto u:s){
//         if(p<t.size() and u==t[p]){
//             p++;
//         }
//     }
//     return p==t.size();
// }
vector<int>findSequence(int n){
    vector<int>t;
    while(isSubsequence(t)){
        t.push_back(t.size()%2);
    }
    t.pop_back();
    t.insert(t.begin(),1);
    if(!isSubsequence(t)){
        t.erase(t.begin());
    }
    vector<int>ans;
    for(int i=0;i<t.size();i++){
        vector<int>r=t;
        int cnt=0;
        while(isSubsequence(r) and cnt<100){
            r.insert(r.begin()+i+cnt,t[i]);
            cnt++;
        }
        for(int j=1;j<=cnt;j++){
            ans.push_back(t[i]);
        }
    }
    // for(auto u:ans){
    //     cout<<u<<' ';
    // }
    // cout<<endl;
    return ans;
}

Compilation message

hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:25:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(int i=0;i<t.size();i++){
      |                 ~^~~~~~~~~
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 0 ms 344 KB Output is partially correct: Maximum length of a query = 9
3 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 7
4 Partially correct 0 ms 344 KB Output is partially correct: Maximum length of a query = 7
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 Partially correct 5 ms 440 KB Output is partially correct: Maximum length of a query = 93
2 Partially correct 3 ms 436 KB Output is partially correct: Maximum length of a query = 100
3 Partially correct 4 ms 688 KB Output is partially correct: Maximum length of a query = 105
4 Partially correct 3 ms 436 KB Output is partially correct: Maximum length of a query = 89
5 Correct 3 ms 432 KB Output is correct: Maximum length of a query = 95
6 Correct 1 ms 436 KB Output is correct: Maximum length of a query = 69
7 Correct 2 ms 432 KB Output is correct: Maximum length of a query = 74
8 Correct 2 ms 440 KB Output is correct: Maximum length of a query = 72
9 Correct 2 ms 696 KB Output is correct: Maximum length of a query = 79
10 Correct 3 ms 436 KB Output is correct: Maximum length of a query = 80
11 Runtime error 3 ms 708 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -