oj.uz

Submission #231564

# Submission time Handle Problem Language Result Execution time Memory
231564 2020-05-14T01:00:00 Z xiaowuc1 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1896 ms 51140 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define derr if(1) cerr
typedef vector<int> vi;
// END NO SAD

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int SAVE = 30;
vector<pii> best[100005];
vector<int> edges[100005];

int excluded[100005];
int n;
int dp[100005];
void solve(int dest, int id) {
  memset(dp, -1, sizeof(dp));
  for(int i = 1; i <= dest; i++) {
    if(excluded[i] != id) dp[i] = max(dp[i], 0);
    for(int out: edges[i]) {
      if(dp[out] < 0) continue;
      dp[i] = max(dp[i], dp[out] + 1);
    }
  }
  cout << dp[dest] << "\n";
}

void solve() {
  int q;
  {
    int m;
    cin >> n >> m >> q;
    while(m--) {
      int a, b;
      cin >> a >> b;
      edges[b].push_back(a);
    }
  }
  for(int i = 1; i <= n; i++) {
    map<int, int> cache;
    cache[i] = 0;
    for(int par: edges[i]) {
      for(pii val: best[par]) {
        cache[val.second] = max(cache[val.second], val.first + 1);
      }
    }
    for(auto out: cache) {
      best[i].emplace_back(out.second, out.first);
    }
    if(sz(best[i]) > SAVE) {
      nth_element(best[i].begin(), best[i].begin() + sz(best[i]) - SAVE, best[i].end());
      reverse(all(best[i]));
      best[i].resize(SAVE);
    }
    sort(rall(best[i]));
  }
  for(int qq = 1; qq <= q; qq++) {
    int dest;
    cin >> dest;
    int k;
    cin >> k;
    while(k--) {
      int x;
      cin >> x;
      excluded[x] = qq;
    }
    int ret = -2;
    bool found = false;
    for(pii out: best[dest]) {
      if(excluded[out.second] == qq) continue;
      ret = out.first;
      found = true;
      break;
    }
    if(found) {
      cout << ret << "\n";
      continue;
    }
    solve(dest, qq);
  }
}


// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5376 KB Output is correct
3 Correct 7 ms 5376 KB Output is correct
4 Correct 9 ms 5376 KB Output is correct
5 Correct 13 ms 5376 KB Output is correct
6 Correct 13 ms 5376 KB Output is correct
7 Correct 13 ms 5760 KB Output is correct
8 Correct 12 ms 5376 KB Output is correct
9 Correct 12 ms 5376 KB Output is correct
10 Correct 13 ms 5760 KB Output is correct
11 Correct 12 ms 5376 KB Output is correct
12 Correct 15 ms 5504 KB Output is correct
13 Correct 12 ms 5760 KB Output is correct
14 Correct 13 ms 5760 KB Output is correct
15 Correct 14 ms 5376 KB Output is correct
16 Correct 12 ms 5376 KB Output is correct
17 Correct 12 ms 5376 KB Output is correct
18 Correct 13 ms 5376 KB Output is correct
19 Correct 12 ms 5760 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5376 KB Output is correct
3 Correct 7 ms 5376 KB Output is correct
4 Correct 9 ms 5376 KB Output is correct
5 Correct 13 ms 5376 KB Output is correct
6 Correct 13 ms 5376 KB Output is correct
7 Correct 13 ms 5760 KB Output is correct
8 Correct 12 ms 5376 KB Output is correct
9 Correct 12 ms 5376 KB Output is correct
10 Correct 13 ms 5760 KB Output is correct
11 Correct 12 ms 5376 KB Output is correct
12 Correct 15 ms 5504 KB Output is correct
13 Correct 12 ms 5760 KB Output is correct
14 Correct 13 ms 5760 KB Output is correct
15 Correct 14 ms 5376 KB Output is correct
16 Correct 12 ms 5376 KB Output is correct
17 Correct 12 ms 5376 KB Output is correct
18 Correct 13 ms 5376 KB Output is correct
19 Correct 12 ms 5760 KB Output is correct
20 Correct 157 ms 6392 KB Output is correct
21 Correct 158 ms 6392 KB Output is correct
22 Correct 155 ms 6776 KB Output is correct
23 Correct 157 ms 6520 KB Output is correct
24 Correct 774 ms 42744 KB Output is correct
25 Correct 849 ms 42744 KB Output is correct
26 Correct 795 ms 42872 KB Output is correct
27 Correct 578 ms 35360 KB Output is correct
28 Correct 572 ms 35316 KB Output is correct
29 Correct 582 ms 35448 KB Output is correct
30 Correct 541 ms 35236 KB Output is correct
31 Correct 799 ms 46968 KB Output is correct
32 Correct 555 ms 35576 KB Output is correct
33 Correct 517 ms 33144 KB Output is correct
34 Correct 843 ms 42792 KB Output is correct
35 Correct 508 ms 33032 KB Output is correct
36 Correct 515 ms 33656 KB Output is correct
37 Correct 800 ms 42628 KB Output is correct
38 Correct 509 ms 33784 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 5376 KB Output is correct
3 Correct 7 ms 5376 KB Output is correct
4 Correct 9 ms 5376 KB Output is correct
5 Correct 13 ms 5376 KB Output is correct
6 Correct 13 ms 5376 KB Output is correct
7 Correct 13 ms 5760 KB Output is correct
8 Correct 12 ms 5376 KB Output is correct
9 Correct 12 ms 5376 KB Output is correct
10 Correct 13 ms 5760 KB Output is correct
11 Correct 12 ms 5376 KB Output is correct
12 Correct 15 ms 5504 KB Output is correct
13 Correct 12 ms 5760 KB Output is correct
14 Correct 13 ms 5760 KB Output is correct
15 Correct 14 ms 5376 KB Output is correct
16 Correct 12 ms 5376 KB Output is correct
17 Correct 12 ms 5376 KB Output is correct
18 Correct 13 ms 5376 KB Output is correct
19 Correct 12 ms 5760 KB Output is correct
20 Correct 157 ms 6392 KB Output is correct
21 Correct 158 ms 6392 KB Output is correct
22 Correct 155 ms 6776 KB Output is correct
23 Correct 157 ms 6520 KB Output is correct
24 Correct 774 ms 42744 KB Output is correct
25 Correct 849 ms 42744 KB Output is correct
26 Correct 795 ms 42872 KB Output is correct
27 Correct 578 ms 35360 KB Output is correct
28 Correct 572 ms 35316 KB Output is correct
29 Correct 582 ms 35448 KB Output is correct
30 Correct 541 ms 35236 KB Output is correct
31 Correct 799 ms 46968 KB Output is correct
32 Correct 555 ms 35576 KB Output is correct
33 Correct 517 ms 33144 KB Output is correct
34 Correct 843 ms 42792 KB Output is correct
35 Correct 508 ms 33032 KB Output is correct
36 Correct 515 ms 33656 KB Output is correct
37 Correct 800 ms 42628 KB Output is correct
38 Correct 509 ms 33784 KB Output is correct
39 Correct 842 ms 43128 KB Output is correct
40 Correct 666 ms 40440 KB Output is correct
41 Correct 609 ms 36728 KB Output is correct
42 Correct 771 ms 42744 KB Output is correct
43 Correct 757 ms 42488 KB Output is correct
44 Correct 187 ms 6776 KB Output is correct
45 Correct 162 ms 6392 KB Output is correct
46 Correct 162 ms 6392 KB Output is correct
47 Correct 164 ms 6392 KB Output is correct
48 Correct 155 ms 6392 KB Output is correct
49 Correct 598 ms 35960 KB Output is correct
50 Correct 1206 ms 35448 KB Output is correct
51 Correct 185 ms 7160 KB Output is correct
52 Correct 523 ms 6904 KB Output is correct
53 Correct 549 ms 34040 KB Output is correct
54 Correct 865 ms 42860 KB Output is correct
55 Correct 1057 ms 33528 KB Output is correct
56 Correct 728 ms 40624 KB Output is correct
57 Correct 183 ms 7160 KB Output is correct
58 Correct 184 ms 7288 KB Output is correct
59 Correct 530 ms 6776 KB Output is correct
60 Correct 531 ms 6904 KB Output is correct
61 Correct 624 ms 35448 KB Output is correct
62 Correct 582 ms 33400 KB Output is correct
63 Correct 852 ms 42360 KB Output is correct
64 Correct 777 ms 35320 KB Output is correct
65 Correct 735 ms 33752 KB Output is correct
66 Correct 998 ms 42872 KB Output is correct
67 Correct 892 ms 35448 KB Output is correct
68 Correct 791 ms 33400 KB Output is correct
69 Correct 1014 ms 42232 KB Output is correct
70 Correct 568 ms 35448 KB Output is correct
71 Correct 515 ms 33656 KB Output is correct
72 Correct 781 ms 42260 KB Output is correct
73 Correct 599 ms 35320 KB Output is correct
74 Correct 529 ms 33568 KB Output is correct
75 Correct 842 ms 42492 KB Output is correct
76 Correct 616 ms 35960 KB Output is correct
77 Correct 566 ms 35380 KB Output is correct
78 Correct 571 ms 35320 KB Output is correct
79 Correct 189 ms 6776 KB Output is correct
80 Correct 160 ms 6392 KB Output is correct
81 Correct 152 ms 6520 KB Output is correct
82 Correct 594 ms 35960 KB Output is correct
83 Correct 966 ms 50680 KB Output is correct
84 Correct 520 ms 35320 KB Output is correct
85 Correct 988 ms 51140 KB Output is correct
86 Correct 537 ms 35320 KB Output is correct
87 Correct 896 ms 50040 KB Output is correct
88 Correct 188 ms 6776 KB Output is correct
89 Correct 199 ms 6776 KB Output is correct
90 Correct 162 ms 6392 KB Output is correct
91 Correct 166 ms 6520 KB Output is correct
92 Correct 157 ms 6392 KB Output is correct
93 Correct 159 ms 6520 KB Output is correct
94 Correct 565 ms 33528 KB Output is correct
95 Correct 927 ms 44920 KB Output is correct
96 Correct 515 ms 33132 KB Output is correct
97 Correct 865 ms 44408 KB Output is correct
98 Correct 525 ms 33272 KB Output is correct
99 Correct 842 ms 43600 KB Output is correct
100 Correct 193 ms 6904 KB Output is correct
101 Correct 185 ms 6908 KB Output is correct
102 Correct 165 ms 6684 KB Output is correct
103 Correct 176 ms 6648 KB Output is correct
104 Correct 152 ms 6684 KB Output is correct
105 Correct 157 ms 6652 KB Output is correct
106 Correct 554 ms 34296 KB Output is correct
107 Correct 812 ms 42912 KB Output is correct
108 Correct 550 ms 33632 KB Output is correct
109 Correct 767 ms 41340 KB Output is correct
110 Correct 518 ms 33632 KB Output is correct
111 Correct 783 ms 42232 KB Output is correct
112 Correct 188 ms 6904 KB Output is correct
113 Correct 188 ms 6776 KB Output is correct
114 Correct 164 ms 6392 KB Output is correct
115 Correct 163 ms 6520 KB Output is correct
116 Correct 157 ms 6392 KB Output is correct
117 Correct 159 ms 6392 KB Output is correct
118 Correct 647 ms 35448 KB Output is correct
119 Correct 535 ms 35960 KB Output is correct
120 Correct 877 ms 45688 KB Output is correct
121 Correct 573 ms 37604 KB Output is correct
122 Correct 511 ms 36204 KB Output is correct
123 Correct 820 ms 44668 KB Output is correct
124 Correct 1896 ms 37976 KB Output is correct
125 Correct 1610 ms 36316 KB Output is correct
126 Correct 772 ms 44280 KB Output is correct