#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){
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;
}
}
vector<int> ans;
ans.resize(n);
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);
}
}
Compilation message
hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:43:1: warning: no return statement in function returning non-void [-Wreturn-type]
43 | }
| ^
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++)
| ~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
328 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
6 ms |
420 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
