Submission #710324

#	Time	Username	Problem	Language	Result	Execution time	Memory
710324		hpesoj	Stray Cat (JOI20_stray)	C++17	0 / 100	39 ms	15232 KiB

Anthony

#include <bits/stdc++.h>
#include "Anthony.h"
#define pb push_back
#define pi pair <int, int>
#define fi first
#define se second
using namespace std;
vector <pi> adj[20005];
vector <int> ans;
int mark = 0;
queue <int> q;
bool visited[20005];
void bfs(int x){
	q.push(x);
	while(!q.empty()){
		int sz = q.size();
		while(sz--){
			int curr = q.front();
			q.pop();
			visited[curr] = 1;
			for(pi i : adj[curr]) if(!visited[i.fi]) ans[i.se] = mark, q.push(i.fi);
		}
		mark = !mark;
	}
}
std::vector <int> Mark(int n, int m, int a, int b, std::vector <int> u, std::vector <int> v){
	for(int i = 0; i < m; i++) ans.pb(0);
	for(int i = 0; i < m; i++) adj[u[i]].pb({v[i], i}), adj[v[i]].pb({u[i], i});
	bfs(0);
	return ans;
}

Catherine

#include <bits/stdc++.h>
#include "Catherine.h"
#define pb push_back
#define pi pair <int, int>
#define fi first
#define se second
using namespace std;

void Init(int a, int b){
	;
}
int Move(std::vector <int> y){
	for(int i = 0; i < 2; i++) if(y[i] == 1) return i;
	return -1;
}

• 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