제출 #1334263

#제출 시각아이디문제언어결과실행 시간메모리
1334263ofozTwo Transportations (JOI19_transportations)C++20
0 / 100
2 ms844 KiB
#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;
}
#include "Baijan.h"
#include <vector>
using namespace std;
#define vi vector<int>
namespace {
void sendInt(int x) {
    for (int i = 0; i < 20; i++) SendB(x & (1<<i));
}
}
void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D) {
    sendInt(10);
}

void ReceiveB(bool y) {

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...