oj.uz

답안 #773551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
773551 2023-07-05T06:40:58 Z LittleCube 게임 (APIO22_game) C++17
100 / 100
 3761 ms 251600 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include "game.h"
#ifndef EVAL
#include "game_grader.cpp"
#endif
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;

namespace
{
  const int P = 10;
  int n, k, from[300000][8], to[300000][8], where[300000][8];
  vector<int> Ef[300000][8], Et[300000][8];
  void update_from(int u, int layer, vector<int> &same)
  {
    if (from[u][layer] == to[u][layer])
      same.emplace_back(u);
    for (auto v : Ef[u][layer])
      if (from[u][layer] > from[v][layer])
      {
        from[v][layer] = from[u][layer];
        update_from(v, layer, same);
      }
  }
  void update_to(int u, int layer, vector<int> &same)
  {
    if (from[u][layer] == to[u][layer])
      same.emplace_back(u);
    for (auto v : Et[u][layer])
      if (to[u][layer] < to[v][layer])
      {
        to[v][layer] = to[u][layer];
        update_to(v, layer, same);
      }
  }

  void build(int i = 1, int L = 0, int R = k - 1, int l = 0)
  {
    for (int j = L; j <= R; j++)
      where[j][l] = i;
    if (L != R)
    {
      int range = (R - L + P) / P;
      for (int j = 1; j <= P; j++)
      {
        int ml = L + range * (j - 1), mr = min(R, L + range * j - 1);
        for (int p = ml; p <= mr; p++)
          from[p][l] = to[p][l] = j;
        if (ml <= mr)
          build(i * P + (j - 1), ml, mr, l + 1);
      }
    }
    else
      from[L][l] = 2, to[L][l] = 1;
  }

  int add_edge(int, int, int, int);

  int add_node(int u, int i, int l)
  {
    if (where[u][l])
      return 0;
    where[u][l] = i;
    from[u][l] = 0, to[u][l] = P + 1;
    bool flag = 0;
    for (auto v : Et[u][l - 1])
      if (where[u][l] == where[v][l])
        flag |= add_edge(v, u, i, l);
    for (auto v : Ef[u][l - 1])
      if (where[u][l] == where[v][l])
        flag |= add_edge(u, v, i, l);

    return flag | (from[u][l] > to[u][l]);
  }

  int add_edge(int u, int v, int i = 1, int l = 0)
  {
    Ef[u][l].emplace_back(v);
    Et[v][l].emplace_back(u);
    vector<int> s;
    bool flag = 0;
    if (v >= k && from[v][l] < from[u][l])
    {
      from[v][l] = from[u][l];
      update_from(v, l, s);
      flag |= (from[v][l] > to[v][l]);
    }
    if (u >= k && to[u][l] > to[v][l])
    {
      to[u][l] = to[v][l];
      update_to(u, l, s);
      flag |= (from[u][l] > to[u][l]);
    }
    if (where[u][l + 1] == where[v][l + 1] && where[u][l + 1] > 0)
      flag |= add_edge(u, v, where[u][l + 1], l + 1);
    for (int w : s)
      flag |= add_node(w, i * P + (from[w][l] - 1), l + 1);
    return flag;
  }
}

void init(int n, int k)
{
  ::n = n, ::k = k;
  build();
  for (int i = k; i < n; i++)
  {
    from[i][0] = 0, to[i][0] = P + 1;
    where[i][0] = 1;
  }
}

int add_teleporter(int u, int v)
{
  if (u < k && v < k)
  {
    if (v <= u)
      return 1;
    return 0;
  }
  bool ans = add_edge(u, v);
  // cout << u << ' ' << v << '\n';
  // for (int p = 0; p < 5; p++)
  //   for (int i = 0; i < n; i++)
  //     cout << from[i][p] << ' ' << to[i][p] << ' ' << " \n"[i == n - 1];

  // for (int p = 0; p < 5; p++)
  //   for (int i = 0; i < n; i++)
  //     cout << where[i][p] << " \n"[i == n - 1];
  // cout << '\n';
  return ans;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 113016 KB Output is correct
2 Correct 55 ms 112908 KB Output is correct
3 Correct 55 ms 112992 KB Output is correct
4 Correct 56 ms 112916 KB Output is correct
5 Correct 61 ms 112952 KB Output is correct
6 Correct 56 ms 112976 KB Output is correct
7 Correct 56 ms 112968 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 113016 KB Output is correct
2 Correct 55 ms 112908 KB Output is correct
3 Correct 55 ms 112992 KB Output is correct
4 Correct 56 ms 112916 KB Output is correct
5 Correct 61 ms 112952 KB Output is correct
6 Correct 56 ms 112976 KB Output is correct
7 Correct 56 ms 112968 KB Output is correct
8 Correct 57 ms 112920 KB Output is correct
9 Correct 55 ms 112968 KB Output is correct
10 Correct 55 ms 112996 KB Output is correct
11 Correct 56 ms 112956 KB Output is correct
12 Correct 58 ms 113024 KB Output is correct
13 Correct 56 ms 112968 KB Output is correct
14 Correct 56 ms 112972 KB Output is correct
15 Correct 55 ms 112984 KB Output is correct
16 Correct 56 ms 112992 KB Output is correct
17 Correct 59 ms 112940 KB Output is correct
18 Correct 54 ms 112944 KB Output is correct
19 Correct 59 ms 113152 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 113016 KB Output is correct
2 Correct 55 ms 112908 KB Output is correct
3 Correct 55 ms 112992 KB Output is correct
4 Correct 56 ms 112916 KB Output is correct
5 Correct 61 ms 112952 KB Output is correct
6 Correct 56 ms 112976 KB Output is correct
7 Correct 56 ms 112968 KB Output is correct
8 Correct 57 ms 112920 KB Output is correct
9 Correct 55 ms 112968 KB Output is correct
10 Correct 55 ms 112996 KB Output is correct
11 Correct 56 ms 112956 KB Output is correct
12 Correct 58 ms 113024 KB Output is correct
13 Correct 56 ms 112968 KB Output is correct
14 Correct 56 ms 112972 KB Output is correct
15 Correct 55 ms 112984 KB Output is correct
16 Correct 56 ms 112992 KB Output is correct
17 Correct 59 ms 112940 KB Output is correct
18 Correct 54 ms 112944 KB Output is correct
19 Correct 59 ms 113152 KB Output is correct
20 Correct 56 ms 113108 KB Output is correct
21 Correct 54 ms 113068 KB Output is correct
22 Correct 56 ms 113096 KB Output is correct
23 Correct 56 ms 113080 KB Output is correct
24 Correct 57 ms 113212 KB Output is correct
25 Correct 63 ms 113144 KB Output is correct
26 Correct 62 ms 113248 KB Output is correct
27 Correct 58 ms 113140 KB Output is correct
28 Correct 57 ms 113216 KB Output is correct
29 Correct 57 ms 113232 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 113016 KB Output is correct
2 Correct 55 ms 112908 KB Output is correct
3 Correct 55 ms 112992 KB Output is correct
4 Correct 56 ms 112916 KB Output is correct
5 Correct 61 ms 112952 KB Output is correct
6 Correct 56 ms 112976 KB Output is correct
7 Correct 56 ms 112968 KB Output is correct
8 Correct 57 ms 112920 KB Output is correct
9 Correct 55 ms 112968 KB Output is correct
10 Correct 55 ms 112996 KB Output is correct
11 Correct 56 ms 112956 KB Output is correct
12 Correct 58 ms 113024 KB Output is correct
13 Correct 56 ms 112968 KB Output is correct
14 Correct 56 ms 112972 KB Output is correct
15 Correct 55 ms 112984 KB Output is correct
16 Correct 56 ms 112992 KB Output is correct
17 Correct 59 ms 112940 KB Output is correct
18 Correct 54 ms 112944 KB Output is correct
19 Correct 59 ms 113152 KB Output is correct
20 Correct 56 ms 113108 KB Output is correct
21 Correct 54 ms 113068 KB Output is correct
22 Correct 56 ms 113096 KB Output is correct
23 Correct 56 ms 113080 KB Output is correct
24 Correct 57 ms 113212 KB Output is correct
25 Correct 63 ms 113144 KB Output is correct
26 Correct 62 ms 113248 KB Output is correct
27 Correct 58 ms 113140 KB Output is correct
28 Correct 57 ms 113216 KB Output is correct
29 Correct 57 ms 113232 KB Output is correct
30 Correct 73 ms 116948 KB Output is correct
31 Correct 63 ms 116124 KB Output is correct
32 Correct 91 ms 119204 KB Output is correct
33 Correct 79 ms 117708 KB Output is correct
34 Correct 183 ms 125912 KB Output is correct
35 Correct 105 ms 120520 KB Output is correct
36 Correct 109 ms 119268 KB Output is correct
37 Correct 110 ms 121288 KB Output is correct
38 Correct 92 ms 118108 KB Output is correct
39 Correct 95 ms 118692 KB Output is correct
40 Correct 144 ms 125464 KB Output is correct
41 Correct 109 ms 119180 KB Output is correct
42 Correct 95 ms 118544 KB Output is correct
43 Correct 134 ms 124012 KB Output is correct
44 Correct 153 ms 123464 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 113016 KB Output is correct
2 Correct 55 ms 112908 KB Output is correct
3 Correct 55 ms 112992 KB Output is correct
4 Correct 56 ms 112916 KB Output is correct
5 Correct 61 ms 112952 KB Output is correct
6 Correct 56 ms 112976 KB Output is correct
7 Correct 56 ms 112968 KB Output is correct
8 Correct 57 ms 112920 KB Output is correct
9 Correct 55 ms 112968 KB Output is correct
10 Correct 55 ms 112996 KB Output is correct
11 Correct 56 ms 112956 KB Output is correct
12 Correct 58 ms 113024 KB Output is correct
13 Correct 56 ms 112968 KB Output is correct
14 Correct 56 ms 112972 KB Output is correct
15 Correct 55 ms 112984 KB Output is correct
16 Correct 56 ms 112992 KB Output is correct
17 Correct 59 ms 112940 KB Output is correct
18 Correct 54 ms 112944 KB Output is correct
19 Correct 59 ms 113152 KB Output is correct
20 Correct 56 ms 113108 KB Output is correct
21 Correct 54 ms 113068 KB Output is correct
22 Correct 56 ms 113096 KB Output is correct
23 Correct 56 ms 113080 KB Output is correct
24 Correct 57 ms 113212 KB Output is correct
25 Correct 63 ms 113144 KB Output is correct
26 Correct 62 ms 113248 KB Output is correct
27 Correct 58 ms 113140 KB Output is correct
28 Correct 57 ms 113216 KB Output is correct
29 Correct 57 ms 113232 KB Output is correct
30 Correct 73 ms 116948 KB Output is correct
31 Correct 63 ms 116124 KB Output is correct
32 Correct 91 ms 119204 KB Output is correct
33 Correct 79 ms 117708 KB Output is correct
34 Correct 183 ms 125912 KB Output is correct
35 Correct 105 ms 120520 KB Output is correct
36 Correct 109 ms 119268 KB Output is correct
37 Correct 110 ms 121288 KB Output is correct
38 Correct 92 ms 118108 KB Output is correct
39 Correct 95 ms 118692 KB Output is correct
40 Correct 144 ms 125464 KB Output is correct
41 Correct 109 ms 119180 KB Output is correct
42 Correct 95 ms 118544 KB Output is correct
43 Correct 134 ms 124012 KB Output is correct
44 Correct 153 ms 123464 KB Output is correct
45 Correct 319 ms 152512 KB Output is correct
46 Correct 75 ms 141584 KB Output is correct
47 Correct 73 ms 141452 KB Output is correct
48 Correct 512 ms 174192 KB Output is correct
49 Correct 376 ms 160040 KB Output is correct
50 Correct 2321 ms 227480 KB Output is correct
51 Correct 1219 ms 190600 KB Output is correct
52 Correct 903 ms 174364 KB Output is correct
53 Correct 1291 ms 196012 KB Output is correct
54 Correct 1421 ms 214120 KB Output is correct
55 Correct 2724 ms 197464 KB Output is correct
56 Correct 3361 ms 214488 KB Output is correct
57 Correct 648 ms 169892 KB Output is correct
58 Correct 780 ms 174028 KB Output is correct
59 Correct 707 ms 174640 KB Output is correct
60 Correct 1273 ms 177420 KB Output is correct
61 Correct 1471 ms 187056 KB Output is correct
62 Correct 924 ms 185556 KB Output is correct
63 Correct 852 ms 182200 KB Output is correct
64 Correct 2544 ms 251600 KB Output is correct
65 Correct 777 ms 171592 KB Output is correct
66 Correct 573 ms 167300 KB Output is correct
67 Correct 1314 ms 185064 KB Output is correct
68 Correct 277 ms 150816 KB Output is correct
69 Correct 127 ms 145024 KB Output is correct
70 Correct 1128 ms 179288 KB Output is correct
71 Correct 392 ms 152804 KB Output is correct
72 Correct 287 ms 148552 KB Output is correct
73 Correct 856 ms 168148 KB Output is correct
74 Correct 3761 ms 216972 KB Output is correct
75 Correct 2247 ms 250136 KB Output is correct
76 Correct 2474 ms 233684 KB Output is correct