oj.uz

Submission #500031

# Submission time Handle Problem Language Result Execution time Memory
500031 2021-12-30T09:43:41 Z 600Mihnea Amusement Park (JOI17_amusement_park) C++17
77 / 100
 25 ms 5844 KB 
#include "Joi.h"
#include <bits/stdc++.h>

using namespace std;

const int BITS = 60;


void Joi(int N, int M, int A[], int B[], long long X, int T) {
  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(0);
  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(0);
  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;

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  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(0);
  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(0);
  while (sub[P] < BITS || !guys.count(P)) {
    V = Move(parrent[P]);
    P = parrent[P];
  }
  vector<pair<int, int>> all = guys[P];

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

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

  int done = 0;
  ll solu = 0;

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 496 KB Output is correct
2 Correct 1 ms 632 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 628 KB Output is correct
6 Correct 1 ms 624 KB Output is correct
7 Correct 1 ms 752 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 2 ms 752 KB Output is correct
10 Correct 1 ms 756 KB Output is correct
11 Correct 3 ms 1076 KB Output is correct
12 Correct 0 ms 496 KB Output is correct
13 Correct 1 ms 760 KB Output is correct
14 Correct 1 ms 748 KB Output is correct
15 Correct 1 ms 760 KB Output is correct
16 Correct 1 ms 764 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 2 ms 752 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5320 KB Output is correct
2 Correct 24 ms 5572 KB Output is correct
3 Correct 25 ms 5548 KB Output is correct
4 Correct 18 ms 3696 KB Output is correct
5 Correct 15 ms 4644 KB Output is correct
6 Correct 19 ms 4148 KB Output is correct
7 Correct 19 ms 4368 KB Output is correct
8 Correct 16 ms 4360 KB Output is correct
9 Correct 16 ms 4496 KB Output is correct
10 Correct 16 ms 3972 KB Output is correct
11 Correct 16 ms 4028 KB Output is correct
12 Correct 13 ms 3452 KB Output is correct
13 Correct 14 ms 3420 KB Output is correct
14 Correct 14 ms 3412 KB Output is correct
15 Correct 17 ms 3744 KB Output is correct
16 Correct 15 ms 3748 KB Output is correct
17 Correct 16 ms 3868 KB Output is correct
18 Correct 16 ms 3740 KB Output is correct
19 Correct 16 ms 3776 KB Output is correct
20 Correct 12 ms 4636 KB Output is correct
21 Correct 12 ms 4632 KB Output is correct
22 Correct 14 ms 4156 KB Output is correct
23 Correct 15 ms 4380 KB Output is correct
24 Correct 15 ms 4120 KB Output is correct
25 Correct 15 ms 4380 KB Output is correct
26 Correct 16 ms 4520 KB Output is correct
27 Correct 15 ms 4384 KB Output is correct
28 Correct 17 ms 4360 KB Output is correct
29 Correct 13 ms 4084 KB Output is correct
30 Correct 14 ms 4120 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 748 KB Output is correct
33 Correct 2 ms 752 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 0 ms 500 KB Output is correct
36 Correct 1 ms 500 KB Output is correct
37 Correct 0 ms 500 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 0 ms 500 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 620 KB Output is correct
42 Correct 1 ms 500 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 616 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 0 ms 720 KB Output is correct
4 Correct 3 ms 1376 KB Output is correct
5 Correct 3 ms 1388 KB Output is correct
6 Correct 3 ms 1344 KB Output is correct
7 Correct 2 ms 1428 KB Output is correct
8 Correct 2 ms 1432 KB Output is correct
9 Correct 12 ms 5584 KB Output is correct
10 Correct 13 ms 5844 KB Output is correct
11 Correct 13 ms 5640 KB Output is correct
12 Correct 1 ms 508 KB Output is correct
13 Correct 1 ms 500 KB Output is correct
14 Correct 0 ms 500 KB Output is correct
15 Correct 0 ms 596 KB Output is correct

Subtask #4
49.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 25 ms 5308 KB Partially correct
2 Partially correct 25 ms 5648 KB Partially correct
3 Partially correct 24 ms 5816 KB Partially correct
4 Correct 16 ms 3552 KB Output is correct
5 Partially correct 15 ms 5284 KB Partially correct
6 Correct 16 ms 4644 KB Output is correct
7 Partially correct 17 ms 4424 KB Partially correct
8 Correct 16 ms 4104 KB Output is correct
9 Partially correct 16 ms 4128 KB Partially correct
10 Correct 16 ms 3980 KB Output is correct
11 Correct 16 ms 4004 KB Output is correct
12 Correct 14 ms 3464 KB Output is correct
13 Partially correct 14 ms 3332 KB Partially correct
14 Partially correct 14 ms 3488 KB Partially correct
15 Partially correct 15 ms 3740 KB Partially correct
16 Correct 16 ms 3736 KB Output is correct
17 Correct 16 ms 3712 KB Output is correct
18 Partially correct 15 ms 3712 KB Partially correct
19 Partially correct 15 ms 3764 KB Partially correct
20 Correct 12 ms 4672 KB Output is correct
21 Correct 12 ms 4644 KB Output is correct
22 Partially correct 14 ms 4380 KB Partially correct
23 Partially correct 15 ms 4260 KB Partially correct
24 Partially correct 15 ms 4236 KB Partially correct
25 Partially correct 14 ms 4344 KB Partially correct
26 Partially correct 16 ms 4376 KB Partially correct
27 Partially correct 14 ms 4592 KB Partially correct
28 Partially correct 15 ms 4108 KB Partially correct
29 Partially correct 14 ms 4096 KB Partially correct
30 Partially correct 15 ms 4104 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5200 KB Output is correct
2 Incorrect 24 ms 5640 KB Output isn't correct
3 Halted 0 ms 0 KB -