oj.uz

답안 #472097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472097 2021-09-12T21:33:44 Z nickmet2004 Hidden Sequence (info1cup18_hidden) C++11
100 / 100
 8 ms 300 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
bool ask(int x , int y , int c){
    vector<int > v;
    while(x--)v.push_back(c);
    while(y--)v.push_back(c^1);
    return isSubsequence(v);
}
int n0 , n1;
vector<int>findSequence(int n){
    vector<int> ans;
    for(int i = 1; i <= n; ++i){
        if(!ask(i , 0 , 0)){
            n0 = i - 1;
            n1 = n - n0;
            break;
        }
        if(!ask(i , 0 , 1)){
            n1 = i -1;
            n0 = n - n1;
            break;
        }
    }
    int a0 = 0 , a1 = 0 , b0 = n0 , b1 =n1 , q = 0;
    for(int i= 1; i<= n; ++i){
        if(a0 + b1 <= n/2){
            if(ask(a0 + 1 , b1 , 0)){
                q = 0;
            }else q = 1;
        }else{
            if(ask(a1 + 1, b0 , 1)){
                q=1;
            }else q= 0;
        }
        if(q){
            a1++; b1--;
        }
        else a0++ , b0--;
        ans.push_back(q);
    }
    return ans;
}

Compilation message

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
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct: Maximum length of a query = 5
2 Correct 1 ms 200 KB Output is correct: Maximum length of a query = 6
3 Correct 1 ms 200 KB Output is correct: Maximum length of a query = 5
4 Correct 1 ms 200 KB Output is correct: Maximum length of a query = 5
5 Correct 1 ms 200 KB Output is correct: Maximum length of a query = 4

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 200 KB Output is correct: Maximum length of a query = 83
2 Correct 7 ms 200 KB Output is correct: Maximum length of a query = 90
3 Correct 8 ms 292 KB Output is correct: Maximum length of a query = 96
4 Correct 6 ms 200 KB Output is correct: Maximum length of a query = 77
5 Correct 8 ms 300 KB Output is correct: Maximum length of a query = 95
6 Correct 7 ms 296 KB Output is correct: Maximum length of a query = 87
7 Correct 7 ms 292 KB Output is correct: Maximum length of a query = 97
8 Correct 8 ms 200 KB Output is correct: Maximum length of a query = 83
9 Correct 8 ms 200 KB Output is correct: Maximum length of a query = 101
10 Correct 8 ms 200 KB Output is correct: Maximum length of a query = 100
11 Correct 8 ms 300 KB Output is correct: Maximum length of a query = 96
12 Correct 7 ms 200 KB Output is correct: Maximum length of a query = 100
13 Correct 7 ms 200 KB Output is correct: Maximum length of a query = 101