oj.uz

답안 #134855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134855 2019-07-23T10:24:39 Z Just_Solve_The_Problem Amusement Park (JOI17_amusement_park) C++17
0 / 100
 32 ms 4236 KB 
#include <bits/stdc++.h>
#include "Joi.h"

#define ll long long

using namespace std;

const int maxn = (int)1e4 + 7;

static vector <int> gr[maxn];
static int used[maxn], d[maxn];
static int n, cur;
static ll x;

void dfs(int v) {
  used[v] = 1;
  MessageBoard(v, (x >> cur) & 1);
  cur++;
  for (int to : gr[v]) {
    if (used[to]) continue;
    dfs(to);
  }
}

void Joi(int N, int M, int A[], int B[], long long X, int T) {
  n = N;
  x = X;
  for (int i = 0; i < M; i++) {
    gr[A[i]].push_back(B[i]);
    gr[B[i]].push_back(A[i]);
  }
  dfs(0);
}

#include <bits/stdc++.h>
#include "Ioi.h"

#define ll long long

using namespace std;

const int maxn = (int)1e4 + 7;

static int pr[maxn], used[maxn], d[maxn];
static vector <int> vec, gr[maxn];
static int n;
static ll x;

void bfs(int v) {
  queue <int> q;
  q.push(v);
  used[v] = 1;
  while (!q.empty()) {
    v = q.front();
    q.pop();
    for (int to : gr[v]) {
      if (used[to]) continue;
      used[to] = 1;
      pr[to] = v;
      q.push(to);
    }
  }
}

int cur;

void dfs1(int v) {
  if (cur < 60) {
    if (used[v])
      x |= (1LL << cur);
  } else {
    return ;
  }
  cur++;
  for (int to : gr[v]) {
    if (d[to] != -1) continue;
    used[to] = Move(to);
    d[to] = 0;
    dfs1(to);
    Move(v);
  }
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  n = N;
  for (int i = 0; i < M; i++) {
    gr[A[i]].push_back(B[i]);
    gr[B[i]].push_back(A[i]);
  }
  bfs(P);
  int cur = 0;
  vector <int> vec;
  while (cur != P) {
    vec.push_back(cur);
    cur = pr[cur];
  }
  reverse(vec.begin(), vec.end());
  for (int i = 0; i < n; i++) {
    used[i] = d[i] = -1;
  }
  used[P] = V;
  for (int i = 0; i < vec.size(); i++) {
    used[vec[i]] = Move(vec[i]);
  }
  d[0] = 0;
  x = 0;
  dfs1(0);
  cout << x << endl;
  return x;
}

Compilation message

Joi.cpp:11:24: warning: 'd' defined but not used [-Wunused-variable]
 static int used[maxn], d[maxn];
                        ^

Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:68:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < vec.size(); i++) {
                   ~~^~~~~~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1140 KB Do not print anything on standard output.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 4236 KB Do not print anything on standard output.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1268 KB Do not print anything on standard output.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 4232 KB Do not print anything on standard output.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 4224 KB Do not print anything on standard output.
2 Halted 0 ms 0 KB -