Submission #827285

#	Time	Username	Problem	Language	Result	Execution time	Memory
827285		wortelworm	Stray Cat (JOI20_stray)	C++17	15 / 100	45 ms	16112 KiB

Anthony

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

// namespace {

// int FunctionExample(int i, int A) {
//   return i % A;
// }

// }  // namespace

vector<int> Mark(int N, int M, int MarkerTypes, int Speling, vector<int> U, vector<int> V) {

    // A -> [{b, index}]
    vector<vector<pair<int, int>>> adj(N);
    for (int i = 0; i < M; i++)
    {
        adj[U[i]].push_back({V[i], i});
        adj[V[i]].push_back({U[i], i});
    }

    vector<int> markings(M, 3);
    vector<int> depth(N, 1e9);
    queue<int> todo;

    depth[0] = 0;
    todo.push(0);

    while (! todo.empty()) {
        int node = todo.front();
        int next_depth = depth[node] + 1;
        todo.pop();
        for (auto [other, index] : adj[node]) {
            if (depth[other] <= next_depth) {
                continue;
            }
            depth[other] = next_depth;
            markings[index] = next_depth % 3;
            todo.push(other);
        }
    }

    // filter out the marking 3 with a marking going deeper
    for (int i = 0; i < M; i++)
    {
        if (markings[i] != 3) {
            continue;
        }
        
        markings[i] = (min(depth[U[i]], depth[V[i]])+1) % 3;
    }
    

    return markings;
}

Catherine

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

// namespace {

// int A, B;
// int variable_example = 0;

// }  // namespace

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

int Move(vector<int> y) {
    if (y[0] > 0) {
        if (y[2] > 0) {
            return 2;
        }
        return 0;
    }
    if (y[1] > 0) {
        return 1;
    }
    return 2;


    // ++variable_example;
    // for (int j = 0; j < A; ++j) {
    //   if (y[j] != 0) {
    //     return j;
    //   }
    // }
    // return -1;
}

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