Submission #1132741

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132741		OI_Account	Stray Cat (JOI20_stray)	C++20	0 / 100	31 ms	12352 KiB

Anthony

#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
namespace {

const int N = 20'000;

int n, m, a, b, color[N + 10];
vector<pair<int, int>> adj[N + 10];
vector<int> vec = {0, 0, 1, 1, 0, 1};

void readInput(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V) {
	n = N;
	m = M;
	a = A;
	b = B;
	for (int i = 1; i <= m; i++) {
		int u = U[i - 1] + 1, v = V[i - 1] + 1;
		adj[u].push_back({v, i});
		adj[v].push_back({u, i});
	}
}

void dfs(int u, int par = 1, int cnt = 0, int up = 0) {
	if ((int) adj[u].size() != 2) {
		for (auto [v, id]: adj[u])
			if (v != par) {
				color[id] = 1 - up;
				dfs(v, u, 0, color[id]);
			}
	}
	else {
		for (auto [v, id]: adj[u])
			if (v != par) {
				color[id] = vec[cnt % (int) vec.size()];
				dfs(v, u, cnt + 1, color[id]);
			}
	}
}

void solve() {
	for (auto [v, id]: adj[1]) {
		color[id] = 0;
		dfs(v);
	}
}

} std::vector<int> Mark(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V) {
	readInput(N, M, A, B, U, V);
	//cout << "alo " << endl;
	solve();
	vector<int> x;
	for (int i = 1; i <= m; i++)
		x.push_back(color[i]);
	return x;
}

Catherine

#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
namespace {

const int T = 6;
const int A = 2;

deque<int> dq[10];

int a, b;
int check, cntCheck, goBack;
int solveit, cnt[10], deg[10], last, adj;
deque<int> vecCheck;

void calcDQ() {
	vector<int> st = {0, 0, 1, 1, 0, 1};
	for (int i = 0; i < T; i++)
		dq[0].push_back(st[i]);
	for (int i = 1; i < T; i++) {
		dq[i] = dq[i - 1];
		dq[i].push_back(dq[i].front());
		dq[i].pop_front();
	}
}

void init() {
	calcDQ();
	last = -1;
}


void initDeg(vector<int> x) {
	adj = (last != -1);
	for (int i = 0; i < a; i++) {
		deg[i] = x[i];
		cnt[i] = x[i];
		adj += x[i];
	}
	if (last != -1)
		cnt[last]++;
}

int checkSolveit() {
	if (adj == 2) {
		for (int i = 0; i < a; i++)
			if (deg[i] == 1)
				return i;
	}
	for (int i = 0; i < a; i++)
		if (cnt[i] == 1)
			return i;
	return last;
}

bool goodPath() {
	for (int i = 0; i < T; i++)
		if (vecCheck == dq[i])
			return true;
	return false;
}

int checkMove() {
	if (adj != 2)
		solveit = true;
	if (solveit)
		return checkSolveit();
	if (last == -1) {
		cntCheck = T;
		goBack = -1;
	}
	if (cntCheck) {
		int one = (deg[0]? 0: 1);
		vecCheck.push_back(one);
		cntCheck--;
		return one;
	}
	else if (goBack == -1) {
		if (goodPath()) {
			solveit = true;
			return checkSolveit();
		}
		else 
			goBack = T;
	}
	if (goBack) {
		goBack--;
		return -1;
	}
	solveit = true;
	return checkSolveit();
}

} void Init(int A, int B) {
	a = A;
	b = B;
	init();
}

int Move(std::vector<int> y) {
	//return 0;
	initDeg(y);
	int res = checkMove();
	last = (res == -1? last: res);
	return res;
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 2
• Subtask 3: 0 / 2
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 71
• Subtask 7: 0 / 9