oj.uz

답안 #773545

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
773545 2023-07-05T06:37:37 Z LittleCube 게임 (APIO22_game) C++17
60 / 100
 4000 ms 237664 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
{
  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 + 16) / 16;
      for (int j = 1; j <= 16; 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 << 4 | (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] = 17;
    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 << 4 | (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] = 17;
    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 53 ms 112940 KB Output is correct
2 Correct 54 ms 112928 KB Output is correct
3 Correct 55 ms 113004 KB Output is correct
4 Correct 65 ms 112984 KB Output is correct
5 Correct 55 ms 112936 KB Output is correct
6 Correct 55 ms 112900 KB Output is correct
7 Correct 56 ms 112900 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 112940 KB Output is correct
2 Correct 54 ms 112928 KB Output is correct
3 Correct 55 ms 113004 KB Output is correct
4 Correct 65 ms 112984 KB Output is correct
5 Correct 55 ms 112936 KB Output is correct
6 Correct 55 ms 112900 KB Output is correct
7 Correct 56 ms 112900 KB Output is correct
8 Correct 55 ms 112968 KB Output is correct
9 Correct 56 ms 112920 KB Output is correct
10 Correct 54 ms 113004 KB Output is correct
11 Correct 56 ms 112920 KB Output is correct
12 Correct 54 ms 112932 KB Output is correct
13 Correct 55 ms 112968 KB Output is correct
14 Correct 58 ms 113012 KB Output is correct
15 Correct 56 ms 113040 KB Output is correct
16 Correct 60 ms 112932 KB Output is correct
17 Correct 55 ms 113008 KB Output is correct
18 Correct 55 ms 112968 KB Output is correct
19 Correct 55 ms 112968 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 112940 KB Output is correct
2 Correct 54 ms 112928 KB Output is correct
3 Correct 55 ms 113004 KB Output is correct
4 Correct 65 ms 112984 KB Output is correct
5 Correct 55 ms 112936 KB Output is correct
6 Correct 55 ms 112900 KB Output is correct
7 Correct 56 ms 112900 KB Output is correct
8 Correct 55 ms 112968 KB Output is correct
9 Correct 56 ms 112920 KB Output is correct
10 Correct 54 ms 113004 KB Output is correct
11 Correct 56 ms 112920 KB Output is correct
12 Correct 54 ms 112932 KB Output is correct
13 Correct 55 ms 112968 KB Output is correct
14 Correct 58 ms 113012 KB Output is correct
15 Correct 56 ms 113040 KB Output is correct
16 Correct 60 ms 112932 KB Output is correct
17 Correct 55 ms 113008 KB Output is correct
18 Correct 55 ms 112968 KB Output is correct
19 Correct 55 ms 112968 KB Output is correct
20 Correct 55 ms 113116 KB Output is correct
21 Correct 56 ms 113028 KB Output is correct
22 Correct 55 ms 113080 KB Output is correct
23 Correct 55 ms 113156 KB Output is correct
24 Correct 55 ms 113224 KB Output is correct
25 Correct 56 ms 113232 KB Output is correct
26 Correct 57 ms 113148 KB Output is correct
27 Correct 57 ms 113252 KB Output is correct
28 Correct 58 ms 113128 KB Output is correct
29 Correct 57 ms 113224 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 112940 KB Output is correct
2 Correct 54 ms 112928 KB Output is correct
3 Correct 55 ms 113004 KB Output is correct
4 Correct 65 ms 112984 KB Output is correct
5 Correct 55 ms 112936 KB Output is correct
6 Correct 55 ms 112900 KB Output is correct
7 Correct 56 ms 112900 KB Output is correct
8 Correct 55 ms 112968 KB Output is correct
9 Correct 56 ms 112920 KB Output is correct
10 Correct 54 ms 113004 KB Output is correct
11 Correct 56 ms 112920 KB Output is correct
12 Correct 54 ms 112932 KB Output is correct
13 Correct 55 ms 112968 KB Output is correct
14 Correct 58 ms 113012 KB Output is correct
15 Correct 56 ms 113040 KB Output is correct
16 Correct 60 ms 112932 KB Output is correct
17 Correct 55 ms 113008 KB Output is correct
18 Correct 55 ms 112968 KB Output is correct
19 Correct 55 ms 112968 KB Output is correct
20 Correct 55 ms 113116 KB Output is correct
21 Correct 56 ms 113028 KB Output is correct
22 Correct 55 ms 113080 KB Output is correct
23 Correct 55 ms 113156 KB Output is correct
24 Correct 55 ms 113224 KB Output is correct
25 Correct 56 ms 113232 KB Output is correct
26 Correct 57 ms 113148 KB Output is correct
27 Correct 57 ms 113252 KB Output is correct
28 Correct 58 ms 113128 KB Output is correct
29 Correct 57 ms 113224 KB Output is correct
30 Correct 82 ms 116960 KB Output is correct
31 Correct 60 ms 116240 KB Output is correct
32 Correct 85 ms 118984 KB Output is correct
33 Correct 80 ms 117728 KB Output is correct
34 Correct 165 ms 125956 KB Output is correct
35 Correct 134 ms 120424 KB Output is correct
36 Correct 112 ms 119136 KB Output is correct
37 Correct 117 ms 121240 KB Output is correct
38 Correct 87 ms 117920 KB Output is correct
39 Correct 106 ms 118504 KB Output is correct
40 Correct 150 ms 125256 KB Output is correct
41 Correct 101 ms 119240 KB Output is correct
42 Correct 102 ms 118448 KB Output is correct
43 Correct 179 ms 123932 KB Output is correct
44 Correct 163 ms 123092 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 112940 KB Output is correct
2 Correct 54 ms 112928 KB Output is correct
3 Correct 55 ms 113004 KB Output is correct
4 Correct 65 ms 112984 KB Output is correct
5 Correct 55 ms 112936 KB Output is correct
6 Correct 55 ms 112900 KB Output is correct
7 Correct 56 ms 112900 KB Output is correct
8 Correct 55 ms 112968 KB Output is correct
9 Correct 56 ms 112920 KB Output is correct
10 Correct 54 ms 113004 KB Output is correct
11 Correct 56 ms 112920 KB Output is correct
12 Correct 54 ms 112932 KB Output is correct
13 Correct 55 ms 112968 KB Output is correct
14 Correct 58 ms 113012 KB Output is correct
15 Correct 56 ms 113040 KB Output is correct
16 Correct 60 ms 112932 KB Output is correct
17 Correct 55 ms 113008 KB Output is correct
18 Correct 55 ms 112968 KB Output is correct
19 Correct 55 ms 112968 KB Output is correct
20 Correct 55 ms 113116 KB Output is correct
21 Correct 56 ms 113028 KB Output is correct
22 Correct 55 ms 113080 KB Output is correct
23 Correct 55 ms 113156 KB Output is correct
24 Correct 55 ms 113224 KB Output is correct
25 Correct 56 ms 113232 KB Output is correct
26 Correct 57 ms 113148 KB Output is correct
27 Correct 57 ms 113252 KB Output is correct
28 Correct 58 ms 113128 KB Output is correct
29 Correct 57 ms 113224 KB Output is correct
30 Correct 82 ms 116960 KB Output is correct
31 Correct 60 ms 116240 KB Output is correct
32 Correct 85 ms 118984 KB Output is correct
33 Correct 80 ms 117728 KB Output is correct
34 Correct 165 ms 125956 KB Output is correct
35 Correct 134 ms 120424 KB Output is correct
36 Correct 112 ms 119136 KB Output is correct
37 Correct 117 ms 121240 KB Output is correct
38 Correct 87 ms 117920 KB Output is correct
39 Correct 106 ms 118504 KB Output is correct
40 Correct 150 ms 125256 KB Output is correct
41 Correct 101 ms 119240 KB Output is correct
42 Correct 102 ms 118448 KB Output is correct
43 Correct 179 ms 123932 KB Output is correct
44 Correct 163 ms 123092 KB Output is correct
45 Correct 352 ms 152492 KB Output is correct
46 Correct 70 ms 141500 KB Output is correct
47 Correct 81 ms 141500 KB Output is correct
48 Correct 600 ms 174244 KB Output is correct
49 Correct 421 ms 159968 KB Output is correct
50 Correct 2918 ms 217860 KB Output is correct
51 Correct 1448 ms 190444 KB Output is correct
52 Correct 986 ms 172240 KB Output is correct
53 Correct 1387 ms 194352 KB Output is correct
54 Correct 1448 ms 201528 KB Output is correct
55 Correct 3318 ms 192824 KB Output is correct
56 Correct 3998 ms 212616 KB Output is correct
57 Correct 737 ms 168928 KB Output is correct
58 Correct 778 ms 170252 KB Output is correct
59 Correct 755 ms 170252 KB Output is correct
60 Correct 1563 ms 168324 KB Output is correct
61 Correct 1731 ms 178900 KB Output is correct
62 Correct 1008 ms 185520 KB Output is correct
63 Correct 1027 ms 182604 KB Output is correct
64 Correct 3141 ms 237664 KB Output is correct
65 Correct 870 ms 169172 KB Output is correct
66 Correct 747 ms 164964 KB Output is correct
67 Correct 1647 ms 179812 KB Output is correct
68 Correct 310 ms 150944 KB Output is correct
69 Correct 135 ms 144664 KB Output is correct
70 Correct 1306 ms 174980 KB Output is correct
71 Correct 465 ms 152716 KB Output is correct
72 Correct 323 ms 148636 KB Output is correct
73 Correct 1039 ms 168252 KB Output is correct
74 Execution timed out 4069 ms 196024 KB Time limit exceeded
75 Halted 0 ms 0 KB -