oj.uz

Submission #500066

# Submission time Handle Problem Language Result Execution time Memory
500066 2021-12-30T09:59:36 Z 600Mihnea Amusement Park (JOI17_amusement_park) C++17
82 / 100
 44 ms 5500 KB 
#include "Joi.h"
#include <bits/stdc++.h>

using namespace std;

const int BITS = 60;

mt19937 reng(777777);


void Joi(int N, int M, int A[], int B[], long long X, int T) {
  int root = reng() % N;
  vector<vector<int>> g(N);
  vector<int> color(N, -1);

  for (int i = 0; i < M; i++) {
    g[A[i]].push_back(B[i]);
    g[B[i]].push_back(A[i]);
  }


  vector<bool> vis(N, 0);
  vector<vector<int>> ng(N);

  function<void(int)> makeG = [&] (int a) {
    vis[a] = 1;
    for (auto &b : g[a]) {
      if (!vis[b]) {
        ng[a].push_back(b);
        makeG(b);
      }
    }
  };
  makeG(root);
  g = ng;


  function<void(int)> draw = [&] (int a) {
    vector<int> all;
    queue<int> q;
    q.push(a);
    all.push_back(a);
    while (!q.empty()) {
      int x = q.front();
      q.pop();
      for (auto &y : g[x]) {
        if ((int) all.size() + 1 > BITS) break;
        q.push(y);
        all.push_back(y);
      }
    }
    assert((int) all.size() <= BITS);
    for (int i = 0; i < (int) all.size(); i++) {
      color[all[i]] = i;
    }
    for (int i = 0; i < (int) all.size(); i++) {
      for (auto &v : g[all[i]]) {
        if (color[v] == -1) {
          draw(v);
        }
      }
    }
  };
  draw(root);
  for (auto &x : color) assert(0 <= x && x < BITS);


  vector<int> numBits(BITS);
  for (int i = 0; i < BITS; i++) {
    if (X & (1LL << i)) {
      numBits[i] = 1;
    } else {
      numBits[i] = 0;
    }
  }



  for(int i = 0; i < N; i++) {
    MessageBoard(i, numBits[color[i]]);
  }
}



#include "Ioi.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int BITS = 60;
mt19937 rng(777777);

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  int root = rng() % N;
  vector<vector<int>> g(N);
  vector<int> color(N, -1);
  vector<int> parrent(N, -1);

  for (int i = 0; i < M; i++) {
    g[A[i]].push_back(B[i]);
    g[B[i]].push_back(A[i]);
  }

  vector<bool> vis(N, 0);
  vector<int> sub(N);
  vector<vector<int>> ng(N);

  function<void(int)> makeG = [&] (int a) {
    vis[a] = 1;
    sub[a] = 1;
    for (auto &b : g[a]) {
      if (!vis[b]) {
        ng[a].push_back(b);
        makeG(b);
        parrent[b] = a;
        sub[a] += sub[b];
      }
    }
  };
  makeG(root);
  g = ng;

  map<int, vector<pair<int, int>>> guys;
  vector<int> who(N);

  function<void(int)> draw = [&] (int a) {
    vector<pair<int, int>> all;
    queue<int> q;
    q.push(a);
    vector<int> vrts = {a};
    while (!q.empty()) {
      int x = q.front();
      q.pop();
      for (auto &y : g[x]) {
        if ((int) vrts.size() + 1 > BITS) break;
        q.push(y);
        vrts.push_back(y);
        all.push_back({x, y});
      }
    }
    guys[a] = all;
    assert((int) all.size() <= BITS);
    for (int i = 0; i < (int) vrts.size(); i++) {
      color[vrts[i]] = i;
      who[vrts[i]] = a;
    }
    for (int i = 0; i < (int) vrts.size(); i++) {
      for (auto &v : g[vrts[i]]) {
        if (color[v] == -1) {

          draw(v);
        }
      }
    }
  };
  draw(root);
  ll solu = 0;
  int done = 0;

  set<pair<int, int>> s;

  while (sub[P] < BITS) {
    s.insert({P, parrent[P]});
    s.insert({parrent[P], P});
    V = Move(parrent[P]);
    P = parrent[P];
  }
  vector<pair<int, int>> all = guys[who[P]];

  function<bool(pair<int, int>, pair<int, int>)> cmp = [&] (pair<int, int> a, pair<int, int> b) {
    return s.count(a) < s.count(b);
  };

  sort(all.begin(), all.end(), cmp);

  for (int i = 0; i < N; i++) g[i].clear();

  for (auto &it : all) g[it.first].push_back(it.second), g[it.second].push_back(it.first);

  vector<int> dep(N);

  function<void(int, int)> cdep = [&] (int a, int p) {
    dep[a] = 0;
    for (auto &b : g[a]) {
      if (b != p) {
        cdep(b, a);
        dep[a] = max(dep[a], 1 + dep[b]);
      }
    }
  };

  function<void(int, int)> expl = [&] (int a, int p) {
    solu |= (1LL << color[a]) * V;
    done++;
    int v = -1;
    for (auto &b : g[a]) {
      if (b == p) continue;
      if (v == -1) v = b;
      else if (dep[b] > dep[v]) v = b;
    }
    for (auto &b : g[a]) {
      if (b == p || b == v) continue;
      if (done == BITS) break;
      V = Move(b);
      if (done == BITS) break;
      expl(b, a);
      if (done == BITS) break;
      V = Move(a);
      if (done == BITS) break;
    }
    for (auto &b : g[a]) {
      if (b == p || b != v) continue;
      if (done == BITS) break;
      V = Move(b);
      if (done == BITS) break;
      expl(b, a);
      if (done == BITS) break;
      V = Move(a);
      if (done == BITS) break;
    }
  };

  cdep(P, -1);
  expl(P, -1);

  assert(done == BITS);
  for (auto &x : color) assert(0 <= x && x < BITS);



  vector<int> numBits(BITS, -1);
  int needBits = BITS;


  return solu;
}

Compilation message

Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:151:7: warning: unused variable 'needBits' [-Wunused-variable]
  151 |   int needBits = BITS;
      |       ^~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 616 KB Output is correct
2 Correct 1 ms 740 KB Output is correct
3 Correct 0 ms 744 KB Output is correct
4 Correct 0 ms 624 KB Output is correct
5 Correct 0 ms 744 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 2 ms 744 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 1 ms 748 KB Output is correct
10 Correct 1 ms 752 KB Output is correct
11 Correct 4 ms 1048 KB Output is correct
12 Correct 0 ms 488 KB Output is correct
13 Correct 1 ms 756 KB Output is correct
14 Correct 1 ms 756 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 752 KB Output is correct
17 Correct 0 ms 756 KB Output is correct
18 Correct 2 ms 756 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5440 KB Output is correct
2 Correct 25 ms 5460 KB Output is correct
3 Correct 27 ms 5460 KB Output is correct
4 Correct 17 ms 3644 KB Output is correct
5 Correct 16 ms 5372 KB Output is correct
6 Correct 16 ms 4200 KB Output is correct
7 Correct 18 ms 4156 KB Output is correct
8 Correct 16 ms 4160 KB Output is correct
9 Correct 17 ms 4156 KB Output is correct
10 Correct 19 ms 4028 KB Output is correct
11 Correct 15 ms 4040 KB Output is correct
12 Correct 16 ms 3276 KB Output is correct
13 Correct 15 ms 3412 KB Output is correct
14 Correct 18 ms 3372 KB Output is correct
15 Correct 16 ms 3700 KB Output is correct
16 Correct 16 ms 3760 KB Output is correct
17 Correct 17 ms 3652 KB Output is correct
18 Correct 16 ms 3640 KB Output is correct
19 Correct 17 ms 3636 KB Output is correct
20 Correct 12 ms 4160 KB Output is correct
21 Correct 11 ms 4156 KB Output is correct
22 Correct 15 ms 4340 KB Output is correct
23 Correct 15 ms 4068 KB Output is correct
24 Correct 17 ms 4428 KB Output is correct
25 Correct 18 ms 4260 KB Output is correct
26 Correct 16 ms 4544 KB Output is correct
27 Correct 15 ms 4144 KB Output is correct
28 Correct 15 ms 4544 KB Output is correct
29 Correct 13 ms 3880 KB Output is correct
30 Correct 13 ms 4144 KB Output is correct
31 Correct 0 ms 752 KB Output is correct
32 Correct 0 ms 744 KB Output is correct
33 Correct 1 ms 756 KB Output is correct
34 Correct 0 ms 752 KB Output is correct
35 Correct 0 ms 624 KB Output is correct
36 Correct 0 ms 624 KB Output is correct
37 Correct 1 ms 496 KB Output is correct
38 Correct 0 ms 616 KB Output is correct
39 Correct 0 ms 496 KB Output is correct
40 Correct 0 ms 624 KB Output is correct
41 Correct 1 ms 752 KB Output is correct
42 Correct 0 ms 488 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 744 KB Output is correct
2 Correct 0 ms 616 KB Output is correct
3 Correct 0 ms 616 KB Output is correct
4 Correct 2 ms 1284 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 3 ms 1288 KB Output is correct
7 Correct 2 ms 1284 KB Output is correct
8 Correct 2 ms 1296 KB Output is correct
9 Correct 16 ms 5416 KB Output is correct
10 Correct 13 ms 5176 KB Output is correct
11 Correct 13 ms 5472 KB Output is correct
12 Correct 0 ms 492 KB Output is correct
13 Correct 0 ms 496 KB Output is correct
14 Correct 0 ms 756 KB Output is correct
15 Correct 0 ms 616 KB Output is correct

Subtask #4
54.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5448 KB Output is correct
2 Correct 28 ms 5308 KB Output is correct
3 Correct 44 ms 5376 KB Output is correct
4 Correct 18 ms 3660 KB Output is correct
5 Correct 16 ms 5304 KB Output is correct
6 Correct 14 ms 4296 KB Output is correct
7 Correct 15 ms 4160 KB Output is correct
8 Correct 16 ms 4172 KB Output is correct
9 Correct 16 ms 4156 KB Output is correct
10 Correct 22 ms 3984 KB Output is correct
11 Correct 20 ms 3996 KB Output is correct
12 Correct 15 ms 3376 KB Output is correct
13 Correct 14 ms 3384 KB Output is correct
14 Correct 14 ms 3360 KB Output is correct
15 Correct 16 ms 3768 KB Output is correct
16 Correct 15 ms 3652 KB Output is correct
17 Correct 15 ms 3640 KB Output is correct
18 Partially correct 15 ms 3648 KB Partially correct
19 Correct 16 ms 3652 KB Output is correct
20 Correct 12 ms 4180 KB Output is correct
21 Correct 12 ms 4164 KB Output is correct
22 Correct 17 ms 4088 KB Output is correct
23 Correct 19 ms 4176 KB Output is correct
24 Correct 19 ms 4272 KB Output is correct
25 Correct 15 ms 4540 KB Output is correct
26 Correct 16 ms 4112 KB Output is correct
27 Correct 15 ms 4540 KB Output is correct
28 Correct 15 ms 4164 KB Output is correct
29 Correct 13 ms 3668 KB Output is correct
30 Correct 23 ms 3868 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5480 KB Output is correct
2 Correct 25 ms 5500 KB Output is correct
3 Correct 26 ms 5456 KB Output is correct
4 Correct 16 ms 3588 KB Output is correct
5 Correct 18 ms 5300 KB Output is correct
6 Correct 19 ms 4340 KB Output is correct
7 Correct 15 ms 4164 KB Output is correct
8 Correct 15 ms 4152 KB Output is correct
9 Correct 16 ms 4176 KB Output is correct
10 Correct 22 ms 4024 KB Output is correct
11 Correct 18 ms 4040 KB Output is correct
12 Correct 14 ms 3368 KB Output is correct
13 Correct 13 ms 3336 KB Output is correct
14 Correct 14 ms 3428 KB Output is correct
15 Correct 15 ms 3680 KB Output is correct
16 Correct 16 ms 3772 KB Output is correct
17 Correct 16 ms 3872 KB Output is correct
18 Incorrect 17 ms 3784 KB Output isn't correct
19 Halted 0 ms 0 KB -