oj.uz

Submission #134894

# Submission time Handle Problem Language Result Execution time Memory
134894 2019-07-23T11:39:52 Z Just_Solve_The_Problem Amusement Park (JOI17_amusement_park) C++17
10 / 100
 34 ms 4368 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);
  for (int i = 0; i < n; i++) {
    assert(used[i]);
  }
  //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 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;
}

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: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.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4296 KB Output is correct
2 Correct 32 ms 4248 KB Output is correct
3 Correct 34 ms 4296 KB Output is correct
4 Correct 20 ms 3132 KB Output is correct
5 Correct 20 ms 3516 KB Output is correct
6 Correct 20 ms 3136 KB Output is correct
7 Correct 22 ms 3296 KB Output is correct
8 Correct 23 ms 3236 KB Output is correct
9 Correct 20 ms 3384 KB Output is correct
10 Correct 19 ms 3228 KB Output is correct
11 Correct 19 ms 3248 KB Output is correct
12 Correct 18 ms 2856 KB Output is correct
13 Correct 18 ms 2984 KB Output is correct
14 Correct 19 ms 3008 KB Output is correct
15 Correct 20 ms 3008 KB Output is correct
16 Correct 19 ms 2872 KB Output is correct
17 Correct 20 ms 3008 KB Output is correct
18 Correct 20 ms 3240 KB Output is correct
19 Correct 20 ms 3028 KB Output is correct
20 Correct 16 ms 3416 KB Output is correct
21 Correct 16 ms 3512 KB Output is correct
22 Correct 19 ms 3256 KB Output is correct
23 Correct 20 ms 3264 KB Output is correct
24 Correct 20 ms 3128 KB Output is correct
25 Correct 20 ms 3300 KB Output is correct
26 Correct 20 ms 3236 KB Output is correct
27 Correct 20 ms 3312 KB Output is correct
28 Correct 20 ms 3264 KB Output is correct
29 Correct 19 ms 2984 KB Output is correct
30 Correct 19 ms 3120 KB Output is correct
31 Correct 4 ms 1276 KB Output is correct
32 Correct 4 ms 1268 KB Output is correct
33 Correct 4 ms 1408 KB Output is correct
34 Correct 4 ms 1268 KB Output is correct
35 Incorrect 4 ms 1504 KB Wrong Answer [6]
36 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1268 KB Output is correct
2 Correct 4 ms 1404 KB Output is correct
3 Correct 4 ms 1400 KB Output is correct
4 Correct 6 ms 1756 KB Output is correct
5 Correct 6 ms 1688 KB Output is correct
6 Correct 6 ms 1760 KB Output is correct
7 Correct 6 ms 1780 KB Output is correct
8 Correct 6 ms 1680 KB Output is correct
9 Correct 16 ms 3776 KB Output is correct
10 Correct 16 ms 3640 KB Output is correct
11 Correct 16 ms 3880 KB Output is correct
12 Correct 4 ms 1136 KB Output is correct
13 Correct 4 ms 1272 KB Output is correct
14 Correct 4 ms 1264 KB Output is correct
15 Correct 4 ms 1272 KB Output is correct

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 4292 KB Output is correct
2 Partially correct 32 ms 4368 KB Partially correct
3 Partially correct 32 ms 4288 KB Partially correct
4 Correct 20 ms 2880 KB Output is correct
5 Partially correct 20 ms 3592 KB Partially correct
6 Correct 20 ms 3300 KB Output is correct
7 Correct 20 ms 3128 KB Output is correct
8 Correct 20 ms 3244 KB Output is correct
9 Correct 20 ms 3360 KB Output is correct
10 Correct 19 ms 3116 KB Output is correct
11 Correct 19 ms 2992 KB Output is correct
12 Correct 19 ms 2812 KB Output is correct
13 Correct 19 ms 2992 KB Output is correct
14 Correct 20 ms 3000 KB Output is correct
15 Correct 20 ms 3000 KB Output is correct
16 Correct 20 ms 3032 KB Output is correct
17 Correct 20 ms 2932 KB Output is correct
18 Correct 20 ms 3000 KB Output is correct
19 Correct 20 ms 3128 KB Output is correct
20 Incorrect 16 ms 3392 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4168 KB Output is correct
2 Correct 33 ms 4364 KB Output is correct
3 Incorrect 34 ms 4296 KB Output isn't correct
4 Halted 0 ms 0 KB -