#include "Catherine.h" #include <bits/stdc++.h> #define mp make_pair #define F first #define S second #define iter(a) a.begin(), a.end() #define lsort(a) sort(iter(a)) #define gsort(a) sort(iter(a), greater<>()) #define eb emplace_back #define printv(a, b) { \ for(auto pv : a) b << pv << " "; \ b << "\n"; \ } using namespace std; namespace { int A, B; int lst = -1; } // namespace void Init(int A, int B) { ::A = A; ::B = B; } int Move(vector<int> y) { vector<int> t; for(int i = 0; i < A; i++){ if(y[i]) t.eb(i); } if(t.empty()) return -1; if(lst == -1){ lst = t[0]; return t[0]; } lst = !lst; return lst; }