oj.uz

Submission #436457

# Submission time Handle Problem Language Result Execution time Memory
436457 2021-06-24T13:59:23 Z peijar Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1782 ms 176268 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5;
const int TRESH = 200;

vector<int> adj[MAXN];
bitset<MAXN> seen;
vector<int> revAdj[MAXN];
vector<pair<int, int>> furthest[MAXN];
int buffer[MAXN];
int nbSommets, nbAretes;

int dp[MAXN];

void naiveDp(int source) {
  for (int i = 0; i < nbSommets; ++i)
    dp[i] = -1;
  dp[source] = 0;
  for (int iSommet = source - 1; iSommet >= 0; --iSommet)
    for (auto iFils : adj[iSommet])
      if (dp[iFils] >= 0)
        dp[iSommet] = max(dp[iSommet], dp[iFils] + 1);
}

void init() {

  auto combine = [&](const vector<pair<int, int>> &lft,
                     const vector<pair<int, int>> &rgt) {
    vector<pair<int, int>> ret;
    int lftSize = lft.size(), rgtSize = rgt.size();
    ret.reserve(min(lftSize + rgtSize, TRESH));
    int posDel = 0;
    int posLft = 0, posRgt = 0;
    for (int i = 0;
         (posLft < lftSize or posRgt < rgtSize) and (int) ret.size() < TRESH;
         ++i) {
      if (posLft < lftSize and seen[lft[posLft].first]) {
        ++posLft;
        continue;
      }
      if (posRgt < rgtSize and seen[rgt[posRgt].first]) {
        ++posRgt;
        continue;
      }
      if (posRgt == rgtSize or
          (posLft < lftSize and lft[posLft].second > rgt[posRgt].second)) {
        buffer[posDel++] = lft[posLft].first;
        seen[lft[posLft].first] = true;
        ret.push_back(lft[posLft++]);
      } else {
        buffer[posDel++] = rgt[posRgt].first;
        seen[rgt[posRgt].first] = true;
        ret.push_back(rgt[posRgt++]);
      }
    }
    while (posDel > 0)
      seen[buffer[--posDel]] = false;
    return ret;
  };

  for (int iSommet = 0; iSommet < nbSommets; ++iSommet) {
    vector<pair<int, int>> cur;
    for (int iPere : revAdj[iSommet])
      cur = combine(cur, furthest[iPere]);
    for (auto &[u, d] : cur)
      d++;
    if ((int)cur.size() < TRESH)
      cur.emplace_back(iSommet, 0);
    furthest[iSommet] = move(cur);
  }
}

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int nbRequetes;
  cin >> nbSommets >> nbAretes >> nbRequetes;
  for (int i = 0; i < nbAretes; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    adj[u].push_back(v);
    revAdj[v].push_back(u);
  }

  init();

  for (int iRequete = 0; iRequete < nbRequetes; ++iRequete) {
    int source, nbInterdits;
    cin >> source >> nbInterdits;
    --source;
    set<int> interdits;
    for (int i = 0; i < nbInterdits; ++i) {
      int u;
      cin >> u;
      interdits.insert(u - 1);
    }
    assert((int)interdits.size() == nbInterdits);
    if (nbInterdits >= TRESH) {
      naiveDp(source);
      int sol = -1;
      for (int i = 0; i < nbSommets; ++i)
        if (dp[i] > sol and !interdits.count(i))
          sol = dp[i];
      cout << sol << '\n';
    } else {
      int ret = -1;
      assert(interdits.size() < TRESH);
      for (int i = 0; i < (int)furthest[source].size(); ++i)
        if (!interdits.count(furthest[source][i].first)) {
          ret = furthest[source][i].second;
          break;
        }
      cout << ret << '\n';
    }
  }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 6 ms 7312 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 8 ms 7884 KB Output is correct
6 Correct 8 ms 7884 KB Output is correct
7 Correct 7 ms 7884 KB Output is correct
8 Correct 11 ms 9036 KB Output is correct
9 Correct 12 ms 9036 KB Output is correct
10 Correct 13 ms 9028 KB Output is correct
11 Correct 11 ms 8936 KB Output is correct
12 Correct 11 ms 8424 KB Output is correct
13 Correct 12 ms 8908 KB Output is correct
14 Correct 11 ms 8268 KB Output is correct
15 Correct 9 ms 8020 KB Output is correct
16 Correct 11 ms 8288 KB Output is correct
17 Correct 11 ms 8524 KB Output is correct
18 Correct 9 ms 8268 KB Output is correct
19 Correct 11 ms 8652 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 6 ms 7312 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 8 ms 7884 KB Output is correct
6 Correct 8 ms 7884 KB Output is correct
7 Correct 7 ms 7884 KB Output is correct
8 Correct 11 ms 9036 KB Output is correct
9 Correct 12 ms 9036 KB Output is correct
10 Correct 13 ms 9028 KB Output is correct
11 Correct 11 ms 8936 KB Output is correct
12 Correct 11 ms 8424 KB Output is correct
13 Correct 12 ms 8908 KB Output is correct
14 Correct 11 ms 8268 KB Output is correct
15 Correct 9 ms 8020 KB Output is correct
16 Correct 11 ms 8288 KB Output is correct
17 Correct 11 ms 8524 KB Output is correct
18 Correct 9 ms 8268 KB Output is correct
19 Correct 11 ms 8652 KB Output is correct
20 Correct 607 ms 11628 KB Output is correct
21 Correct 596 ms 11676 KB Output is correct
22 Correct 624 ms 11544 KB Output is correct
23 Correct 611 ms 11588 KB Output is correct
24 Correct 714 ms 137924 KB Output is correct
25 Correct 791 ms 141268 KB Output is correct
26 Correct 718 ms 141648 KB Output is correct
27 Correct 819 ms 175556 KB Output is correct
28 Correct 816 ms 175624 KB Output is correct
29 Correct 841 ms 175676 KB Output is correct
30 Correct 838 ms 174936 KB Output is correct
31 Correct 800 ms 171200 KB Output is correct
32 Correct 776 ms 174860 KB Output is correct
33 Correct 628 ms 115528 KB Output is correct
34 Correct 559 ms 105100 KB Output is correct
35 Correct 625 ms 114776 KB Output is correct
36 Correct 752 ms 145596 KB Output is correct
37 Correct 701 ms 138252 KB Output is correct
38 Correct 761 ms 145940 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 6 ms 7312 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 8 ms 7884 KB Output is correct
6 Correct 8 ms 7884 KB Output is correct
7 Correct 7 ms 7884 KB Output is correct
8 Correct 11 ms 9036 KB Output is correct
9 Correct 12 ms 9036 KB Output is correct
10 Correct 13 ms 9028 KB Output is correct
11 Correct 11 ms 8936 KB Output is correct
12 Correct 11 ms 8424 KB Output is correct
13 Correct 12 ms 8908 KB Output is correct
14 Correct 11 ms 8268 KB Output is correct
15 Correct 9 ms 8020 KB Output is correct
16 Correct 11 ms 8288 KB Output is correct
17 Correct 11 ms 8524 KB Output is correct
18 Correct 9 ms 8268 KB Output is correct
19 Correct 11 ms 8652 KB Output is correct
20 Correct 607 ms 11628 KB Output is correct
21 Correct 596 ms 11676 KB Output is correct
22 Correct 624 ms 11544 KB Output is correct
23 Correct 611 ms 11588 KB Output is correct
24 Correct 714 ms 137924 KB Output is correct
25 Correct 791 ms 141268 KB Output is correct
26 Correct 718 ms 141648 KB Output is correct
27 Correct 819 ms 175556 KB Output is correct
28 Correct 816 ms 175624 KB Output is correct
29 Correct 841 ms 175676 KB Output is correct
30 Correct 838 ms 174936 KB Output is correct
31 Correct 800 ms 171200 KB Output is correct
32 Correct 776 ms 174860 KB Output is correct
33 Correct 628 ms 115528 KB Output is correct
34 Correct 559 ms 105100 KB Output is correct
35 Correct 625 ms 114776 KB Output is correct
36 Correct 752 ms 145596 KB Output is correct
37 Correct 701 ms 138252 KB Output is correct
38 Correct 761 ms 145940 KB Output is correct
39 Correct 840 ms 136620 KB Output is correct
40 Correct 792 ms 137904 KB Output is correct
41 Correct 753 ms 137768 KB Output is correct
42 Correct 1124 ms 138260 KB Output is correct
43 Correct 814 ms 137396 KB Output is correct
44 Correct 628 ms 12460 KB Output is correct
45 Correct 624 ms 13240 KB Output is correct
46 Correct 640 ms 13096 KB Output is correct
47 Correct 734 ms 12936 KB Output is correct
48 Correct 588 ms 12912 KB Output is correct
49 Correct 915 ms 175988 KB Output is correct
50 Correct 861 ms 174704 KB Output is correct
51 Correct 639 ms 13880 KB Output is correct
52 Correct 605 ms 12944 KB Output is correct
53 Correct 785 ms 145168 KB Output is correct
54 Correct 829 ms 138148 KB Output is correct
55 Correct 732 ms 144216 KB Output is correct
56 Correct 730 ms 137848 KB Output is correct
57 Correct 607 ms 13916 KB Output is correct
58 Correct 611 ms 13872 KB Output is correct
59 Correct 585 ms 12968 KB Output is correct
60 Correct 664 ms 13052 KB Output is correct
61 Correct 1020 ms 175160 KB Output is correct
62 Correct 941 ms 145464 KB Output is correct
63 Correct 939 ms 137076 KB Output is correct
64 Correct 1782 ms 175144 KB Output is correct
65 Correct 1399 ms 144712 KB Output is correct
66 Correct 1340 ms 138152 KB Output is correct
67 Correct 1453 ms 175136 KB Output is correct
68 Correct 1319 ms 145252 KB Output is correct
69 Correct 1206 ms 136432 KB Output is correct
70 Correct 873 ms 175668 KB Output is correct
71 Correct 830 ms 145584 KB Output is correct
72 Correct 841 ms 138084 KB Output is correct
73 Correct 873 ms 175308 KB Output is correct
74 Correct 807 ms 145224 KB Output is correct
75 Correct 827 ms 137580 KB Output is correct
76 Correct 958 ms 176268 KB Output is correct
77 Correct 963 ms 175260 KB Output is correct
78 Correct 930 ms 176144 KB Output is correct
79 Correct 636 ms 14044 KB Output is correct
80 Correct 620 ms 13124 KB Output is correct
81 Correct 599 ms 12708 KB Output is correct
82 Correct 966 ms 175440 KB Output is correct
83 Correct 903 ms 171668 KB Output is correct
84 Correct 925 ms 174532 KB Output is correct
85 Correct 953 ms 170756 KB Output is correct
86 Correct 867 ms 175408 KB Output is correct
87 Correct 931 ms 172000 KB Output is correct
88 Correct 666 ms 14072 KB Output is correct
89 Correct 641 ms 14088 KB Output is correct
90 Correct 639 ms 13156 KB Output is correct
91 Correct 687 ms 13192 KB Output is correct
92 Correct 642 ms 12700 KB Output is correct
93 Correct 612 ms 12812 KB Output is correct
94 Correct 851 ms 116000 KB Output is correct
95 Correct 714 ms 105016 KB Output is correct
96 Correct 710 ms 114804 KB Output is correct
97 Correct 651 ms 106052 KB Output is correct
98 Correct 758 ms 115868 KB Output is correct
99 Correct 637 ms 106324 KB Output is correct
100 Correct 669 ms 14072 KB Output is correct
101 Correct 693 ms 14100 KB Output is correct
102 Correct 634 ms 13184 KB Output is correct
103 Correct 720 ms 13184 KB Output is correct
104 Correct 662 ms 12772 KB Output is correct
105 Correct 650 ms 12760 KB Output is correct
106 Correct 802 ms 145608 KB Output is correct
107 Correct 753 ms 138692 KB Output is correct
108 Correct 818 ms 145592 KB Output is correct
109 Correct 760 ms 137520 KB Output is correct
110 Correct 750 ms 146688 KB Output is correct
111 Correct 795 ms 139104 KB Output is correct
112 Correct 638 ms 14140 KB Output is correct
113 Correct 687 ms 14040 KB Output is correct
114 Correct 608 ms 13184 KB Output is correct
115 Correct 602 ms 13164 KB Output is correct
116 Correct 596 ms 12956 KB Output is correct
117 Correct 609 ms 12780 KB Output is correct
118 Correct 847 ms 174660 KB Output is correct
119 Correct 701 ms 144752 KB Output is correct
120 Correct 695 ms 137020 KB Output is correct
121 Correct 829 ms 174640 KB Output is correct
122 Correct 739 ms 144492 KB Output is correct
123 Correct 715 ms 136576 KB Output is correct
124 Correct 849 ms 174752 KB Output is correct
125 Correct 766 ms 145168 KB Output is correct
126 Correct 764 ms 136704 KB Output is correct