oj.uz

Submission #231565

# Submission time Handle Problem Language Result Execution time Memory
231565 2020-05-14T01:13:01 Z xiaowuc1 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 839 ms 111352 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 = 100;
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);
    }
  }
  int id = 0;
  for(int i = 1; i <= n; i++) {
    map<int, int> cache;
    best[i].emplace_back(0, i);
    for(int par: edges[i]) {
      id++;
      vector<pii> nbest;
      int a = 0; // best[i]
      int b = 0; // best[par]
      while(sz(nbest) < SAVE && (a < sz(best[i]) || b < sz(best[par]))) {
        bool achoose = true;
        if(a == sz(best[i])) achoose = false;
        else if(b < sz(best[par]) && best[par][b].first + 1 > best[i][a].first) achoose = false;
        if(achoose) {
          if(excluded[best[i][a].second] != id) {
            excluded[best[i][a].second] = id;
            nbest.push_back(best[i][a]);
          }
          a++;
        }
        else {
          if(excluded[best[par][b].second] != id) {
            excluded[best[par][b].second] = id;
            nbest.emplace_back(best[par][b].first+1, best[par][b].second);
          }
          b++;
        }
      }
      best[i].swap(nbest);
    }
  }
  memset(excluded, 0, sizeof(excluded));
  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 5376 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5760 KB Output is correct
4 Correct 7 ms 5760 KB Output is correct
5 Correct 10 ms 5888 KB Output is correct
6 Correct 10 ms 5888 KB Output is correct
7 Correct 10 ms 5808 KB Output is correct
8 Correct 11 ms 6400 KB Output is correct
9 Correct 11 ms 6400 KB Output is correct
10 Correct 12 ms 6784 KB Output is correct
11 Correct 12 ms 6400 KB Output is correct
12 Correct 11 ms 6144 KB Output is correct
13 Correct 12 ms 6784 KB Output is correct
14 Correct 11 ms 6400 KB Output is correct
15 Correct 10 ms 5888 KB Output is correct
16 Correct 11 ms 6016 KB Output is correct
17 Correct 11 ms 6144 KB Output is correct
18 Correct 11 ms 6016 KB Output is correct
19 Correct 11 ms 6528 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5376 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5760 KB Output is correct
4 Correct 7 ms 5760 KB Output is correct
5 Correct 10 ms 5888 KB Output is correct
6 Correct 10 ms 5888 KB Output is correct
7 Correct 10 ms 5808 KB Output is correct
8 Correct 11 ms 6400 KB Output is correct
9 Correct 11 ms 6400 KB Output is correct
10 Correct 12 ms 6784 KB Output is correct
11 Correct 12 ms 6400 KB Output is correct
12 Correct 11 ms 6144 KB Output is correct
13 Correct 12 ms 6784 KB Output is correct
14 Correct 11 ms 6400 KB Output is correct
15 Correct 10 ms 5888 KB Output is correct
16 Correct 11 ms 6016 KB Output is correct
17 Correct 11 ms 6144 KB Output is correct
18 Correct 11 ms 6016 KB Output is correct
19 Correct 11 ms 6528 KB Output is correct
20 Correct 291 ms 7520 KB Output is correct
21 Correct 300 ms 7548 KB Output is correct
22 Correct 308 ms 7904 KB Output is correct
23 Correct 301 ms 7544 KB Output is correct
24 Correct 544 ms 85892 KB Output is correct
25 Correct 541 ms 87160 KB Output is correct
26 Correct 545 ms 87576 KB Output is correct
27 Correct 504 ms 110328 KB Output is correct
28 Correct 497 ms 110328 KB Output is correct
29 Correct 504 ms 110840 KB Output is correct
30 Correct 492 ms 110456 KB Output is correct
31 Correct 505 ms 108652 KB Output is correct
32 Correct 498 ms 110768 KB Output is correct
33 Correct 430 ms 72312 KB Output is correct
34 Correct 415 ms 65272 KB Output is correct
35 Correct 434 ms 71928 KB Output is correct
36 Correct 485 ms 91000 KB Output is correct
37 Correct 489 ms 86648 KB Output is correct
38 Correct 485 ms 91724 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5376 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 7 ms 5760 KB Output is correct
4 Correct 7 ms 5760 KB Output is correct
5 Correct 10 ms 5888 KB Output is correct
6 Correct 10 ms 5888 KB Output is correct
7 Correct 10 ms 5808 KB Output is correct
8 Correct 11 ms 6400 KB Output is correct
9 Correct 11 ms 6400 KB Output is correct
10 Correct 12 ms 6784 KB Output is correct
11 Correct 12 ms 6400 KB Output is correct
12 Correct 11 ms 6144 KB Output is correct
13 Correct 12 ms 6784 KB Output is correct
14 Correct 11 ms 6400 KB Output is correct
15 Correct 10 ms 5888 KB Output is correct
16 Correct 11 ms 6016 KB Output is correct
17 Correct 11 ms 6144 KB Output is correct
18 Correct 11 ms 6016 KB Output is correct
19 Correct 11 ms 6528 KB Output is correct
20 Correct 291 ms 7520 KB Output is correct
21 Correct 300 ms 7548 KB Output is correct
22 Correct 308 ms 7904 KB Output is correct
23 Correct 301 ms 7544 KB Output is correct
24 Correct 544 ms 85892 KB Output is correct
25 Correct 541 ms 87160 KB Output is correct
26 Correct 545 ms 87576 KB Output is correct
27 Correct 504 ms 110328 KB Output is correct
28 Correct 497 ms 110328 KB Output is correct
29 Correct 504 ms 110840 KB Output is correct
30 Correct 492 ms 110456 KB Output is correct
31 Correct 505 ms 108652 KB Output is correct
32 Correct 498 ms 110768 KB Output is correct
33 Correct 430 ms 72312 KB Output is correct
34 Correct 415 ms 65272 KB Output is correct
35 Correct 434 ms 71928 KB Output is correct
36 Correct 485 ms 91000 KB Output is correct
37 Correct 489 ms 86648 KB Output is correct
38 Correct 485 ms 91724 KB Output is correct
39 Correct 585 ms 86528 KB Output is correct
40 Correct 560 ms 86904 KB Output is correct
41 Correct 544 ms 87032 KB Output is correct
42 Correct 537 ms 86776 KB Output is correct
43 Correct 542 ms 86264 KB Output is correct
44 Correct 332 ms 7992 KB Output is correct
45 Correct 309 ms 7544 KB Output is correct
46 Correct 300 ms 7544 KB Output is correct
47 Correct 298 ms 7544 KB Output is correct
48 Correct 306 ms 7588 KB Output is correct
49 Correct 535 ms 111352 KB Output is correct
50 Correct 831 ms 110712 KB Output is correct
51 Correct 320 ms 8568 KB Output is correct
52 Correct 497 ms 7960 KB Output is correct
53 Correct 534 ms 91688 KB Output is correct
54 Correct 537 ms 86904 KB Output is correct
55 Correct 522 ms 91260 KB Output is correct
56 Correct 480 ms 87264 KB Output is correct
57 Correct 352 ms 8388 KB Output is correct
58 Correct 314 ms 8312 KB Output is correct
59 Correct 504 ms 7980 KB Output is correct
60 Correct 506 ms 7928 KB Output is correct
61 Correct 582 ms 110932 KB Output is correct
62 Correct 574 ms 91640 KB Output is correct
63 Correct 539 ms 86728 KB Output is correct
64 Correct 687 ms 110824 KB Output is correct
65 Correct 686 ms 91352 KB Output is correct
66 Correct 500 ms 87332 KB Output is correct
67 Correct 839 ms 110712 KB Output is correct
68 Correct 773 ms 91704 KB Output is correct
69 Correct 486 ms 85880 KB Output is correct
70 Correct 516 ms 110712 KB Output is correct
71 Correct 491 ms 91640 KB Output is correct
72 Correct 494 ms 86776 KB Output is correct
73 Correct 526 ms 110844 KB Output is correct
74 Correct 515 ms 91640 KB Output is correct
75 Correct 527 ms 86904 KB Output is correct
76 Correct 536 ms 110972 KB Output is correct
77 Correct 492 ms 110352 KB Output is correct
78 Correct 527 ms 110328 KB Output is correct
79 Correct 320 ms 7928 KB Output is correct
80 Correct 289 ms 7672 KB Output is correct
81 Correct 299 ms 7452 KB Output is correct
82 Correct 548 ms 110968 KB Output is correct
83 Correct 565 ms 108880 KB Output is correct
84 Correct 504 ms 110328 KB Output is correct
85 Correct 504 ms 108408 KB Output is correct
86 Correct 488 ms 110328 KB Output is correct
87 Correct 516 ms 108648 KB Output is correct
88 Correct 331 ms 7928 KB Output is correct
89 Correct 337 ms 7980 KB Output is correct
90 Correct 304 ms 7672 KB Output is correct
91 Correct 308 ms 7544 KB Output is correct
92 Correct 298 ms 7672 KB Output is correct
93 Correct 304 ms 7496 KB Output is correct
94 Correct 484 ms 72824 KB Output is correct
95 Correct 462 ms 65144 KB Output is correct
96 Correct 425 ms 72056 KB Output is correct
97 Correct 435 ms 65924 KB Output is correct
98 Correct 434 ms 72312 KB Output is correct
99 Correct 424 ms 65528 KB Output is correct
100 Correct 323 ms 7928 KB Output is correct
101 Correct 328 ms 7904 KB Output is correct
102 Correct 307 ms 7544 KB Output is correct
103 Correct 297 ms 7556 KB Output is correct
104 Correct 299 ms 7544 KB Output is correct
105 Correct 307 ms 7544 KB Output is correct
106 Correct 555 ms 91388 KB Output is correct
107 Correct 548 ms 86904 KB Output is correct
108 Correct 502 ms 91256 KB Output is correct
109 Correct 500 ms 86396 KB Output is correct
110 Correct 496 ms 91384 KB Output is correct
111 Correct 497 ms 86648 KB Output is correct
112 Correct 338 ms 7928 KB Output is correct
113 Correct 338 ms 7912 KB Output is correct
114 Correct 308 ms 7704 KB Output is correct
115 Correct 309 ms 7544 KB Output is correct
116 Correct 300 ms 7544 KB Output is correct
117 Correct 313 ms 7544 KB Output is correct
118 Correct 509 ms 110712 KB Output is correct
119 Correct 503 ms 91896 KB Output is correct
120 Correct 498 ms 86904 KB Output is correct
121 Correct 503 ms 110520 KB Output is correct
122 Correct 494 ms 91564 KB Output is correct
123 Correct 487 ms 86264 KB Output is correct
124 Correct 510 ms 110840 KB Output is correct
125 Correct 527 ms 91768 KB Output is correct
126 Correct 542 ms 86496 KB Output is correct