oj.uz

Submission #481954

# Submission time Handle Problem Language Result Execution time Memory
481954 2021-10-22T10:44:10 Z jesus_coconut Amusement Park (JOI17_amusement_park) C++17
28 / 100
 31 ms 4176 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;
  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[ver]), end(adj[ver]), u));
      long long v = Move(u);
      ans |= v << col[u];
      dfs(u);
      if (cnt >= limit) return;
      ++cnt;
      assert(binary_search(begin(adj[u]), end(adj[u]), ver));
      Move(ver);
    }
  };
  dfs(P);
  return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 4056 KB Output is correct
2 Correct 31 ms 4176 KB Output is correct
3 Correct 26 ms 4064 KB Output is correct
4 Correct 15 ms 2396 KB Output is correct
5 Correct 17 ms 3520 KB Output is correct
6 Correct 15 ms 3000 KB Output is correct
7 Correct 15 ms 3012 KB Output is correct
8 Correct 16 ms 3012 KB Output is correct
9 Correct 18 ms 2892 KB Output is correct
10 Correct 14 ms 2532 KB Output is correct
11 Correct 14 ms 2556 KB Output is correct
12 Correct 13 ms 2220 KB Output is correct
13 Correct 13 ms 2228 KB Output is correct
14 Correct 14 ms 2236 KB Output is correct
15 Correct 13 ms 2400 KB Output is correct
16 Correct 13 ms 2380 KB Output is correct
17 Correct 15 ms 2364 KB Output is correct
18 Correct 15 ms 2428 KB Output is correct
19 Correct 16 ms 2404 KB Output is correct
20 Correct 12 ms 3008 KB Output is correct
21 Correct 11 ms 3016 KB Output is correct
22 Correct 15 ms 2768 KB Output is correct
23 Correct 15 ms 2872 KB Output is correct
24 Correct 14 ms 2876 KB Output is correct
25 Correct 15 ms 2872 KB Output is correct
26 Correct 15 ms 2884 KB Output is correct
27 Correct 15 ms 2896 KB Output is correct
28 Correct 16 ms 2896 KB Output is correct
29 Correct 13 ms 2676 KB Output is correct
30 Correct 15 ms 2728 KB Output is correct
31 Correct 1 ms 496 KB Output is correct
32 Correct 1 ms 496 KB Output is correct
33 Correct 1 ms 756 KB Output is correct
34 Correct 1 ms 488 KB Output is correct
35 Correct 0 ms 492 KB Output is correct
36 Correct 0 ms 500 KB Output is correct
37 Correct 0 ms 496 KB Output is correct
38 Correct 0 ms 496 KB Output is correct
39 Correct 1 ms 500 KB Output is correct
40 Correct 0 ms 496 KB Output is correct
41 Correct 0 ms 496 KB Output is correct
42 Correct 2 ms 488 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 20 ms 3812 KB Partially correct
2 Partially correct 20 ms 3808 KB Partially correct
3 Partially correct 20 ms 3864 KB Partially correct
4 Partially correct 12 ms 2388 KB Partially correct
5 Partially correct 14 ms 3268 KB Partially correct
6 Partially correct 15 ms 2916 KB Partially correct
7 Partially correct 13 ms 2760 KB Partially correct
8 Partially correct 12 ms 2636 KB Partially correct
9 Partially correct 15 ms 2744 KB Partially correct
10 Partially correct 15 ms 2544 KB Partially correct
11 Partially correct 12 ms 2464 KB Partially correct
12 Partially correct 13 ms 2212 KB Partially correct
13 Partially correct 11 ms 2228 KB Partially correct
14 Partially correct 11 ms 2256 KB Partially correct
15 Partially correct 12 ms 2400 KB Partially correct
16 Partially correct 12 ms 2376 KB Partially correct
17 Partially correct 12 ms 2380 KB Partially correct
18 Partially correct 12 ms 2392 KB Partially correct
19 Partially correct 12 ms 2376 KB Partially correct
20 Incorrect 10 ms 3000 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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