제출 #1077470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1077470		danikoynov	Amusement Park (JOI17_amusement_park)	C++14	10 / 100	19 ms	5172 KiB

Joi

#include "Joi.h"


#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int MAXN = 10010, MAXBIT = 60;
vector < int > adj[MAXN];
int used[MAXN], acord[MAXN];
vector < int > ord;

void dfs(int v, ll X, int bit)
{
  used[v] = 1;
  acord[v] = bit;
  MessageBoard(v, ((X & ((ll)(1) << bit)) > 0));
  ord.push_back(v);
  for (int u : adj[v])
  { 
    if (used[u])
      continue;
    dfs(u, X, (bit + 1) % MAXBIT);
    ord.push_back(v);
  }
}

void build_tree(int N, int M, int A[], int B[], ll X)
{
  for (int i = 0; i < M; i ++)
  {
    adj[A[i]].push_back(B[i]);
    adj[B[i]].push_back(A[i]);
  }

  dfs(0, X, 0);

  ord.pop_back();
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
  build_tree(N, M, A, B, X);
}

Ioi

#include "Ioi.h"

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int MAXN = 10010, MAXBIT = 60;
vector < int > graph[MAXN];
int marked[MAXN], linked[MAXN];
vector < int > path;

void dfs(int v, int bit)
{
  marked[v] = 1;
  linked[v] = bit;
  //MessageBoard(v, ((X & ((ll)(1) << bit)) > 0));
  path.push_back(v);
  for (int u : graph[v])
  { 
    if (marked[u])
      continue;
    dfs(u, (bit + 1) % MAXBIT);
    path.push_back(v);
  }
}

void build_tree(int N, int M, int A[], int B[])
{
  for (int i = 0; i < M; i ++)
  {
    graph[A[i]].push_back(B[i]);
    graph[B[i]].push_back(A[i]);
  }

  dfs(0, 0);

  path.pop_back();
}

int bit_val[MAXBIT];

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) 
{
  build_tree(N, M, A, B);


  int pos = 0;
  while(path[pos] != P)
    pos ++;
  bit_val[linked[P]] = V;
  int ver = P;
  for (int step = 0; step < 120; step ++)
  {
    int nxt = (pos + 1) % (int)(path.size());
    //cout << "move from " << ver  << " " << path[nxt] <<endl;
    ver = path[nxt];
    bit_val[linked[ver]] = Move(ver);
    pos = nxt;
  }

  ll X = 0;
  for (int bit = 0; bit < MAXBIT; bit ++)
  {
    if (bit_val[bit] > 0)
      X |= ((ll)(1) << bit);
  }

  return X;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 55
• Subtask 5: 0 / 17