제출 #134894

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
134894		Just_Solve_The_Problem	Amusement Park (JOI17_amusement_park)	C++17	10 / 100	34 ms	4368 KiB

Joi

#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++;
  if (cur >= 60) cur -= 60;
  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);
  for (int i = 0; i < n; i++) {
    assert(used[i]);
  }
  //cerr << X << endl;
}

Ioi

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

#define ll long long

using namespace std;

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

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

void dfs2(int v) {
  used[v] = 1;
  vec.push_back(v);
  d[v] = cur;
  cur++;
  if (cur >= 60) cur -= 60;
  for (int to : gr[v]) {
    if (used[to]) continue;
    dfs2(to);
    vec.push_back(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]);
  }
  for (int i = 0; i < n; i++) {
    used[i] = 0;
  }
  dfs2(0);
  for (int i = 0; i < n; i++) {
    used[i] = 0;
  }
  used[P] = V;
  int ind = 0;
  for (int i = 0; i < vec.size(); i++) {
    if (vec[i] == P) {
      ind = i;
      break;
    }
  }
  int cnt = 0;
  set <int> S;
  cur = P;
  S.clear();
  int i = ind;
  bool ok = 1;
  for (int i = ind; i < vec.size(); i++) {
    S.insert(d[vec[i]]);
  }
  if (S.size() >= 60) {
    S.clear();
    while (1) {
      S.insert(d[vec[i]]);
      if (cur != vec[i]) used[vec[i]] = Move(vec[i]);
      cur = vec[i];
      if (used[vec[i]])
        x |= (1LL << d[vec[i]]);
      if (S.size() >= 60) break;
      i++;
    }
  } else {
    S.clear();
    while (1) {
      S.insert(d[vec[i]]);
      if (cur != vec[i]) used[vec[i]] = Move(vec[i]);
      cur = vec[i];
      if (used[vec[i]])
        x |= (1LL << d[vec[i]]);
      if (S.size() >= 60) break;
      i--;
    }
  }
  return x;
}

컴파일 시 표준 에러 (stderr) 메시지

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:44:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < vec.size(); i++) {
                   ~~^~~~~~~~~~~~
Ioi.cpp:56:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = ind; i < vec.size(); i++) {
                     ~~^~~~~~~~~~~~
Ioi.cpp:50:7: warning: unused variable 'cnt' [-Wunused-variable]
   int cnt = 0;
       ^~~
Ioi.cpp:55:8: warning: unused variable 'ok' [-Wunused-variable]
   bool ok = 1;
        ^~

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