oj.uz

Submission #916720

# Submission time Handle Problem Language Result Execution time Memory
916720 2024-01-26T11:05:19 Z ParsaGolestani Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 751 ms 272468 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 100'000;
const int SQ = 316;
const int INF = 1'000'000'000;

int n, m, q, mark[N + 10], dis[N + 10];
pair<int, int> far[N + 10][SQ + 10];
vector<pair<int, int>> in[N + 10];
vector<int> out[N + 10];

void readInput() {
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        out[u].push_back(v);
        in[v].push_back({u, 0});
    }
}

void calcFar(int u) {
    for (int j = 1; j <= SQ; j++) {
        far[u][j] = {-INF, 0};
        for (int k = 0; k < in[u].size(); k++) {
            int v = in[u][k].first;
            while (in[u][k].second < SQ && mark[far[v][in[u][k].second + 1].second])
                in[u][k].second++;
            if (in[u][k].second < SQ)
                far[u][j] = max(far[u][j], far[v][in[u][k].second + 1]);
        }
        far[u][j].first += (far[u][j].first == -INF? 0: 1);
        if (far[u][j].second)
            mark[far[u][j].second] = true;
    }
    for (int j = 1; j <= SQ; j++)
        if (far[u][j].first < 0) {
            far[u][j] = {0, u};
            break;
        }
    for (int j = 1; j <= SQ; j++)
        mark[far[u][j].second] = false;
}

void calcFar() {
    for (int i = 1; i <= n; i++)
        calcFar(i);
}

void query() {
    int u, cnt;
    cin >> u >> cnt;
    vector<int> vec;
    for (int i = 1; i <= cnt; i++) {
        int v;
        cin >> v;
        vec.push_back(v);
        mark[v] = true;
    }
    if (cnt < SQ) {
        for (int i = 1; i <= SQ; i++)
            if (!mark[far[u][i].second]) {
                cout << (far[u][i].first < 0? -1: far[u][i].first) << '\n';
                break;
            }
    }
    else {
        fill(dis + 1, dis + u + 1, -INF);
        dis[u] = 0;
        int ans = (mark[u]? -1: 0);
        for (int i = u - 1; i >= 1; i--) {
            for (auto v: out[i])
                if (v <= u)
                    dis[i] = max(dis[i], dis[v] + 1);
            if (!mark[i])
                ans = max(ans, dis[i]);
        }
        cout << ans << '\n';
    }
    for (auto x: vec)
        mark[x] = false;
}

void solve() {
    while (q--)
        query();
    cout.flush();
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    readInput();
    calcFar();
    solve();
    return 0;
}

Compilation message

bitaro.cpp: In function 'void calcFar(int)':
bitaro.cpp:26:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int k = 0; k < in[u].size(); k++) {
      |                         ~~^~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6744 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6744 KB Output is correct
5 Correct 7 ms 8796 KB Output is correct
6 Correct 6 ms 8796 KB Output is correct
7 Correct 8 ms 8792 KB Output is correct
8 Correct 6 ms 8792 KB Output is correct
9 Correct 5 ms 8796 KB Output is correct
10 Correct 6 ms 8796 KB Output is correct
11 Correct 8 ms 8796 KB Output is correct
12 Correct 8 ms 8796 KB Output is correct
13 Correct 8 ms 8788 KB Output is correct
14 Correct 6 ms 8860 KB Output is correct
15 Correct 6 ms 8864 KB Output is correct
16 Correct 5 ms 8796 KB Output is correct
17 Correct 6 ms 8796 KB Output is correct
18 Correct 6 ms 8796 KB Output is correct
19 Correct 8 ms 8796 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6744 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6744 KB Output is correct
5 Correct 7 ms 8796 KB Output is correct
6 Correct 6 ms 8796 KB Output is correct
7 Correct 8 ms 8792 KB Output is correct
8 Correct 6 ms 8792 KB Output is correct
9 Correct 5 ms 8796 KB Output is correct
10 Correct 6 ms 8796 KB Output is correct
11 Correct 8 ms 8796 KB Output is correct
12 Correct 8 ms 8796 KB Output is correct
13 Correct 8 ms 8788 KB Output is correct
14 Correct 6 ms 8860 KB Output is correct
15 Correct 6 ms 8864 KB Output is correct
16 Correct 5 ms 8796 KB Output is correct
17 Correct 6 ms 8796 KB Output is correct
18 Correct 6 ms 8796 KB Output is correct
19 Correct 8 ms 8796 KB Output is correct
20 Correct 254 ms 14164 KB Output is correct
21 Correct 312 ms 14216 KB Output is correct
22 Correct 271 ms 14184 KB Output is correct
23 Correct 279 ms 14076 KB Output is correct
24 Correct 517 ms 269680 KB Output is correct
25 Correct 530 ms 269456 KB Output is correct
26 Correct 545 ms 269432 KB Output is correct
27 Correct 435 ms 271376 KB Output is correct
28 Correct 425 ms 271364 KB Output is correct
29 Correct 409 ms 271420 KB Output is correct
30 Correct 428 ms 270416 KB Output is correct
31 Correct 464 ms 270520 KB Output is correct
32 Correct 432 ms 270328 KB Output is correct
33 Correct 441 ms 270444 KB Output is correct
34 Correct 464 ms 270612 KB Output is correct
35 Correct 440 ms 270460 KB Output is correct
36 Correct 480 ms 270716 KB Output is correct
37 Correct 503 ms 270600 KB Output is correct
38 Correct 453 ms 270616 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6744 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6744 KB Output is correct
5 Correct 7 ms 8796 KB Output is correct
6 Correct 6 ms 8796 KB Output is correct
7 Correct 8 ms 8792 KB Output is correct
8 Correct 6 ms 8792 KB Output is correct
9 Correct 5 ms 8796 KB Output is correct
10 Correct 6 ms 8796 KB Output is correct
11 Correct 8 ms 8796 KB Output is correct
12 Correct 8 ms 8796 KB Output is correct
13 Correct 8 ms 8788 KB Output is correct
14 Correct 6 ms 8860 KB Output is correct
15 Correct 6 ms 8864 KB Output is correct
16 Correct 5 ms 8796 KB Output is correct
17 Correct 6 ms 8796 KB Output is correct
18 Correct 6 ms 8796 KB Output is correct
19 Correct 8 ms 8796 KB Output is correct
20 Correct 254 ms 14164 KB Output is correct
21 Correct 312 ms 14216 KB Output is correct
22 Correct 271 ms 14184 KB Output is correct
23 Correct 279 ms 14076 KB Output is correct
24 Correct 517 ms 269680 KB Output is correct
25 Correct 530 ms 269456 KB Output is correct
26 Correct 545 ms 269432 KB Output is correct
27 Correct 435 ms 271376 KB Output is correct
28 Correct 425 ms 271364 KB Output is correct
29 Correct 409 ms 271420 KB Output is correct
30 Correct 428 ms 270416 KB Output is correct
31 Correct 464 ms 270520 KB Output is correct
32 Correct 432 ms 270328 KB Output is correct
33 Correct 441 ms 270444 KB Output is correct
34 Correct 464 ms 270612 KB Output is correct
35 Correct 440 ms 270460 KB Output is correct
36 Correct 480 ms 270716 KB Output is correct
37 Correct 503 ms 270600 KB Output is correct
38 Correct 453 ms 270616 KB Output is correct
39 Correct 577 ms 270284 KB Output is correct
40 Correct 546 ms 269408 KB Output is correct
41 Correct 539 ms 269380 KB Output is correct
42 Correct 637 ms 269652 KB Output is correct
43 Correct 574 ms 269812 KB Output is correct
44 Correct 404 ms 15376 KB Output is correct
45 Correct 272 ms 14624 KB Output is correct
46 Correct 278 ms 14420 KB Output is correct
47 Correct 334 ms 14280 KB Output is correct
48 Correct 255 ms 14160 KB Output is correct
49 Correct 512 ms 271804 KB Output is correct
50 Correct 433 ms 270412 KB Output is correct
51 Correct 306 ms 15352 KB Output is correct
52 Correct 346 ms 14332 KB Output is correct
53 Correct 446 ms 271436 KB Output is correct
54 Correct 542 ms 271036 KB Output is correct
55 Correct 457 ms 270116 KB Output is correct
56 Correct 523 ms 270440 KB Output is correct
57 Correct 311 ms 15352 KB Output is correct
58 Correct 291 ms 15344 KB Output is correct
59 Correct 310 ms 14332 KB Output is correct
60 Correct 258 ms 14300 KB Output is correct
61 Correct 455 ms 270844 KB Output is correct
62 Correct 493 ms 270620 KB Output is correct
63 Correct 670 ms 270648 KB Output is correct
64 Correct 583 ms 270980 KB Output is correct
65 Correct 589 ms 270748 KB Output is correct
66 Correct 751 ms 270644 KB Output is correct
67 Correct 471 ms 270440 KB Output is correct
68 Correct 471 ms 270112 KB Output is correct
69 Correct 517 ms 270208 KB Output is correct
70 Correct 491 ms 271248 KB Output is correct
71 Correct 410 ms 270624 KB Output is correct
72 Correct 516 ms 270768 KB Output is correct
73 Correct 448 ms 271152 KB Output is correct
74 Correct 464 ms 270676 KB Output is correct
75 Correct 548 ms 270764 KB Output is correct
76 Correct 467 ms 272468 KB Output is correct
77 Correct 505 ms 271080 KB Output is correct
78 Correct 401 ms 271624 KB Output is correct
79 Correct 321 ms 15392 KB Output is correct
80 Correct 290 ms 14424 KB Output is correct
81 Correct 256 ms 13960 KB Output is correct
82 Correct 477 ms 271616 KB Output is correct
83 Correct 547 ms 271380 KB Output is correct
84 Correct 496 ms 270376 KB Output is correct
85 Correct 465 ms 270372 KB Output is correct
86 Correct 473 ms 270852 KB Output is correct
87 Correct 526 ms 270696 KB Output is correct
88 Correct 282 ms 15308 KB Output is correct
89 Correct 281 ms 15444 KB Output is correct
90 Correct 275 ms 14680 KB Output is correct
91 Correct 274 ms 14544 KB Output is correct
92 Correct 314 ms 14184 KB Output is correct
93 Correct 284 ms 14244 KB Output is correct
94 Correct 517 ms 271468 KB Output is correct
95 Correct 486 ms 271184 KB Output is correct
96 Correct 455 ms 270404 KB Output is correct
97 Correct 465 ms 270396 KB Output is correct
98 Correct 481 ms 270956 KB Output is correct
99 Correct 416 ms 270676 KB Output is correct
100 Correct 314 ms 15312 KB Output is correct
101 Correct 309 ms 15344 KB Output is correct
102 Correct 269 ms 14444 KB Output is correct
103 Correct 272 ms 14456 KB Output is correct
104 Correct 313 ms 13908 KB Output is correct
105 Correct 267 ms 14120 KB Output is correct
106 Correct 475 ms 271788 KB Output is correct
107 Correct 605 ms 271320 KB Output is correct
108 Correct 533 ms 270528 KB Output is correct
109 Correct 489 ms 270456 KB Output is correct
110 Correct 425 ms 271052 KB Output is correct
111 Correct 518 ms 270908 KB Output is correct
112 Correct 304 ms 15400 KB Output is correct
113 Correct 284 ms 15376 KB Output is correct
114 Correct 263 ms 14576 KB Output is correct
115 Correct 291 ms 14580 KB Output is correct
116 Correct 257 ms 14160 KB Output is correct
117 Correct 272 ms 14192 KB Output is correct
118 Correct 419 ms 270372 KB Output is correct
119 Correct 481 ms 270068 KB Output is correct
120 Correct 507 ms 270568 KB Output is correct
121 Correct 404 ms 270392 KB Output is correct
122 Correct 416 ms 270216 KB Output is correct
123 Correct 485 ms 270172 KB Output is correct
124 Correct 424 ms 270512 KB Output is correct
125 Correct 459 ms 270228 KB Output is correct
126 Correct 526 ms 270164 KB Output is correct