oj.uz

Submission #807680

# Submission time Handle Problem Language Result Execution time Memory
807680 2023-08-04T21:26:21 Z dong_liu Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 490 ms 166916 KB 
#include <bits/stdc++.h>
using namespace std;

using LL = long long;
const int N = 100000, B = 200, Q = 100000, INF = 0x3f3f3f3f;

vector<int> gr[N];
pair<int, int> pp[N][B];

void join(pair<int, int> *aa, pair<int, int> *bb, pair<int, int> *cc) {
  static int used[N], _ = 1;

  int i = 0, j = 0;

  for (int k = 0; k < B; k++) {
    while (i < B && aa[i].second != -1 && used[aa[i].second] == _) i++;
    while (j < B && bb[j].second != -1 && used[bb[j].second] == _) j++;
    if (i == B)
      cc[k] = {bb[j].first + 1, bb[j].second}, j++;
    else if (j == B)
      cc[k] = aa[i++];
    else if (aa[i].first > bb[j].first + 1)
      cc[k] = aa[i++];
    else
      cc[k] = {bb[j].first + 1, bb[j].second}, j++;
    if (cc[k].second != -1) used[cc[k].second] = _;
  }
  _++;
}

void run() {
  int n, m, q;

  scanf("%d%d%d", &n, &m, &q);
  while (m--) {
    int i, j;

    scanf("%d%d", &i, &j), i--, j--;
    gr[j].push_back(i);
  }
  for (int i = 0; i < n; i++) {
    static pair<int, int> tmp[B];

    for (int j = 0; j < B; j++) pp[i][j] = {-INF, -1};
    pp[i][0] = {0, i};
    for (int j : gr[i]) {
      join(pp[i], pp[j], tmp);
      for (int k = 0; k < B; k++) pp[i][k] = tmp[k];
    }
  }
  for (int h = 1; h <= q; h++) {
    static int removed[N];
    int i, k, ans = -1;

    scanf("%d%d", &i, &k), i--;
    for (int _ = 0; _ < k; _++) {
      int j;

      scanf("%d", &j), j--;
      removed[j] = h;
    }
    if (k < B) {
      for (int _ = 0; _ < B; _++) {
        auto [d, j] = pp[i][_];

        if (j == -1) break;
        if (removed[j] != h) {
          ans = d;
          break;
        }
      }
    } else {
      static int dd[N];

      memset(dd, -0x3f, n * sizeof *dd);
      dd[i] = 0;
      for (int j = i; j >= 0; j--) {
        int d = dd[j];

        if (d == -INF) continue;
        if (removed[j] != h) ans = max(ans, d);
        for (int k : gr[j]) dd[k] = max(dd[k], d + 1);
      }
    }
    printf("%d\n", ans);
  }
}

int main() {
  run();
  return 0;
}

Compilation message

bitaro.cpp: In function 'void run()':
bitaro.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |   scanf("%d%d%d", &n, &m, &q);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     scanf("%d%d", &i, &j), i--, j--;
      |     ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |     scanf("%d%d", &i, &k), i--;
      |     ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:59:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |       scanf("%d", &j), j--;
      |       ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2668 KB Output is correct
5 Correct 5 ms 4244 KB Output is correct
6 Correct 6 ms 4180 KB Output is correct
7 Correct 4 ms 4180 KB Output is correct
8 Correct 4 ms 4204 KB Output is correct
9 Correct 4 ms 4180 KB Output is correct
10 Correct 5 ms 4180 KB Output is correct
11 Correct 4 ms 4188 KB Output is correct
12 Correct 4 ms 4180 KB Output is correct
13 Correct 6 ms 4204 KB Output is correct
14 Correct 4 ms 4180 KB Output is correct
15 Correct 4 ms 4180 KB Output is correct
16 Correct 7 ms 4180 KB Output is correct
17 Correct 4 ms 4180 KB Output is correct
18 Correct 4 ms 4208 KB Output is correct
19 Correct 4 ms 4180 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2668 KB Output is correct
5 Correct 5 ms 4244 KB Output is correct
6 Correct 6 ms 4180 KB Output is correct
7 Correct 4 ms 4180 KB Output is correct
8 Correct 4 ms 4204 KB Output is correct
9 Correct 4 ms 4180 KB Output is correct
10 Correct 5 ms 4180 KB Output is correct
11 Correct 4 ms 4188 KB Output is correct
12 Correct 4 ms 4180 KB Output is correct
13 Correct 6 ms 4204 KB Output is correct
14 Correct 4 ms 4180 KB Output is correct
15 Correct 4 ms 4180 KB Output is correct
16 Correct 7 ms 4180 KB Output is correct
17 Correct 4 ms 4180 KB Output is correct
18 Correct 4 ms 4208 KB Output is correct
19 Correct 4 ms 4180 KB Output is correct
20 Correct 231 ms 6960 KB Output is correct
21 Correct 229 ms 6908 KB Output is correct
22 Correct 248 ms 6964 KB Output is correct
23 Correct 254 ms 7024 KB Output is correct
24 Correct 374 ms 165580 KB Output is correct
25 Correct 372 ms 165624 KB Output is correct
26 Correct 366 ms 165472 KB Output is correct
27 Correct 383 ms 165704 KB Output is correct
28 Correct 320 ms 165716 KB Output is correct
29 Correct 350 ms 165504 KB Output is correct
30 Correct 328 ms 165708 KB Output is correct
31 Correct 361 ms 165776 KB Output is correct
32 Correct 313 ms 165456 KB Output is correct
33 Correct 318 ms 165616 KB Output is correct
34 Correct 312 ms 165656 KB Output is correct
35 Correct 321 ms 165452 KB Output is correct
36 Correct 319 ms 165672 KB Output is correct
37 Correct 345 ms 165640 KB Output is correct
38 Correct 319 ms 165728 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 1 ms 2668 KB Output is correct
5 Correct 5 ms 4244 KB Output is correct
6 Correct 6 ms 4180 KB Output is correct
7 Correct 4 ms 4180 KB Output is correct
8 Correct 4 ms 4204 KB Output is correct
9 Correct 4 ms 4180 KB Output is correct
10 Correct 5 ms 4180 KB Output is correct
11 Correct 4 ms 4188 KB Output is correct
12 Correct 4 ms 4180 KB Output is correct
13 Correct 6 ms 4204 KB Output is correct
14 Correct 4 ms 4180 KB Output is correct
15 Correct 4 ms 4180 KB Output is correct
16 Correct 7 ms 4180 KB Output is correct
17 Correct 4 ms 4180 KB Output is correct
18 Correct 4 ms 4208 KB Output is correct
19 Correct 4 ms 4180 KB Output is correct
20 Correct 231 ms 6960 KB Output is correct
21 Correct 229 ms 6908 KB Output is correct
22 Correct 248 ms 6964 KB Output is correct
23 Correct 254 ms 7024 KB Output is correct
24 Correct 374 ms 165580 KB Output is correct
25 Correct 372 ms 165624 KB Output is correct
26 Correct 366 ms 165472 KB Output is correct
27 Correct 383 ms 165704 KB Output is correct
28 Correct 320 ms 165716 KB Output is correct
29 Correct 350 ms 165504 KB Output is correct
30 Correct 328 ms 165708 KB Output is correct
31 Correct 361 ms 165776 KB Output is correct
32 Correct 313 ms 165456 KB Output is correct
33 Correct 318 ms 165616 KB Output is correct
34 Correct 312 ms 165656 KB Output is correct
35 Correct 321 ms 165452 KB Output is correct
36 Correct 319 ms 165672 KB Output is correct
37 Correct 345 ms 165640 KB Output is correct
38 Correct 319 ms 165728 KB Output is correct
39 Correct 403 ms 166536 KB Output is correct
40 Correct 384 ms 165652 KB Output is correct
41 Correct 372 ms 165560 KB Output is correct
42 Correct 427 ms 165920 KB Output is correct
43 Correct 373 ms 165964 KB Output is correct
44 Correct 245 ms 8324 KB Output is correct
45 Correct 221 ms 7464 KB Output is correct
46 Correct 218 ms 7404 KB Output is correct
47 Correct 241 ms 7176 KB Output is correct
48 Correct 213 ms 7004 KB Output is correct
49 Correct 347 ms 166168 KB Output is correct
50 Correct 359 ms 164892 KB Output is correct
51 Correct 237 ms 8048 KB Output is correct
52 Correct 219 ms 7284 KB Output is correct
53 Correct 346 ms 166004 KB Output is correct
54 Correct 382 ms 165864 KB Output is correct
55 Correct 319 ms 164928 KB Output is correct
56 Correct 335 ms 164872 KB Output is correct
57 Correct 233 ms 8164 KB Output is correct
58 Correct 243 ms 8124 KB Output is correct
59 Correct 220 ms 7200 KB Output is correct
60 Correct 219 ms 7220 KB Output is correct
61 Correct 348 ms 165436 KB Output is correct
62 Correct 372 ms 165332 KB Output is correct
63 Correct 381 ms 165440 KB Output is correct
64 Correct 457 ms 165436 KB Output is correct
65 Correct 460 ms 165380 KB Output is correct
66 Correct 490 ms 165324 KB Output is correct
67 Correct 460 ms 165324 KB Output is correct
68 Correct 445 ms 165352 KB Output is correct
69 Correct 456 ms 165384 KB Output is correct
70 Correct 321 ms 165528 KB Output is correct
71 Correct 340 ms 165644 KB Output is correct
72 Correct 365 ms 165500 KB Output is correct
73 Correct 330 ms 165460 KB Output is correct
74 Correct 338 ms 165492 KB Output is correct
75 Correct 357 ms 165528 KB Output is correct
76 Correct 347 ms 166916 KB Output is correct
77 Correct 323 ms 166028 KB Output is correct
78 Correct 313 ms 165964 KB Output is correct
79 Correct 242 ms 8284 KB Output is correct
80 Correct 232 ms 7312 KB Output is correct
81 Correct 213 ms 7004 KB Output is correct
82 Correct 356 ms 166908 KB Output is correct
83 Correct 428 ms 166808 KB Output is correct
84 Correct 337 ms 165984 KB Output is correct
85 Correct 372 ms 165988 KB Output is correct
86 Correct 343 ms 166020 KB Output is correct
87 Correct 374 ms 166060 KB Output is correct
88 Correct 239 ms 8268 KB Output is correct
89 Correct 271 ms 8296 KB Output is correct
90 Correct 219 ms 7384 KB Output is correct
91 Correct 218 ms 7296 KB Output is correct
92 Correct 211 ms 7128 KB Output is correct
93 Correct 213 ms 7000 KB Output is correct
94 Correct 350 ms 166780 KB Output is correct
95 Correct 342 ms 166628 KB Output is correct
96 Correct 331 ms 166012 KB Output is correct
97 Correct 366 ms 165920 KB Output is correct
98 Correct 318 ms 165908 KB Output is correct
99 Correct 310 ms 165956 KB Output is correct
100 Correct 257 ms 8356 KB Output is correct
101 Correct 239 ms 8252 KB Output is correct
102 Correct 235 ms 7388 KB Output is correct
103 Correct 223 ms 7388 KB Output is correct
104 Correct 216 ms 6960 KB Output is correct
105 Correct 216 ms 6984 KB Output is correct
106 Correct 370 ms 166748 KB Output is correct
107 Correct 374 ms 166656 KB Output is correct
108 Correct 351 ms 166012 KB Output is correct
109 Correct 392 ms 165952 KB Output is correct
110 Correct 321 ms 165980 KB Output is correct
111 Correct 368 ms 165884 KB Output is correct
112 Correct 243 ms 8276 KB Output is correct
113 Correct 242 ms 8324 KB Output is correct
114 Correct 241 ms 7452 KB Output is correct
115 Correct 243 ms 7372 KB Output is correct
116 Correct 232 ms 7080 KB Output is correct
117 Correct 242 ms 7000 KB Output is correct
118 Correct 333 ms 164976 KB Output is correct
119 Correct 458 ms 164880 KB Output is correct
120 Correct 367 ms 164840 KB Output is correct
121 Correct 322 ms 164940 KB Output is correct
122 Correct 380 ms 164968 KB Output is correct
123 Correct 375 ms 164912 KB Output is correct
124 Correct 374 ms 164908 KB Output is correct
125 Correct 351 ms 164900 KB Output is correct
126 Correct 382 ms 164892 KB Output is correct