oj.uz

답안 #410483

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
410483 2021-05-22T18:40:36 Z 600Mihnea 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
100 / 100
 2979 ms 65084 KB 
#include <bits/stdc++.h>
#include "garden.h"
#include "gardenlib.h"

using namespace std;

const int K = 31;
const int N = 2 * 150000 + 7;
int n, m, city, from[N], to[N], y;
vector<int> g[N];

void add_edge(int a, int b) {
  from[y] = a;
  to[y] = b;
  g[a].push_back(y);
  y++;
}

int nxt[K][N];
bool contain[K][N];
int len_cycle[2], type_cycle[2];
int ff[N], tt[N];

bool ok;

bool func0(int len) {
  if (len < 0) return 0;
  if (len == 0) return 1;
  if (len_cycle[0] == -1) return 0;
  if (type_cycle[0] == 0) return (len % len_cycle[0] == 0);
  if (len_cycle[1] == -1) assert(0);
  if (len < len_cycle[0]) return 0;
  if (type_cycle[1] == 1) return (len - len_cycle[0]) % len_cycle[1] == 0;
  if (type_cycle[1] == 0) {
    int r = len % (len_cycle[0] + len_cycle[1]);
    if (r == 0 || r == len_cycle[0]) {
      return 1;
    } else {
      return 0;
    }
  }
  assert(0);
}

bool func1(int len) {
  if (len < 0) return 0;
  if (len == 0) return 1;
  if (len_cycle[1] == -1) return 0;



  if (type_cycle[1] == 1) return (len % len_cycle[1] == 0);
//  return ok;


  if (len_cycle[0] == -1) assert(0);
  if (len < len_cycle[1]) return 0;
  if (type_cycle[0] == 0) return (len - len_cycle[1]) % len_cycle[0] == 0;
  if (type_cycle[0] == 1) {
    int r = len % (len_cycle[0] + len_cycle[1]);
    if (r == 0 || r == len_cycle[1]) {
      return 1;
    } else {
      return 0;
    }
  }
  assert(0);
}


void count_routes(int nn, int mm, int pp, int rr[][2], int qq, int gg[]) {
  n = nn;
  m = mm;
  city = pp;
  y = 0;
  for (int i = 0; i < n; i++) {
    g[i].clear();
  }
  for (int i = 0; i < m; i++) {
    add_edge(rr[i][0], rr[i][1]);
    add_edge(rr[i][1], rr[i][0]);
  }
  for (int i = 0; i < y; i++) {
    int b = to[i];
    if ((int) g[b].size() == 1) {
      nxt[0][i] = i ^ 1;
    } else {
      if ((i ^ 1) == g[b][0]) {
        nxt[0][i] = g[b][1];
      } else {
        nxt[0][i] = g[b][0];
      }
    }
    contain[0][i] = (b == city);
  }
  for (int bit = 1; bit < K; bit++) {
    for (int i = 0; i < y; i++) {
      nxt[bit][i] = nxt[bit - 1][nxt[bit - 1][i]];
      contain[bit][i] = contain[bit - 1][i] | contain[bit - 1][nxt[bit - 1][i]];
    }
  }
  len_cycle[0] = len_cycle[1] = -1;
  for (int ies = 0; ies < min(2, (int) g[city].size()); ies++) {
    int i = g[city][ies];
    if (!contain[K - 1][i]) {
      continue;
    }
    int sz = 0;
    for (int j = K - 1; j >= 0; j--) {
      if (!contain[j][i]) {
        sz += (1 << j);
        i = nxt[j][i];
      }
    }
    len_cycle[ies] = sz;
    {
      bool este = 0;
      int i = g[city][ies];
      for (int bit = 0; bit < K; bit++) {
        if (len_cycle[ies] & (1 << bit)) {
          este |= contain[bit][i];
          i = nxt[bit][i];
        }
      }
      if ((int) g[city].size() == 1) {
        type_cycle[ies] = 0;
      } else {
        if ((i ^ 1) == g[city][0]) {
          type_cycle[ies] = 1;
        } else {
          type_cycle[ies] = 0;
        }
      }
    }
    len_cycle[ies]++;
  }
  vector<int> nodes;
  for (int a = 0; a < n; a++) {
    int i = g[a][0];
    if (!contain[K - 1][i] || a == city) {
      ff[a] = -1;
      continue;
    }
    nodes.push_back(a);
    int sz = 0;
    for (int j = K - 1; j >= 0; j--) {
      if (!contain[j][i]) {
        sz += (1 << j);
        i = nxt[j][i];
      }
    }
    ff[a] = sz;
    {
      bool este = 0;
      int i = g[a][0];
      for (int bit = 0; bit < K; bit++) {
        if (ff[a] & (1 << bit)) {
          este |= contain[bit][i];
          i = nxt[bit][i];
        }
      }
      if ((int) g[city].size() == 1) {
        tt[a] = 0;
      } else {
        if ((i ^ 1) == g[city][0]) {
          tt[a] = 1;
        } else {
          tt[a] = 0;
        }
      }
    }
    ff[a]++;
  }
  tt[city] = 0;
  ff[city] = 0;
  nodes.push_back(city);
  for (int qind = 0; qind < qq; qind++) {
    int len_query = gg[qind], sol = 0;
    for (auto &a : nodes) {
      /**int cur = g[a][0];
      for (int bit = 0; (1 << bit) <= len_query; bit++) {
        if (len_query & (1 << bit)) {
          cur = nxt[bit][cur];
        }
      }**/
      int len = len_query;
      if (tt[a] == 0) {
        len -= ff[a];
        bool me = func0(len);
        ok = me;
        //assert(me == ok);
      } else {
        len -= ff[a];
        bool me = func1(len);
        ok = me;
        //assert(me == ok);
      }
      if (ok) {
        sol++;
      }
    }
    answer(sol);
  }
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8012 KB Output is correct
2 Correct 6 ms 8088 KB Output is correct
3 Correct 6 ms 8012 KB Output is correct
4 Correct 5 ms 7628 KB Output is correct
5 Correct 5 ms 7628 KB Output is correct
6 Correct 7 ms 8400 KB Output is correct
7 Correct 5 ms 7756 KB Output is correct
8 Correct 6 ms 8088 KB Output is correct
9 Correct 10 ms 10424 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8012 KB Output is correct
2 Correct 6 ms 8088 KB Output is correct
3 Correct 6 ms 8012 KB Output is correct
4 Correct 5 ms 7628 KB Output is correct
5 Correct 5 ms 7628 KB Output is correct
6 Correct 7 ms 8400 KB Output is correct
7 Correct 5 ms 7756 KB Output is correct
8 Correct 6 ms 8088 KB Output is correct
9 Correct 10 ms 10424 KB Output is correct
10 Correct 6 ms 7644 KB Output is correct
11 Correct 21 ms 15948 KB Output is correct
12 Correct 43 ms 26436 KB Output is correct
13 Correct 71 ms 39268 KB Output is correct
14 Correct 115 ms 59844 KB Output is correct
15 Correct 162 ms 62776 KB Output is correct
16 Correct 138 ms 56796 KB Output is correct
17 Correct 114 ms 56400 KB Output is correct
18 Correct 40 ms 26428 KB Output is correct
19 Correct 115 ms 59868 KB Output is correct
20 Correct 159 ms 62692 KB Output is correct
21 Correct 148 ms 56760 KB Output is correct
22 Correct 154 ms 56300 KB Output is correct
23 Correct 125 ms 62448 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8012 KB Output is correct
2 Correct 6 ms 8088 KB Output is correct
3 Correct 6 ms 8012 KB Output is correct
4 Correct 5 ms 7628 KB Output is correct
5 Correct 5 ms 7628 KB Output is correct
6 Correct 7 ms 8400 KB Output is correct
7 Correct 5 ms 7756 KB Output is correct
8 Correct 6 ms 8088 KB Output is correct
9 Correct 10 ms 10424 KB Output is correct
10 Correct 6 ms 7644 KB Output is correct
11 Correct 21 ms 15948 KB Output is correct
12 Correct 43 ms 26436 KB Output is correct
13 Correct 71 ms 39268 KB Output is correct
14 Correct 115 ms 59844 KB Output is correct
15 Correct 162 ms 62776 KB Output is correct
16 Correct 138 ms 56796 KB Output is correct
17 Correct 114 ms 56400 KB Output is correct
18 Correct 40 ms 26428 KB Output is correct
19 Correct 115 ms 59868 KB Output is correct
20 Correct 159 ms 62692 KB Output is correct
21 Correct 148 ms 56760 KB Output is correct
22 Correct 154 ms 56300 KB Output is correct
23 Correct 125 ms 62448 KB Output is correct
24 Correct 7 ms 7676 KB Output is correct
25 Correct 50 ms 15944 KB Output is correct
26 Correct 56 ms 26420 KB Output is correct
27 Correct 1320 ms 39308 KB Output is correct
28 Correct 625 ms 61512 KB Output is correct
29 Correct 2979 ms 64540 KB Output is correct
30 Correct 1668 ms 58312 KB Output is correct
31 Correct 1720 ms 58032 KB Output is correct
32 Correct 53 ms 27060 KB Output is correct
33 Correct 620 ms 61556 KB Output is correct
34 Correct 2938 ms 64568 KB Output is correct
35 Correct 1797 ms 58292 KB Output is correct
36 Correct 1790 ms 58004 KB Output is correct
37 Correct 369 ms 64324 KB Output is correct
38 Correct 2809 ms 65084 KB Output is correct