Submission #220212

#	Time	Username	Problem	Language	Result	Execution time	Memory
220212		WLZ	Stray Cat (JOI20_stray)	C++14	4 / 100	71 ms	17404 KiB

Anthony

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

namespace {
  struct edge {
    int from, to, idx;
  };
  vector< vector<edge> > g;

  vector<int> solve1234(int N, int M, vector<int> U, vector<int> V) {
    queue<int> q;
    q.push(0);
    vector<int> dist(N, -1), p(N, -1), ans(M);
    dist[0] = 0;
    while (!q.empty()) {
      int u = q.front(); q.pop();
      for (auto& e : g[u]) {
        if (dist[e.to] == -1) {
          dist[e.to] = dist[u] + 1;
          ans[e.idx] = dist[u] % 3;
          p[e.to] = u;
          q.push(e.to);
        } else if (e.to != p[u]) {
          ans[e.idx] = dist[u] % 3;
        }
      }
    }
    return ans;
  }

  vector<int> solve567(int N, int M, vector<int> U, vector<int> V) {

  }
}

vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
  g.resize(N);
  for (int i = 0; i < M; i++) {
    g[U[i]].push_back({U[i], V[i], i});
    g[V[i]].push_back({V[i], U[i], i});
  }
  if (A >= 3) {
    return solve1234(N, M, U, V);
  } else {
    return solve567(N, M, U, V);
  }
}

Catherine

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

namespace {
  int A, B;
}

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

int Move(vector<int> y) {
  if (A >= 3) {
    for (int i = 0; i < 3; i++) {
      if (y[i] != 0 && y[(i + 1) % 3] != 0) {
        return i;
      }
    }
    for (int i = 0; i < 3; i++) {
      if (y[i] != 0) {
        return i;
      }
    }
  } else {
    
  }
}

Compilation message (stderr)

Anthony.cpp: In function 'std::vector<int> {anonymous}::solve567(int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:34:3: warning: no return statement in function returning non-void [-Wreturn-type]
   }
   ^

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:28:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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