제출 #341557

#제출 시각아이디문제언어결과실행 시간메모리
341557KoDAmusement Park (JOI17_amusement_park)C++17
18 / 100
27 ms3848 KiB
#include "Joi.h"

void Joi(int N, int M, int A[], int B[], long long X, int T) {
  for (int i = 0; i < 60; ++i) {
    MessageBoard(i, X >> i & 1);
  }
  for (int i = 60; i < N; ++i) {
    MessageBoard(i, 0);
  }
}
#include "Ioi.h"
#include <vector>

namespace {

template <class T>
using Vec = std::vector<T>;

Vec<Vec<int>> graph;
Vec<int> value;

void write(const int u, const int p) {
  for (const auto v: graph[u]) {
    if (value[v] == -1) {
      value[v] = Move(v);
      write(v, u);
    }
  }
  if (p != -1) {
    Move(p);
  }
}

};

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  graph.resize(N);
  value.resize(N, -1);
  for (int i = 0; i < M; ++i) {
    graph[A[i]].push_back(B[i]);
    graph[B[i]].push_back(A[i]);
  }
  value[P] = V;
  write(P, -1);
  long long X = 0;
  for (int i = 0; i < 60; ++i) {
    if (value[i]) {
      X += (1ll << i);
    }
  }
  return X;
}
#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...