oj.uz

Submission #500043

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

using namespace std;

const int BITS = 60;

mt19937 reng(7777);


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

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 620 KB Output is correct
2 Correct 1 ms 744 KB Output is correct
3 Correct 1 ms 756 KB Output is correct
4 Correct 0 ms 744 KB Output is correct
5 Correct 0 ms 616 KB Output is correct
6 Correct 1 ms 688 KB Output is correct
7 Correct 1 ms 756 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 1 ms 756 KB Output is correct
10 Correct 1 ms 744 KB Output is correct
11 Correct 5 ms 1048 KB Output is correct
12 Correct 0 ms 496 KB Output is correct
13 Correct 0 ms 756 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 752 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 1 ms 756 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 33 ms 5192 KB Output is correct
2 Correct 27 ms 5288 KB Output is correct
3 Correct 23 ms 5312 KB Output is correct
4 Correct 15 ms 3524 KB Output is correct
5 Correct 15 ms 4928 KB Output is correct
6 Correct 16 ms 4364 KB Output is correct
7 Correct 15 ms 4424 KB Output is correct
8 Correct 19 ms 4412 KB Output is correct
9 Correct 19 ms 4140 KB Output is correct
10 Correct 23 ms 3904 KB Output is correct
11 Correct 18 ms 3920 KB Output is correct
12 Correct 13 ms 3280 KB Output is correct
13 Correct 14 ms 3244 KB Output is correct
14 Correct 14 ms 3252 KB Output is correct
15 Correct 15 ms 3760 KB Output is correct
16 Correct 16 ms 3660 KB Output is correct
17 Correct 17 ms 3452 KB Output is correct
18 Correct 16 ms 3532 KB Output is correct
19 Correct 23 ms 3516 KB Output is correct
20 Correct 13 ms 4152 KB Output is correct
21 Correct 12 ms 3900 KB Output is correct
22 Correct 15 ms 4444 KB Output is correct
23 Correct 14 ms 4024 KB Output is correct
24 Correct 18 ms 4024 KB Output is correct
25 Correct 16 ms 4164 KB Output is correct
26 Correct 18 ms 4120 KB Output is correct
27 Correct 23 ms 4008 KB Output is correct
28 Correct 16 ms 4144 KB Output is correct
29 Correct 14 ms 3912 KB Output is correct
30 Correct 15 ms 3896 KB Output is correct
31 Correct 1 ms 752 KB Output is correct
32 Correct 2 ms 744 KB Output is correct
33 Correct 2 ms 748 KB Output is correct
34 Correct 2 ms 744 KB Output is correct
35 Correct 1 ms 744 KB Output is correct
36 Correct 1 ms 484 KB Output is correct
37 Correct 0 ms 488 KB Output is correct
38 Correct 1 ms 488 KB Output is correct
39 Correct 1 ms 488 KB Output is correct
40 Correct 1 ms 744 KB Output is correct
41 Correct 1 ms 612 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 0 ms 632 KB Output is correct
2 Correct 0 ms 616 KB Output is correct
3 Correct 1 ms 616 KB Output is correct
4 Correct 4 ms 1212 KB Output is correct
5 Correct 3 ms 1284 KB Output is correct
6 Correct 2 ms 1284 KB Output is correct
7 Correct 3 ms 1284 KB Output is correct
8 Correct 4 ms 1284 KB Output is correct
9 Correct 15 ms 5280 KB Output is correct
10 Correct 16 ms 4824 KB Output is correct
11 Correct 20 ms 5072 KB Output is correct
12 Correct 1 ms 616 KB Output is correct
13 Correct 1 ms 616 KB Output is correct
14 Correct 0 ms 616 KB Output is correct
15 Correct 1 ms 488 KB Output is correct

Subtask #4
54.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5236 KB Output is correct
2 Correct 26 ms 5320 KB Output is correct
3 Correct 36 ms 5292 KB Output is correct
4 Correct 23 ms 3448 KB Output is correct
5 Correct 17 ms 4976 KB Output is correct
6 Correct 19 ms 3988 KB Output is correct
7 Correct 20 ms 4104 KB Output is correct
8 Correct 15 ms 4408 KB Output is correct
9 Correct 16 ms 3956 KB Output is correct
10 Correct 19 ms 3980 KB Output is correct
11 Correct 25 ms 3904 KB Output is correct
12 Correct 17 ms 3240 KB Output is correct
13 Partially correct 13 ms 3224 KB Partially correct
14 Partially correct 17 ms 3388 KB Partially correct
15 Correct 15 ms 3644 KB Output is correct
16 Correct 17 ms 3648 KB Output is correct
17 Correct 18 ms 3452 KB Output is correct
18 Partially correct 20 ms 3492 KB Partially correct
19 Correct 20 ms 3516 KB Output is correct
20 Correct 12 ms 4156 KB Output is correct
21 Correct 13 ms 3912 KB Output is correct
22 Correct 15 ms 4408 KB Output is correct
23 Correct 15 ms 4152 KB Output is correct
24 Correct 15 ms 4240 KB Output is correct
25 Correct 16 ms 4428 KB Output is correct
26 Correct 15 ms 4592 KB Output is correct
27 Correct 18 ms 3940 KB Output is correct
28 Correct 16 ms 4400 KB Output is correct
29 Correct 16 ms 3736 KB Output is correct
30 Correct 16 ms 3748 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5324 KB Output is correct
2 Correct 24 ms 5364 KB Output is correct
3 Correct 24 ms 5392 KB Output is correct
4 Correct 15 ms 3632 KB Output is correct
5 Correct 19 ms 5032 KB Output is correct
6 Correct 19 ms 4320 KB Output is correct
7 Correct 22 ms 4228 KB Output is correct
8 Correct 16 ms 4384 KB Output is correct
9 Correct 17 ms 4164 KB Output is correct
10 Correct 17 ms 3916 KB Output is correct
11 Correct 15 ms 3944 KB Output is correct
12 Correct 13 ms 3320 KB Output is correct
13 Correct 14 ms 3196 KB Output is correct
14 Incorrect 15 ms 3252 KB Output isn't correct
15 Halted 0 ms 0 KB -