제출 #259473

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259473		dorijanlendvaj	Two Transportations (JOI19_transportations)	C++14	0 / 100	1170 ms	1280 KiB

Azer

#include "Azer.h"
#include <vector>

namespace {

int N;
int variable_example[500000];
int count;

}  // namespace

void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
           std::vector<int> C) {
  ::N = N;
  for (int i = 0; i < A; ++i) {
    variable_example[i] = U[i] + V[i] - C[i];
  }
  SendA(true);
  count = 1;
}

void ReceiveA(bool x) {
  ++count;
  if (count < 58000) {
    SendA(x);
    ++count;
  }
}

std::vector<int> Answer() {
  std::vector<int> ans(N);
  for (int k = 0; k < N; ++k) {
    ans[k] = variable_example[k];
  }
  return ans;
}

Baijan

#include "Baijan.h"
#include <vector>

namespace {

int N;
int count;

bool FunctionExample(bool P) {
  return !P;
}

}  // namespace

void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
           std::vector<int> D) {
  ::N = N;
  count = 0;
}

void ReceiveB(bool y) {
  ++count;
  if (count < 58000) {
    SendB(FunctionExample(y));
    ++count;
  }
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 38
• Subtask 5: 0 / 14
• Subtask 6: 0 / 10
• Subtask 7: 0 / 16