oj.uz

Submission #500050

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

using namespace std;

const int BITS = 60;

mt19937 reng(77777);


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(77777);

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;

  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;
    }
    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 || !guys.count(P)) {
    s.insert({P, parrent[P]});
    s.insert({parrent[P], P});
    V = Move(parrent[P]);
    P = parrent[P];
  }
  vector<pair<int, int>> all = guys[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);


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

  expl(P);

  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:120:7: warning: unused variable 'needBits' [-Wunused-variable]
  120 |   int needBits = BITS;
      |       ^~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5300 KB Output is correct
2 Correct 26 ms 5328 KB Output is correct
3 Correct 24 ms 5320 KB Output is correct
4 Correct 15 ms 3512 KB Output is correct
5 Correct 15 ms 5316 KB Output is correct
6 Correct 18 ms 3996 KB Output is correct
7 Correct 15 ms 4424 KB Output is correct
8 Correct 15 ms 4040 KB Output is correct
9 Correct 15 ms 4028 KB Output is correct
10 Correct 15 ms 3920 KB Output is correct
11 Correct 15 ms 3812 KB Output is correct
12 Correct 14 ms 3252 KB Output is correct
13 Correct 13 ms 3148 KB Output is correct
14 Correct 13 ms 3260 KB Output is correct
15 Correct 15 ms 3640 KB Output is correct
16 Correct 15 ms 3768 KB Output is correct
17 Correct 15 ms 3512 KB Output is correct
18 Correct 15 ms 3508 KB Output is correct
19 Correct 16 ms 3748 KB Output is correct
20 Correct 11 ms 4036 KB Output is correct
21 Correct 12 ms 4040 KB Output is correct
22 Correct 15 ms 4420 KB Output is correct
23 Correct 14 ms 4440 KB Output is correct
24 Correct 15 ms 4320 KB Output is correct
25 Correct 15 ms 4184 KB Output is correct
26 Correct 14 ms 4036 KB Output is correct
27 Correct 15 ms 4164 KB Output is correct
28 Correct 15 ms 4392 KB Output is correct
29 Correct 13 ms 3916 KB Output is correct
30 Correct 14 ms 4144 KB Output is correct
31 Correct 0 ms 744 KB Output is correct
32 Correct 0 ms 760 KB Output is correct
33 Correct 1 ms 756 KB Output is correct
34 Correct 0 ms 624 KB Output is correct
35 Correct 0 ms 624 KB Output is correct
36 Correct 0 ms 756 KB Output is correct
37 Correct 1 ms 620 KB Output is correct
38 Correct 0 ms 496 KB Output is correct
39 Correct 0 ms 492 KB Output is correct
40 Correct 0 ms 624 KB Output is correct
41 Correct 0 ms 752 KB Output is correct
42 Correct 1 ms 756 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 1 ms 488 KB Output is correct
3 Correct 0 ms 624 KB Output is correct
4 Correct 3 ms 1280 KB Output is correct
5 Correct 2 ms 1296 KB Output is correct
6 Correct 3 ms 1296 KB Output is correct
7 Correct 2 ms 1296 KB Output is correct
8 Correct 2 ms 1296 KB Output is correct
9 Correct 13 ms 5316 KB Output is correct
10 Correct 11 ms 4628 KB Output is correct
11 Correct 13 ms 5016 KB Output is correct
12 Correct 0 ms 496 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 0 ms 496 KB Output is correct
15 Correct 0 ms 484 KB Output is correct

Subtask #4
54.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5288 KB Output is correct
2 Partially correct 23 ms 5288 KB Partially correct
3 Correct 25 ms 5308 KB Output is correct
4 Correct 16 ms 3492 KB Output is correct
5 Correct 16 ms 4664 KB Output is correct
6 Correct 17 ms 4144 KB Output is correct
7 Correct 15 ms 4152 KB Output is correct
8 Correct 17 ms 3984 KB Output is correct
9 Correct 15 ms 4016 KB Output is correct
10 Correct 15 ms 4032 KB Output is correct
11 Correct 15 ms 3984 KB Output is correct
12 Correct 13 ms 3252 KB Output is correct
13 Partially correct 13 ms 3240 KB Partially correct
14 Partially correct 14 ms 3260 KB Partially correct
15 Correct 16 ms 3508 KB Output is correct
16 Correct 16 ms 3768 KB Output is correct
17 Correct 16 ms 3524 KB Output is correct
18 Partially correct 15 ms 3536 KB Partially correct
19 Correct 16 ms 3516 KB Output is correct
20 Correct 12 ms 4072 KB Output is correct
21 Correct 16 ms 4024 KB Output is correct
22 Correct 19 ms 4412 KB Output is correct
23 Correct 15 ms 4156 KB Output is correct
24 Correct 15 ms 4040 KB Output is correct
25 Correct 14 ms 4016 KB Output is correct
26 Correct 24 ms 4220 KB Output is correct
27 Correct 18 ms 3856 KB Output is correct
28 Correct 16 ms 4408 KB Output is correct
29 Correct 13 ms 4008 KB Output is correct
30 Correct 14 ms 3776 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5296 KB Output is correct
2 Correct 25 ms 5252 KB Output is correct
3 Incorrect 30 ms 5296 KB Output isn't correct
4 Halted 0 ms 0 KB -