oj.uz

Submission #500046

# Submission time Handle Problem Language Result Execution time Memory
500046 2021-12-30T09:52:41 Z 600Mihnea Amusement Park (JOI17_amusement_park) C++17
78 / 100
 26 ms 5428 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 1 ms 496 KB Output is correct
2 Correct 0 ms 752 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 0 ms 624 KB Output is correct
5 Correct 1 ms 752 KB Output is correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 1 ms 756 KB Output is correct
8 Correct 2 ms 752 KB Output is correct
9 Correct 1 ms 756 KB Output is correct
10 Correct 0 ms 752 KB Output is correct
11 Correct 3 ms 1048 KB Output is correct
12 Correct 0 ms 492 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 1 ms 772 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 2 ms 740 KB Output is correct
17 Correct 1 ms 748 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 26 ms 5292 KB Output is correct
2 Correct 24 ms 5320 KB Output is correct
3 Correct 23 ms 5348 KB Output is correct
4 Correct 14 ms 3512 KB Output is correct
5 Correct 17 ms 4908 KB Output is correct
6 Correct 15 ms 4420 KB Output is correct
7 Correct 16 ms 4392 KB Output is correct
8 Correct 18 ms 4412 KB Output is correct
9 Correct 15 ms 4164 KB Output is correct
10 Correct 15 ms 4036 KB Output is correct
11 Correct 15 ms 3772 KB Output is correct
12 Correct 13 ms 3192 KB Output is correct
13 Correct 13 ms 3256 KB Output is correct
14 Correct 13 ms 3248 KB Output is correct
15 Correct 17 ms 3652 KB Output is correct
16 Correct 22 ms 3644 KB Output is correct
17 Correct 18 ms 3528 KB Output is correct
18 Correct 16 ms 3520 KB Output is correct
19 Correct 16 ms 3520 KB Output is correct
20 Correct 11 ms 4156 KB Output is correct
21 Correct 11 ms 3904 KB Output is correct
22 Correct 15 ms 4412 KB Output is correct
23 Correct 15 ms 4080 KB Output is correct
24 Correct 15 ms 4036 KB Output is correct
25 Correct 15 ms 4152 KB Output is correct
26 Correct 16 ms 4152 KB Output is correct
27 Correct 15 ms 4032 KB Output is correct
28 Correct 15 ms 4164 KB Output is correct
29 Correct 14 ms 3916 KB Output is correct
30 Correct 13 ms 3892 KB Output is correct
31 Correct 0 ms 616 KB Output is correct
32 Correct 2 ms 612 KB Output is correct
33 Correct 2 ms 748 KB Output is correct
34 Correct 2 ms 624 KB Output is correct
35 Correct 1 ms 616 KB Output is correct
36 Correct 0 ms 616 KB Output is correct
37 Correct 0 ms 624 KB Output is correct
38 Correct 0 ms 496 KB Output is correct
39 Correct 0 ms 496 KB Output is correct
40 Correct 0 ms 744 KB Output is correct
41 Correct 1 ms 752 KB Output is correct
42 Correct 0 ms 616 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 612 KB Output is correct
2 Correct 1 ms 616 KB Output is correct
3 Correct 2 ms 616 KB Output is correct
4 Correct 3 ms 1296 KB Output is correct
5 Correct 4 ms 1284 KB Output is correct
6 Correct 2 ms 1276 KB Output is correct
7 Correct 3 ms 1284 KB Output is correct
8 Correct 2 ms 1296 KB Output is correct
9 Correct 11 ms 5356 KB Output is correct
10 Correct 11 ms 4924 KB Output is correct
11 Correct 14 ms 4976 KB Output is correct
12 Correct 0 ms 612 KB Output is correct
13 Correct 0 ms 512 KB Output is correct
14 Correct 0 ms 488 KB Output is correct
15 Correct 0 ms 496 KB Output is correct

Subtask #4
50.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 25 ms 5428 KB Partially correct
2 Partially correct 24 ms 5320 KB Partially correct
3 Partially correct 24 ms 5308 KB Partially correct
4 Correct 17 ms 3520 KB Output is correct
5 Partially correct 15 ms 5064 KB Partially correct
6 Correct 17 ms 4040 KB Output is correct
7 Partially correct 19 ms 4116 KB Partially correct
8 Partially correct 20 ms 4392 KB Partially correct
9 Partially correct 19 ms 4020 KB Partially correct
10 Correct 15 ms 3908 KB Output is correct
11 Correct 16 ms 3772 KB Output is correct
12 Correct 16 ms 3156 KB Output is correct
13 Partially correct 13 ms 3252 KB Partially correct
14 Partially correct 14 ms 3248 KB Partially correct
15 Partially correct 15 ms 3708 KB Partially correct
16 Correct 15 ms 3600 KB Output is correct
17 Correct 18 ms 3512 KB Output is correct
18 Partially correct 17 ms 3488 KB Partially correct
19 Correct 16 ms 3508 KB Output is correct
20 Partially correct 13 ms 4152 KB Partially correct
21 Partially correct 11 ms 3904 KB Partially correct
22 Partially correct 14 ms 4420 KB Partially correct
23 Partially correct 15 ms 4160 KB Partially correct
24 Partially correct 15 ms 4136 KB Partially correct
25 Correct 15 ms 4420 KB Output is correct
26 Partially correct 17 ms 4408 KB Partially correct
27 Partially correct 15 ms 3928 KB Partially correct
28 Partially correct 15 ms 4420 KB Partially correct
29 Correct 18 ms 3752 KB Output is correct
30 Partially correct 15 ms 3764 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 5320 KB Output isn't correct
2 Halted 0 ms 0 KB -