Submission #1081494

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081494		thelegendary08	Stray Cat (JOI20_stray)	C++14	0 / 100	33 ms	16464 KiB

Anthony

#include "Anthony.h"
#include <bits/stdc++.h>
#define f0r(i,n) for(int i = 0; i<n;i++)
#define vi vector<int>
#define pb push_back
using namespace std;



std::vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
  	std::vector<int> ret(M, -1);
	vector<pair<int,int>>edges;
	vector<int>adj[N];

	f0r(i, M){
		edges.pb({min(U[i], V[i]), max(U[i], V[i])});
		adj[U[i]].pb(V[i]);
		adj[V[i]].pb(U[i]);
	}
	map<pair<int,int>,int>m;
	f0r(i, M){
		m[edges[i]] = i;
	}
	/*
	vi dist(N, 1e9);
	dist[0] = 0;
	priority_queue<pair<int,int>>q;
	q.push({0, 0});
	while(!q.empty()){
		int node = q.top().second;
		q.pop();
		for(auto u : adj[node]){
			if(dist[u] > dist[node] + 1){
				dist[u] = dist[node] + 1;
				q.push({-dist[u], u]});
			}
		}
	}
	*/
	vi dist(N, 1e9);
	dist[0] = 0;
	queue<int>q;
	q.push(0);
	while(!q.empty()){
		int node = q.front();
		q.pop();
		for(auto u : adj[node]){


			if(dist[u] == 1e9){
				ret[m[{min(u, node), max(u, node)}]] = dist[node] % 2;
				dist[u] =  dist[node] + 1;
				q.push(u);
			}
		}
	}
	f0r(i, M){
		if(ret[i] == -1){
			ret[i] = min(dist[edges[i].first], dist[edges[i].second]) % 2;
		}
	}

  	return ret;
}

Catherine

#include "Catherine.h"
#include <bits/stdc++.h>
#define f0r(i,n) for(int i = 0; i< n; i++)
#define pb push_back
#define vi vector<int>
using namespace std;
int A, B;

void Init(int A, int B) {
  ::A = A;
  ::B = B;
}

int Move(std::vector<int> y) {
  	//set<int>s;
  	if(y[0] == 0 && y[1] == 0)return -1;
  	if(y[0] > 1 && y[1] == 0)return -1;
  	if(y[1] > 1 && y[0] == 0)return -1;
  	if(y[0] > 1 && y[1] == 1)return 1;
  	if(y[1] > 1 && y[0] == 1)return 0;
  	if(y[0] == 1 && y[1] == 1)return 0;
  	if(y[0] == 1 && y[1] == 0)return 0;
  	if(y[0] == 0 && y[1] == 1)return 1;
  	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