oj.uz

Submission #128923

# Submission time Handle Problem Language Result Execution time Memory
128923 2019-07-11T10:57:57 Z RockyB Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1622 ms 94368 KB 
// In The Name Of The God

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back

#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()

#define rep(a, b, c) for (int (a) = (b); (a) <= (c); a++) 
#define per(a, b, c) for (int (a) = (b); (a) >= (c); a--) 

#define nl '\n'
#define ioi exit(0);

using namespace std;

const int MAX_N = (int)1e5 + 7;
const int K = 100;
const int inf = (int)1e9 + 7;

int n, m, q;
list <int> g[MAX_N];

int T, k;
int tmr;
int a[MAX_N], was[MAX_N], dp[MAX_N], h[MAX_N];
bool ban[MAX_N];

int calc(int v) {
  int res = -inf;
  if (was[v] == tmr) return dp[v];
  was[v] = tmr;
  if (!ban[v]) res = 0;
  for (auto to : g[v]) {
    res = max(res, calc(to) + 1);
  }
  return dp[v] = res;
}
void read() {
  cin >> T >> k;
  rep(i, 1, k) {
    cin >> a[i];
  }
}
void naive() {
  rep(i, 1, k) {
    ban[a[i]] = 1;
  }  
  ++tmr;
  int res = calc(T);
  if (res < 0) res = -1;
  cout << res << nl;
  rep(i, 1, k) {
    ban[a[i]] = 0;
  }  
}
int sz[MAX_N], used[MAX_N], pos[MAX_N];
pair <int, int> bfr[MAX_N];
pair <int, int> dist[MAX_N][K];
void pre() {
  rep(i, 1, n) {
    int S = 0;
    bfr[S++] = {0, i};
    for (auto to : g[i]) {
      for (int j = 0; j < sz[to]; j++) {
        auto it = dist[to][j];
        if (used[it.s] == i) {
          bfr[pos[it.s]].f = max(bfr[pos[it.s]].f, it.f + 1);
          continue;
        }
        pos[it.s] = S;
        used[it.s] = i;
        bfr[S++] = {it.f + 1, it.s};
      }
    }
    sort(bfr, bfr + S, greater < pair <int, int> > () );
    rep(j, 0, S - 1) {
      dist[i][sz[i]++] = bfr[j];
      if (sz[i] == K) break;
    }
  }
}
void fast() {
  int res = -1;
  rep(i, 1, k) {
    ban[a[i]] = 1;
  }
  rep(i, 0, sz[T] - 1) {
    if (!ban[dist[T][i].s]) {
      res = max(res, dist[T][i].f);
      break;
    }
  }
  rep(i, 1, k) {
    ban[a[i]] = 0;
  }
  cout << res << nl;
  //cerr << "DA\n";
}
int main() {
  ios_base :: sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  #ifdef IOI
    freopen ("in.txt", "r", stdin);
    freopen ("B.out", "w", stdout);
  #endif
  cin >> n >> m >> q;
  rep(i, 1, m) {
    int s, e;
    cin >> s >> e;
    g[e].pb(s);
  }
  pre();
  rep(i, 1, q) {
    read();
    if (k >= K) naive();
    else fast();
  }
  ioi
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2780 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 7 ms 3676 KB Output is correct
6 Correct 7 ms 3576 KB Output is correct
7 Correct 6 ms 3576 KB Output is correct
8 Correct 6 ms 3576 KB Output is correct
9 Correct 7 ms 3704 KB Output is correct
10 Correct 6 ms 3576 KB Output is correct
11 Correct 7 ms 3548 KB Output is correct
12 Correct 7 ms 3576 KB Output is correct
13 Correct 7 ms 3576 KB Output is correct
14 Correct 7 ms 3576 KB Output is correct
15 Correct 7 ms 3548 KB Output is correct
16 Correct 7 ms 3548 KB Output is correct
17 Correct 7 ms 3576 KB Output is correct
18 Correct 7 ms 3548 KB Output is correct
19 Correct 7 ms 3624 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2780 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 7 ms 3676 KB Output is correct
6 Correct 7 ms 3576 KB Output is correct
7 Correct 6 ms 3576 KB Output is correct
8 Correct 6 ms 3576 KB Output is correct
9 Correct 7 ms 3704 KB Output is correct
10 Correct 6 ms 3576 KB Output is correct
11 Correct 7 ms 3548 KB Output is correct
12 Correct 7 ms 3576 KB Output is correct
13 Correct 7 ms 3576 KB Output is correct
14 Correct 7 ms 3576 KB Output is correct
15 Correct 7 ms 3548 KB Output is correct
16 Correct 7 ms 3548 KB Output is correct
17 Correct 7 ms 3576 KB Output is correct
18 Correct 7 ms 3548 KB Output is correct
19 Correct 7 ms 3624 KB Output is correct
20 Correct 200 ms 9840 KB Output is correct
21 Correct 199 ms 9732 KB Output is correct
22 Correct 206 ms 9824 KB Output is correct
23 Correct 200 ms 9856 KB Output is correct
24 Correct 631 ms 88804 KB Output is correct
25 Correct 643 ms 88740 KB Output is correct
26 Correct 630 ms 88688 KB Output is correct
27 Correct 351 ms 91152 KB Output is correct
28 Correct 351 ms 91204 KB Output is correct
29 Correct 348 ms 92328 KB Output is correct
30 Correct 356 ms 87956 KB Output is correct
31 Correct 438 ms 88440 KB Output is correct
32 Correct 412 ms 88204 KB Output is correct
33 Correct 377 ms 88696 KB Output is correct
34 Correct 541 ms 88928 KB Output is correct
35 Correct 350 ms 88648 KB Output is correct
36 Correct 372 ms 88992 KB Output is correct
37 Correct 562 ms 88964 KB Output is correct
38 Correct 378 ms 88860 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2780 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 7 ms 3676 KB Output is correct
6 Correct 7 ms 3576 KB Output is correct
7 Correct 6 ms 3576 KB Output is correct
8 Correct 6 ms 3576 KB Output is correct
9 Correct 7 ms 3704 KB Output is correct
10 Correct 6 ms 3576 KB Output is correct
11 Correct 7 ms 3548 KB Output is correct
12 Correct 7 ms 3576 KB Output is correct
13 Correct 7 ms 3576 KB Output is correct
14 Correct 7 ms 3576 KB Output is correct
15 Correct 7 ms 3548 KB Output is correct
16 Correct 7 ms 3548 KB Output is correct
17 Correct 7 ms 3576 KB Output is correct
18 Correct 7 ms 3548 KB Output is correct
19 Correct 7 ms 3624 KB Output is correct
20 Correct 200 ms 9840 KB Output is correct
21 Correct 199 ms 9732 KB Output is correct
22 Correct 206 ms 9824 KB Output is correct
23 Correct 200 ms 9856 KB Output is correct
24 Correct 631 ms 88804 KB Output is correct
25 Correct 643 ms 88740 KB Output is correct
26 Correct 630 ms 88688 KB Output is correct
27 Correct 351 ms 91152 KB Output is correct
28 Correct 351 ms 91204 KB Output is correct
29 Correct 348 ms 92328 KB Output is correct
30 Correct 356 ms 87956 KB Output is correct
31 Correct 438 ms 88440 KB Output is correct
32 Correct 412 ms 88204 KB Output is correct
33 Correct 377 ms 88696 KB Output is correct
34 Correct 541 ms 88928 KB Output is correct
35 Correct 350 ms 88648 KB Output is correct
36 Correct 372 ms 88992 KB Output is correct
37 Correct 562 ms 88964 KB Output is correct
38 Correct 378 ms 88860 KB Output is correct
39 Correct 711 ms 88888 KB Output is correct
40 Correct 629 ms 88608 KB Output is correct
41 Correct 622 ms 89352 KB Output is correct
42 Correct 688 ms 89352 KB Output is correct
43 Correct 646 ms 88784 KB Output is correct
44 Correct 223 ms 10308 KB Output is correct
45 Correct 202 ms 9964 KB Output is correct
46 Correct 1568 ms 9944 KB Output is correct
47 Correct 449 ms 9820 KB Output is correct
48 Correct 228 ms 9976 KB Output is correct
49 Correct 386 ms 88304 KB Output is correct
50 Correct 1365 ms 93484 KB Output is correct
51 Correct 223 ms 10700 KB Output is correct
52 Correct 1622 ms 10492 KB Output is correct
53 Correct 421 ms 89520 KB Output is correct
54 Correct 640 ms 89592 KB Output is correct
55 Correct 1441 ms 89792 KB Output is correct
56 Correct 1312 ms 89976 KB Output is correct
57 Correct 220 ms 10744 KB Output is correct
58 Correct 246 ms 10748 KB Output is correct
59 Correct 1622 ms 10488 KB Output is correct
60 Correct 1583 ms 10616 KB Output is correct
61 Correct 536 ms 93688 KB Output is correct
62 Correct 584 ms 89984 KB Output is correct
63 Correct 659 ms 89848 KB Output is correct
64 Correct 942 ms 93944 KB Output is correct
65 Correct 995 ms 90000 KB Output is correct
66 Correct 967 ms 89824 KB Output is correct
67 Correct 1388 ms 93816 KB Output is correct
68 Correct 1331 ms 89820 KB Output is correct
69 Correct 1310 ms 89980 KB Output is correct
70 Correct 380 ms 93048 KB Output is correct
71 Correct 397 ms 89592 KB Output is correct
72 Correct 582 ms 89688 KB Output is correct
73 Correct 424 ms 93884 KB Output is correct
74 Correct 483 ms 90124 KB Output is correct
75 Correct 667 ms 90384 KB Output is correct
76 Correct 389 ms 89420 KB Output is correct
77 Correct 1319 ms 94368 KB Output is correct
78 Correct 372 ms 93820 KB Output is correct
79 Correct 234 ms 11384 KB Output is correct
80 Correct 1610 ms 11064 KB Output is correct
81 Correct 226 ms 10968 KB Output is correct
82 Correct 397 ms 89388 KB Output is correct
83 Correct 511 ms 89064 KB Output is correct
84 Correct 1556 ms 90488 KB Output is correct
85 Correct 1372 ms 89728 KB Output is correct
86 Correct 374 ms 89976 KB Output is correct
87 Correct 496 ms 89488 KB Output is correct
88 Correct 223 ms 11200 KB Output is correct
89 Correct 227 ms 10972 KB Output is correct
90 Correct 1539 ms 10920 KB Output is correct
91 Correct 1534 ms 10724 KB Output is correct
92 Correct 219 ms 10732 KB Output is correct
93 Correct 230 ms 10680 KB Output is correct
94 Correct 392 ms 89820 KB Output is correct
95 Correct 615 ms 89516 KB Output is correct
96 Correct 1301 ms 90240 KB Output is correct
97 Correct 1450 ms 90212 KB Output is correct
98 Correct 387 ms 90128 KB Output is correct
99 Correct 567 ms 89868 KB Output is correct
100 Correct 236 ms 11040 KB Output is correct
101 Correct 234 ms 11008 KB Output is correct
102 Correct 1329 ms 10712 KB Output is correct
103 Correct 1487 ms 10712 KB Output is correct
104 Correct 208 ms 10644 KB Output is correct
105 Correct 219 ms 10772 KB Output is correct
106 Correct 431 ms 89868 KB Output is correct
107 Correct 631 ms 89592 KB Output is correct
108 Correct 1259 ms 90364 KB Output is correct
109 Correct 1386 ms 90252 KB Output is correct
110 Correct 403 ms 90168 KB Output is correct
111 Correct 578 ms 90032 KB Output is correct
112 Correct 226 ms 11000 KB Output is correct
113 Correct 224 ms 11048 KB Output is correct
114 Correct 1528 ms 10716 KB Output is correct
115 Correct 1520 ms 10800 KB Output is correct
116 Correct 230 ms 10688 KB Output is correct
117 Correct 275 ms 10692 KB Output is correct
118 Correct 350 ms 88508 KB Output is correct
119 Correct 369 ms 89336 KB Output is correct
120 Correct 584 ms 89292 KB Output is correct
121 Correct 351 ms 88568 KB Output is correct
122 Correct 373 ms 89428 KB Output is correct
123 Correct 600 ms 89396 KB Output is correct
124 Correct 376 ms 88536 KB Output is correct
125 Correct 374 ms 89276 KB Output is correct
126 Correct 554 ms 89272 KB Output is correct