Submission #44037

# Submission time Handle Problem Language Result Execution time Memory
44037 2018-03-29T12:12:37 Z wxh010910 Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
1040 ms 272436 KB
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define Debug(...) fprintf(stderr, __VA_ARGS__)

typedef long long LL;
typedef long double LD;
typedef unsigned int uint;
typedef pair <int, int> pii;
typedef unsigned long long uLL;

template <typename T> inline void Read(T &x) {
  char c = getchar();
  bool f = false;
  for (x = 0; !isdigit(c); c = getchar()) {
    if (c == '-') {
      f = true;
    }
  }
  for (; isdigit(c); c = getchar()) {
    x = x * 10 + c - '0';
  }
  if (f) {
    x = -x;
  }
}

template <typename T> inline bool CheckMax(T &a, const T &b) {
  return a < b ? a = b, true : false;
}

template <typename T> inline bool CheckMin(T &a, const T &b) {
  return a > b ? a = b, true : false;
}

const int N = 100005;
const int M = 325;

int n, m, q, tim, top, f[N], seq[N], siz[N], vis[N];
vector <int> adj[N], rev[N];
pii dis[N][M];
bool ban[N];

inline void Merge(int x, int y) {
  static pii tmp[M << 1];
  ++tim, top = 0;
  for (int i = 1, j = 1; i <= siz[x] || j <= siz[y]; ) {
    if (i <= siz[x] && (j > siz[y] || dis[x][i].X >= dis[y][j].X + 1)) {
      if (vis[dis[x][i].Y] != tim) {
        vis[dis[x][i].Y] = tim, tmp[++top] = dis[x][i];
      }
      ++i;
    } else {
      if (vis[dis[y][j].Y] != tim) {
        vis[dis[y][j].Y] = tim, tmp[++top] = mp(dis[y][j].X + 1, dis[y][j].Y);
      }
      ++j;
    }
  }
  CheckMin(top, 320);
  siz[x] = top;
  for (int i = 1; i <= siz[x]; ++i) {
    dis[x][i] = tmp[i];
  }
}

inline void Brute(int s) {
  int ans = -1;
  f[s] = 0;
  if (!ban[s]) {
    ans = 0;
  }
  for (int i = s - 1; i; --i) {
    f[i] = -n;
    for (auto j : adj[i]) {
      if (j <= s) {
        CheckMax(f[i], f[j] + 1);
      }
    }
    if (!ban[i]) {
      CheckMax(ans, f[i]);
    }
  }
  printf("%d\n", ans);
}

int main() {
#ifdef wxh010910
  freopen("d.in", "r", stdin);
#endif
  Read(n), Read(m), Read(q);
  for (int i = 1, x, y; i <= m; ++i) {
    Read(x), Read(y), adj[x].pb(y), rev[y].pb(x);
  }
  for (int x = 1; x <= n; ++x) {
    siz[x] = 1, dis[x][1] = mp(0, x);
    for (auto y : rev[x]) {
      Merge(x, y);
    }
  }
  for (int i = 1, x, k; i <= q; ++i) {
    Read(x), Read(k);
    for (int j = 1; j <= k; ++j) {
      Read(seq[j]), ban[seq[j]] = true;
    }
    if (k < 320) {
      bool flg = false;
      for (int j = 1; j <= siz[x]; ++j) {
        if (!ban[dis[x][j].Y]) {
          printf("%d\n", dis[x][j].X);
          flg = true;
          break;
        }
      }
      if (!flg) {
        puts("-1");
      }
    } else {
      Brute(x);
    }
    for (int j = 1; j <= k; ++j) {
      ban[seq[j]] = false;
    }
  }
#ifdef wxh010910
  Debug("My Time: %.3lfms\n", (double)clock() / CLOCKS_PER_SEC);
#endif
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5108 KB Output is correct
3 Correct 8 ms 5128 KB Output is correct
4 Correct 7 ms 5172 KB Output is correct
5 Correct 11 ms 7756 KB Output is correct
6 Correct 11 ms 7756 KB Output is correct
7 Correct 11 ms 7808 KB Output is correct
8 Correct 13 ms 7808 KB Output is correct
9 Correct 13 ms 7936 KB Output is correct
10 Correct 14 ms 7936 KB Output is correct
11 Correct 14 ms 7936 KB Output is correct
12 Correct 13 ms 7936 KB Output is correct
13 Correct 14 ms 7936 KB Output is correct
14 Correct 14 ms 7936 KB Output is correct
15 Correct 11 ms 7936 KB Output is correct
16 Correct 14 ms 7936 KB Output is correct
17 Correct 14 ms 7936 KB Output is correct
18 Correct 10 ms 7936 KB Output is correct
19 Correct 11 ms 7936 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5108 KB Output is correct
3 Correct 8 ms 5128 KB Output is correct
4 Correct 7 ms 5172 KB Output is correct
5 Correct 11 ms 7756 KB Output is correct
6 Correct 11 ms 7756 KB Output is correct
7 Correct 11 ms 7808 KB Output is correct
8 Correct 13 ms 7808 KB Output is correct
9 Correct 13 ms 7936 KB Output is correct
10 Correct 14 ms 7936 KB Output is correct
11 Correct 14 ms 7936 KB Output is correct
12 Correct 13 ms 7936 KB Output is correct
13 Correct 14 ms 7936 KB Output is correct
14 Correct 14 ms 7936 KB Output is correct
15 Correct 11 ms 7936 KB Output is correct
16 Correct 14 ms 7936 KB Output is correct
17 Correct 14 ms 7936 KB Output is correct
18 Correct 10 ms 7936 KB Output is correct
19 Correct 11 ms 7936 KB Output is correct
20 Correct 477 ms 10408 KB Output is correct
21 Correct 388 ms 10460 KB Output is correct
22 Correct 503 ms 10460 KB Output is correct
23 Correct 508 ms 10580 KB Output is correct
24 Correct 874 ms 266476 KB Output is correct
25 Correct 915 ms 266476 KB Output is correct
26 Correct 855 ms 266476 KB Output is correct
27 Correct 728 ms 268012 KB Output is correct
28 Correct 825 ms 268012 KB Output is correct
29 Correct 845 ms 269544 KB Output is correct
30 Correct 850 ms 269544 KB Output is correct
31 Correct 786 ms 270048 KB Output is correct
32 Correct 725 ms 271272 KB Output is correct
33 Correct 655 ms 271272 KB Output is correct
34 Correct 755 ms 271528 KB Output is correct
35 Correct 691 ms 271528 KB Output is correct
36 Correct 790 ms 271528 KB Output is correct
37 Correct 883 ms 271528 KB Output is correct
38 Correct 812 ms 271528 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5108 KB Output is correct
3 Correct 8 ms 5128 KB Output is correct
4 Correct 7 ms 5172 KB Output is correct
5 Correct 11 ms 7756 KB Output is correct
6 Correct 11 ms 7756 KB Output is correct
7 Correct 11 ms 7808 KB Output is correct
8 Correct 13 ms 7808 KB Output is correct
9 Correct 13 ms 7936 KB Output is correct
10 Correct 14 ms 7936 KB Output is correct
11 Correct 14 ms 7936 KB Output is correct
12 Correct 13 ms 7936 KB Output is correct
13 Correct 14 ms 7936 KB Output is correct
14 Correct 14 ms 7936 KB Output is correct
15 Correct 11 ms 7936 KB Output is correct
16 Correct 14 ms 7936 KB Output is correct
17 Correct 14 ms 7936 KB Output is correct
18 Correct 10 ms 7936 KB Output is correct
19 Correct 11 ms 7936 KB Output is correct
20 Correct 477 ms 10408 KB Output is correct
21 Correct 388 ms 10460 KB Output is correct
22 Correct 503 ms 10460 KB Output is correct
23 Correct 508 ms 10580 KB Output is correct
24 Correct 874 ms 266476 KB Output is correct
25 Correct 915 ms 266476 KB Output is correct
26 Correct 855 ms 266476 KB Output is correct
27 Correct 728 ms 268012 KB Output is correct
28 Correct 825 ms 268012 KB Output is correct
29 Correct 845 ms 269544 KB Output is correct
30 Correct 850 ms 269544 KB Output is correct
31 Correct 786 ms 270048 KB Output is correct
32 Correct 725 ms 271272 KB Output is correct
33 Correct 655 ms 271272 KB Output is correct
34 Correct 755 ms 271528 KB Output is correct
35 Correct 691 ms 271528 KB Output is correct
36 Correct 790 ms 271528 KB Output is correct
37 Correct 883 ms 271528 KB Output is correct
38 Correct 812 ms 271528 KB Output is correct
39 Correct 824 ms 271528 KB Output is correct
40 Correct 771 ms 271528 KB Output is correct
41 Correct 834 ms 271528 KB Output is correct
42 Correct 1040 ms 271528 KB Output is correct
43 Correct 879 ms 271528 KB Output is correct
44 Correct 512 ms 271528 KB Output is correct
45 Correct 482 ms 271528 KB Output is correct
46 Correct 469 ms 271528 KB Output is correct
47 Correct 535 ms 271528 KB Output is correct
48 Correct 459 ms 271528 KB Output is correct
49 Correct 843 ms 272204 KB Output is correct
50 Correct 795 ms 272204 KB Output is correct
51 Correct 403 ms 272204 KB Output is correct
52 Correct 382 ms 272204 KB Output is correct
53 Correct 767 ms 272204 KB Output is correct
54 Correct 745 ms 272204 KB Output is correct
55 Correct 747 ms 272204 KB Output is correct
56 Correct 749 ms 272204 KB Output is correct
57 Correct 478 ms 272204 KB Output is correct
58 Correct 497 ms 272204 KB Output is correct
59 Correct 468 ms 272204 KB Output is correct
60 Correct 475 ms 272204 KB Output is correct
61 Correct 859 ms 272212 KB Output is correct
62 Correct 875 ms 272212 KB Output is correct
63 Correct 912 ms 272212 KB Output is correct
64 Correct 972 ms 272212 KB Output is correct
65 Correct 1026 ms 272212 KB Output is correct
66 Correct 976 ms 272212 KB Output is correct
67 Correct 885 ms 272212 KB Output is correct
68 Correct 797 ms 272212 KB Output is correct
69 Correct 787 ms 272212 KB Output is correct
70 Correct 898 ms 272212 KB Output is correct
71 Correct 779 ms 272212 KB Output is correct
72 Correct 721 ms 272212 KB Output is correct
73 Correct 743 ms 272212 KB Output is correct
74 Correct 739 ms 272212 KB Output is correct
75 Correct 836 ms 272212 KB Output is correct
76 Correct 872 ms 272436 KB Output is correct
77 Correct 777 ms 272436 KB Output is correct
78 Correct 808 ms 272436 KB Output is correct
79 Correct 403 ms 272436 KB Output is correct
80 Correct 379 ms 272436 KB Output is correct
81 Correct 393 ms 272436 KB Output is correct
82 Correct 778 ms 272436 KB Output is correct
83 Correct 818 ms 272436 KB Output is correct
84 Correct 775 ms 272436 KB Output is correct
85 Correct 795 ms 272436 KB Output is correct
86 Correct 760 ms 272436 KB Output is correct
87 Correct 856 ms 272436 KB Output is correct
88 Correct 486 ms 272436 KB Output is correct
89 Correct 489 ms 272436 KB Output is correct
90 Correct 462 ms 272436 KB Output is correct
91 Correct 473 ms 272436 KB Output is correct
92 Correct 452 ms 272436 KB Output is correct
93 Correct 464 ms 272436 KB Output is correct
94 Correct 732 ms 272436 KB Output is correct
95 Correct 696 ms 272436 KB Output is correct
96 Correct 688 ms 272436 KB Output is correct
97 Correct 649 ms 272436 KB Output is correct
98 Correct 619 ms 272436 KB Output is correct
99 Correct 648 ms 272436 KB Output is correct
100 Correct 562 ms 272436 KB Output is correct
101 Correct 502 ms 272436 KB Output is correct
102 Correct 526 ms 272436 KB Output is correct
103 Correct 537 ms 272436 KB Output is correct
104 Correct 538 ms 272436 KB Output is correct
105 Correct 524 ms 272436 KB Output is correct
106 Correct 854 ms 272436 KB Output is correct
107 Correct 857 ms 272436 KB Output is correct
108 Correct 829 ms 272436 KB Output is correct
109 Correct 856 ms 272436 KB Output is correct
110 Correct 819 ms 272436 KB Output is correct
111 Correct 945 ms 272436 KB Output is correct
112 Correct 485 ms 272436 KB Output is correct
113 Correct 506 ms 272436 KB Output is correct
114 Correct 461 ms 272436 KB Output is correct
115 Correct 468 ms 272436 KB Output is correct
116 Correct 451 ms 272436 KB Output is correct
117 Correct 470 ms 272436 KB Output is correct
118 Correct 742 ms 272436 KB Output is correct
119 Correct 703 ms 272436 KB Output is correct
120 Correct 733 ms 272436 KB Output is correct
121 Correct 722 ms 272436 KB Output is correct
122 Correct 732 ms 272436 KB Output is correct
123 Correct 758 ms 272436 KB Output is correct
124 Correct 819 ms 272436 KB Output is correct
125 Correct 701 ms 272436 KB Output is correct
126 Correct 744 ms 272436 KB Output is correct