oj.uz

Submission #482029

# Submission time Handle Problem Language Result Execution time Memory
482029 2021-10-22T16:54:06 Z jesus_coconut Amusement Park (JOI17_amusement_park) C++17
28 / 100
 28 ms 4204 KB 
#include <bits/stdc++.h>
#include "Joi.h"

using namespace std;
using ll = long long;

void Joi(int N, int M, int A[], int B[], long long X, int T) {
  bool bio[N];
  memset(bio, 0, sizeof bio);
  int p = 0;
  vector<vector<int>> adj(N);
  for (int i = 0; i < M; ++i) {
    adj[A[i]].push_back(B[i]);
    adj[B[i]].push_back(A[i]);
  }
  for (auto &v: adj) sort(begin(v), end(v));
  function<void(int)> dfs = [&](int ver) {
    bio[ver] = true;
    MessageBoard(ver, (X >> p++) & 1);
    p %= 60;
    for (auto u: adj[ver]) if (!bio[u]) {
      dfs(u);
    }
  };
  dfs(0);
}

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

using namespace std;

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  int limit = 20000;
  if (T == 5) limit = 120;
  else if (T == 4) limit = 960;
  else if (T == 3) limit = 250;
  vector<vector<int>> adj(N);
  for (int i = 0; i < M; ++i) {
    adj[A[i]].push_back(B[i]);
    adj[B[i]].push_back(A[i]);
  }
  for (auto &v: adj) sort(begin(v), end(v));
  int col[N];
  bool bio[N];
  memset(bio, 0, sizeof bio);
  int p = 0;
  function<void(int)> dfsfind = [&](int ver) {
    bio[ver] = true;
    col[ver] = p++;
    p %= 60;
    for (auto u: adj[ver]) if (!bio[u]) {
      dfsfind(u);
    }
  };
  dfsfind(0);
  memset(bio, 0, sizeof bio);
  long long ans = (1ll * V) << col[P];
  int cnt = 0;
  int cur = P;
  function<void(int)> dfs = [&](int ver) {
    bio[ver] = true;
    if (cnt >= limit) return;
    for (auto u: adj[ver]) if (!bio[u]) {
      if (cnt >= limit) return;
      ++cnt;
      assert(binary_search(begin(adj[cur]), end(adj[cur]), u));
      cur = u;
      long long v = Move(u);
      ans |= v << col[u];
      dfs(u);
      if (cnt >= limit) return;
      ++cnt;
      assert(binary_search(begin(adj[cur]), end(adj[cur]), ver));
      cur = ver;
      Move(ver);
    }
  };
  dfs(P);
  return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 496 KB Output is correct
2 Correct 0 ms 488 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 0 ms 488 KB Output is correct
5 Correct 0 ms 496 KB Output is correct
6 Correct 0 ms 488 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 2 ms 756 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 488 KB Output is correct
11 Correct 4 ms 916 KB Output is correct
12 Correct 1 ms 496 KB Output is correct
13 Correct 1 ms 756 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 1 ms 760 KB Output is correct
16 Correct 2 ms 620 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 2 ms 748 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 4124 KB Output is correct
2 Correct 24 ms 4204 KB Output is correct
3 Correct 27 ms 4128 KB Output is correct
4 Correct 15 ms 2380 KB Output is correct
5 Correct 19 ms 3512 KB Output is correct
6 Correct 20 ms 3012 KB Output is correct
7 Correct 18 ms 3004 KB Output is correct
8 Correct 19 ms 2920 KB Output is correct
9 Correct 15 ms 2904 KB Output is correct
10 Correct 14 ms 2548 KB Output is correct
11 Correct 13 ms 2492 KB Output is correct
12 Correct 14 ms 2220 KB Output is correct
13 Correct 18 ms 2228 KB Output is correct
14 Correct 15 ms 2256 KB Output is correct
15 Correct 19 ms 2384 KB Output is correct
16 Correct 15 ms 2384 KB Output is correct
17 Correct 15 ms 2392 KB Output is correct
18 Correct 16 ms 2388 KB Output is correct
19 Correct 14 ms 2392 KB Output is correct
20 Correct 14 ms 2980 KB Output is correct
21 Correct 12 ms 3004 KB Output is correct
22 Correct 16 ms 2824 KB Output is correct
23 Correct 15 ms 2904 KB Output is correct
24 Correct 15 ms 2872 KB Output is correct
25 Correct 16 ms 2784 KB Output is correct
26 Correct 15 ms 2892 KB Output is correct
27 Correct 18 ms 2872 KB Output is correct
28 Correct 18 ms 2872 KB Output is correct
29 Correct 14 ms 2652 KB Output is correct
30 Correct 15 ms 2748 KB Output is correct
31 Correct 2 ms 488 KB Output is correct
32 Correct 1 ms 496 KB Output is correct
33 Correct 1 ms 756 KB Output is correct
34 Correct 0 ms 488 KB Output is correct
35 Correct 1 ms 488 KB Output is correct
36 Correct 0 ms 496 KB Output is correct
37 Correct 1 ms 488 KB Output is correct
38 Correct 0 ms 488 KB Output is correct
39 Correct 1 ms 484 KB Output is correct
40 Correct 1 ms 496 KB Output is correct
41 Correct 1 ms 496 KB Output is correct
42 Correct 1 ms 496 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 484 KB Output is correct
2 Correct 1 ms 488 KB Output is correct
3 Correct 0 ms 496 KB Output is correct
4 Correct 4 ms 1040 KB Output is correct
5 Correct 3 ms 1028 KB Output is correct
6 Correct 3 ms 1040 KB Output is correct
7 Correct 2 ms 1028 KB Output is correct
8 Correct 3 ms 1028 KB Output is correct
9 Correct 10 ms 3548 KB Output is correct
10 Correct 11 ms 3500 KB Output is correct
11 Correct 12 ms 3552 KB Output is correct
12 Correct 1 ms 496 KB Output is correct
13 Correct 0 ms 496 KB Output is correct
14 Correct 0 ms 484 KB Output is correct
15 Correct 1 ms 496 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 28 ms 3716 KB Partially correct
2 Partially correct 28 ms 4188 KB Partially correct
3 Partially correct 25 ms 4184 KB Partially correct
4 Partially correct 13 ms 2616 KB Partially correct
5 Partially correct 13 ms 3372 KB Partially correct
6 Partially correct 13 ms 3084 KB Partially correct
7 Partially correct 13 ms 2980 KB Partially correct
8 Partially correct 16 ms 2860 KB Partially correct
9 Partially correct 16 ms 2960 KB Partially correct
10 Partially correct 14 ms 2672 KB Partially correct
11 Partially correct 13 ms 2608 KB Partially correct
12 Partially correct 11 ms 2424 KB Partially correct
13 Partially correct 11 ms 2416 KB Partially correct
14 Partially correct 12 ms 2456 KB Partially correct
15 Partially correct 16 ms 2508 KB Partially correct
16 Partially correct 13 ms 2500 KB Partially correct
17 Partially correct 13 ms 2616 KB Partially correct
18 Partially correct 16 ms 2592 KB Partially correct
19 Partially correct 16 ms 2520 KB Partially correct
20 Incorrect 13 ms 3164 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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