oj.uz

답안 #134874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134874 2019-07-23T11:07:54 Z Just_Solve_The_Problem Amusement Park (JOI17_amusement_park) C++17
10 / 100
 33 ms 4628 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);
  //cerr << X << endl;
}

#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++;
  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]);
  }
  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;
  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++) {
      int prv = S.size();
      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;
    }
  }
  //cerr << 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:41:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < vec.size(); i++) {
                   ~~^~~~~~~~~~~~
Ioi.cpp:50:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = ind; i < vec.size(); i++) {
                     ~~^~~~~~~~~~~~
Ioi.cpp:59:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = ind; i < vec.size(); i++) {
                       ~~^~~~~~~~~~~~
Ioi.cpp:60:11: warning: unused variable 'prv' [-Wunused-variable]
       int prv = S.size();
           ^~~
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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1264 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 4168 KB Output is correct
2 Incorrect 33 ms 4172 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1268 KB Output is correct
2 Correct 4 ms 1276 KB Output is correct
3 Correct 4 ms 1372 KB Output is correct
4 Correct 6 ms 1552 KB Output is correct
5 Correct 6 ms 1688 KB Output is correct
6 Correct 6 ms 1704 KB Output is correct
7 Correct 6 ms 1696 KB Output is correct
8 Correct 6 ms 1680 KB Output is correct
9 Correct 17 ms 4000 KB Output is correct
10 Correct 17 ms 3872 KB Output is correct
11 Correct 17 ms 4016 KB Output is correct
12 Correct 4 ms 1280 KB Output is correct
13 Correct 4 ms 1404 KB Output is correct
14 Correct 4 ms 1268 KB Output is correct
15 Correct 4 ms 1276 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 4288 KB Output is correct
2 Incorrect 32 ms 4288 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 4160 KB Output is correct
2 Correct 32 ms 4608 KB Output is correct
3 Incorrect 33 ms 4628 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -