#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
#ifndef EVAL
#include "grader.cpp"
#endif
bool ask(int a, int b, int first){
vii tt;
while(a--) tt.pb(first);
while(b--) tt.pb(first ^ 1);
return isSubsequence(tt);
}
vector<int>findSequence(int n){
int n0 = 0, n1 = 0;
for(int i=0;i<n;i++){
if(!ask(n0+1, 0, 0)) { n1 = n - n0; break; }
if(!ask(n1+1, 0, 1)) { n0 = n - n1; break; }
n1++, n0++;
}
int a0 = 0, a1 = 0;
vii res;
for(int i=0;i<n;i++){
int x;
if(a0 + n1 + 1 <= n/2+1){
if(ask(a0+1, n1, 0)) x = 0;
else x = 1;
}else{
if(ask(a1+1, n0, 1)) x = 1;
else x = 0;
}
if(x) a1++, n1--;
else a0++, n0--;
res.pb(x);
}
return res;
}
Compilation message
del13.cpp:2:10: fatal error: grader.h: No such file or directory
2 | #include "grader.h"
| ^~~~~~~~~~
compilation terminated.
