# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676664 | DwightKSchrute | 길고양이 (JOI20_stray) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int>vi;
typedef vector<vi>vvi;
#define all(x) x.begin(),x.end()
//I can retrieve information between moves
namespace {
int A, B;
bool reached_leaf=0;
};
void Init(int _A, int _B) {
A=_A,B=_B;
}
int Move(vi y) {
if(accumulate(all(y),0)==1){
reached_leaf=1;
return -1;
}
for(int i=0; i<y.size(); i++)
if(y[i]==1)
return i;
return -1;
}