# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427251 | amunduzbaev | Stray Cat (JOI20_stray) | C++14 | 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;
#define pb push_back
#define sz(x) (int)x.size()
vector<int> path;
int a;
void Init(int a, int b) { ::a = a; }
namespace sol1{
vector<int> ppat = {1, 1, 0, 1, 0, 0, 1, 1, 0, 1};
int ok = 0, last = -1;
vector<int> path;
int Move(vector<int> y){
if(ok){
if(y[0] + y[1] + 1 > 2) return last ^= 1;
if(y[0]) return last = 0;
if(y[1]) return last = 1;
return -1;
}
if(y[0] + y[1] + (~last) > 2){
ok = 1;
if(~last){
if(min(y[0], y[1]) == 0) return -1;
if(min(y[0], y[1]) == 1) return last ^= 1;
assert(0);
} else {
if(y[0] == 1) return last = 0;
if(y[1] == 1) return last = 1;
assert(0);
}
}
if(y[0] + y[1] + (~last) == 1){
ok = 1;
if(y[0] == 1) return last = 0;
if(y[1] == 1) return last = 1;
return -1;
}
if(sz(path) == 5){ ok = 1;
for(int i=0;i+5<=sz(ppat);i++){
int l = i, r = i + 5 - 1, okk = 1;
for(int j=l;j<=r;j++) okk &= (ppat[j] == path[j-i]);
if(okk) return -1;
} if(y[0]) return last = 0;
else return last = 1;
} else {
if(~last){
if(y[0] == 1){
path.pb(0);
return last = 0;
} else {
path.pb(1);
return last = 1;
}
} else {
if(y[0] == 2){
path.pb(0), path.pb(0);
return last = 0;
} else if(y[1] == 2){
path.pb(1), path.pb(1);
return last = 1;
} else {
path.pb(0), path.pb(1);
return last = 1;
}
}
}
}
}
namespace sol2{
int Move(vector<int> y){
return 0;
}
}
int Move(vector<int> y) {
if(a == 2) return sol1::Move(y);
else return sol2::Move(y);
}