oj.uz

Submission #481944

# Submission time Handle Problem Language Result Execution time Memory
481944 2021-10-22T10:01:04 Z jesus_coconut Amusement Park (JOI17_amusement_park) C++17
28 / 100
 27 ms 4188 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, int)> dfs = [&](int ver, int par) {
    if (cnt >= limit) return;
    bio[ver] = true;
    for (auto u: adj[ver]) if (!bio[u]) {
      if (cnt >= limit) return;
      ++cnt;
      long long v = Move(u);
      ans |= v << col[u];
      dfs(u, ver);
    }
    if (cnt >= limit) return;
    if (par != -1) {
      ++cnt;
      Move(par);
    }
  };
  dfs(P, -1);
  return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3984 KB Output is correct
2 Correct 27 ms 4028 KB Output is correct
3 Correct 24 ms 4056 KB Output is correct
4 Correct 15 ms 2380 KB Output is correct
5 Correct 15 ms 3488 KB Output is correct
6 Correct 17 ms 3012 KB Output is correct
7 Correct 15 ms 2896 KB Output is correct
8 Correct 14 ms 2888 KB Output is correct
9 Correct 15 ms 2892 KB Output is correct
10 Correct 12 ms 2500 KB Output is correct
11 Correct 13 ms 2500 KB Output is correct
12 Correct 12 ms 2224 KB Output is correct
13 Correct 13 ms 2228 KB Output is correct
14 Correct 13 ms 2224 KB Output is correct
15 Correct 13 ms 2388 KB Output is correct
16 Correct 15 ms 2376 KB Output is correct
17 Correct 15 ms 2380 KB Output is correct
18 Correct 15 ms 2396 KB Output is correct
19 Correct 15 ms 2384 KB Output is correct
20 Correct 10 ms 2996 KB Output is correct
21 Correct 12 ms 3000 KB Output is correct
22 Correct 15 ms 2648 KB Output is correct
23 Correct 15 ms 2744 KB Output is correct
24 Correct 14 ms 2744 KB Output is correct
25 Correct 14 ms 2772 KB Output is correct
26 Correct 15 ms 2780 KB Output is correct
27 Correct 14 ms 2848 KB Output is correct
28 Correct 15 ms 2892 KB Output is correct
29 Correct 14 ms 2652 KB Output is correct
30 Correct 14 ms 2740 KB Output is correct
31 Correct 1 ms 496 KB Output is correct
32 Correct 3 ms 496 KB Output is correct
33 Correct 1 ms 748 KB Output is correct
34 Correct 0 ms 488 KB Output is correct
35 Correct 1 ms 488 KB Output is correct
36 Correct 2 ms 496 KB Output is correct
37 Correct 1 ms 496 KB Output is correct
38 Correct 1 ms 496 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 1 ms 496 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 1 ms 488 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 488 KB Output is correct
2 Correct 1 ms 624 KB Output is correct
3 Correct 0 ms 484 KB Output is correct
4 Correct 2 ms 1036 KB Output is correct
5 Correct 3 ms 1028 KB Output is correct
6 Correct 3 ms 1040 KB Output is correct
7 Correct 3 ms 1036 KB Output is correct
8 Correct 3 ms 1028 KB Output is correct
9 Correct 11 ms 3540 KB Output is correct
10 Correct 12 ms 3556 KB Output is correct
11 Correct 11 ms 3496 KB Output is correct
12 Correct 1 ms 496 KB Output is correct
13 Correct 0 ms 488 KB Output is correct
14 Correct 0 ms 416 KB Output is correct
15 Correct 0 ms 496 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 26 ms 3824 KB Partially correct
2 Partially correct 22 ms 4188 KB Partially correct
3 Partially correct 23 ms 4104 KB Partially correct
4 Partially correct 14 ms 2540 KB Partially correct
5 Partially correct 18 ms 3380 KB Partially correct
6 Partially correct 13 ms 3032 KB Partially correct
7 Partially correct 14 ms 3016 KB Partially correct
8 Partially correct 12 ms 2872 KB Partially correct
9 Partially correct 12 ms 2860 KB Partially correct
10 Partially correct 13 ms 2640 KB Partially correct
11 Partially correct 12 ms 2604 KB Partially correct
12 Partially correct 12 ms 2356 KB Partially correct
13 Partially correct 11 ms 2424 KB Partially correct
14 Partially correct 12 ms 2460 KB Partially correct
15 Partially correct 12 ms 2608 KB Partially correct
16 Partially correct 12 ms 2608 KB Partially correct
17 Partially correct 16 ms 2592 KB Partially correct
18 Partially correct 16 ms 2612 KB Partially correct
19 Partially correct 12 ms 2616 KB Partially correct
20 Incorrect 12 ms 3096 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 3712 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -