oj.uz

Submission #134865

# Submission time Handle Problem Language Result Execution time Memory
134865 2019-07-23T10:45:46 Z Just_Solve_The_Problem Amusement Park (JOI17_amusement_park) C++17
0 / 100
 32 ms 4288 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++;
  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);
}

#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;
static int cur;

void dfs2(int v) {
  used[v] = 1;
  vec.push_back(v);
  d[v] = cur;
  cur++;
  for (int to : gr[v]) {
    if (used[to]) continue;
    dfs2(to);
    vec.push_back(v);
  }
}


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]);
  }
  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;
  int cur = P;
  for (int i = ind; i < vec.size(); i++) {
    S.insert(vec[i]);
    cnt++;
    if (S.size() >= 60) {
      break;
    }
  }
  if (S.size() >= 60 && cnt <= 120) {
    S.clear();
    for (int i = ind; i < vec.size(); i++) {
      S.insert(vec[i]);
      if (cur != vec[i]) used[vec[i]] = Move(vec[i]);
      cur = vec[i];
      x |= ((used[vec[i]] * 1LL) << d[vec[i]]);
      if (S.size() >= 60) break;
    }
  } else {
    for (int i = vec.size() - 1; i >= 0; i--) {
      if (vec[i] == P) {
        ind = i;
        break;
      }
    }
    S.clear();
    for (int i = ind; i >= 0; i--) {
      S.insert(vec[i]);
      if (cur != vec[i]) used[vec[i]] = Move(vec[i]);
      cur = vec[i];
      x |= ((used[vec[i]] * 1LL) << d[vec[i]]);
      if (S.size() >= 60) break;
    }
  }
  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:58:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < vec.size(); i++) {
                   ~~^~~~~~~~~~~~
Ioi.cpp:67:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = ind; i < vec.size(); i++) {
                     ~~^~~~~~~~~~~~
Ioi.cpp:76:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = ind; i < vec.size(); i++) {
                       ~~^~~~~~~~~~~~
Ioi.cpp: At global scope:
Ioi.cpp:10:12: warning: 'pr' defined but not used [-Wunused-variable]
 static int pr[maxn], used[maxn], d[maxn];
            ^~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1372 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 4288 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1264 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 4172 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 4288 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -