oj.uz

Submission #897505

# Submission time Handle Problem Language Result Execution time Memory
897505 2024-01-03T10:00:34 Z Amirreza_Fakhri Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 648 ms 404332 KB 
// In the name of the God 
#include <bits/stdc++.h>
#define ll long long
// #define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;
 
const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 1e5+5, sq = 500;
 
int n, m, q, dist[maxn];
bool mark[maxn];
pii dp[maxn][sq];
vector <int> adj[maxn], p[maxn];
 
int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m >> q;
    for (int i = 0; i < m; i++) {
        int v, u; cin >> v >> u;
        adj[--u].pb(--v);
        p[u].pb(0);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < sq; j++) dp[i][j] = mp(-1, -1);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < sq; j++) {
            int mx = -1, v = -1, googo = -1;
            for (int k = 0; k < adj[i].size(); k++) {
                if (p[i][k] < sq) {
                    if (dp[adj[i][k]][p[i][k]].F+1 > mx and dp[adj[i][k]][p[i][k]].S != -1) {
                        if (!mark[dp[adj[i][k]][p[i][k]].S]) {
                            mx = dp[adj[i][k]][p[i][k]].F+1, v = dp[adj[i][k]][p[i][k]].S;
                            googo = k;
                        }
                        else {
                            p[i][k]++;
                            k--;
                        }
                    }
                }
            }
            dp[i][j] = mp(mx, v);
            if (v != -1) mark[v] = 1;
            if (googo != -1) p[i][googo]++;
        }
        for (int j = 0; j < sq; j++) {
            if (dp[i][j].F == -1) {
                dp[i][j].F = 0, dp[i][j].S = i;
                break;
            }
            mark[dp[i][j].S] = 0;
        }
    }
    memset(mark, 0, sizeof mark);
    vector <int> ans; ans.clear();
    while (q--) {
        vector <int> vec; vec.clear();
        int v, c; cin >> v >> c; v--;
        for (int i = 0; i < c; i++) {
            int u; cin >> u; vec.pb(--u); mark[u] = 1;
        }
        if (c <= sq-5) {
            int anss = -1;
            for (int i = 0; i < sq; i++) {
                if (dp[v][i].F == -1) break;
                if (!mark[dp[v][i].S]) {
                    anss = dp[v][i].F; break;
                }
            }
            ans.pb(anss);
        }
        else {
            memset(dist, 0, sizeof dist);
            for (int i = 0; i < n; i++) {
                if (mark[i]) dist[i] = -inf;
                for (int u : adj[i]) smax(dist[i], dist[u]+1);
            }
            if (dist[v] >= 0) ans.pb(dist[v]);
            else ans.pb(-1);
        }
        for (int u : vec) mark[u] = 0;
    }
    for (int x : ans) cout << x << '\n';
    // for (int j = 0; j < 6; j++) {
    //     for (int i = 0; i < 7; i++) {
    //         cout << dp[j][i].F << ' ' << dp[j][i].S << '\n';
    //     }
    //     cout << "_______________)()(__________________\n";
    // }
    return 0;
}

/*
12 17 1
1 2
2 3
3 4
1 5
2 6
3 7
4 8
5 6
6 7
7 8
5 9
6 10
7 11
8 12
9 10
10 11
11 12
8 4 1 2 3 4
*/

Compilation message

bitaro.cpp: In function 'int32_t main()':
bitaro.cpp:38:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |             for (int k = 0; k < adj[i].size(); k++) {
      |                             ~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 6900 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 6 ms 11220 KB Output is correct
6 Correct 8 ms 11356 KB Output is correct
7 Correct 5 ms 11356 KB Output is correct
8 Correct 6 ms 11228 KB Output is correct
9 Correct 6 ms 11356 KB Output is correct
10 Correct 6 ms 11356 KB Output is correct
11 Correct 7 ms 11224 KB Output is correct
12 Correct 6 ms 11356 KB Output is correct
13 Correct 7 ms 11356 KB Output is correct
14 Correct 6 ms 11356 KB Output is correct
15 Correct 5 ms 11356 KB Output is correct
16 Correct 6 ms 11356 KB Output is correct
17 Correct 6 ms 11356 KB Output is correct
18 Correct 5 ms 11356 KB Output is correct
19 Correct 6 ms 11356 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 6900 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 6 ms 11220 KB Output is correct
6 Correct 8 ms 11356 KB Output is correct
7 Correct 5 ms 11356 KB Output is correct
8 Correct 6 ms 11228 KB Output is correct
9 Correct 6 ms 11356 KB Output is correct
10 Correct 6 ms 11356 KB Output is correct
11 Correct 7 ms 11224 KB Output is correct
12 Correct 6 ms 11356 KB Output is correct
13 Correct 7 ms 11356 KB Output is correct
14 Correct 6 ms 11356 KB Output is correct
15 Correct 5 ms 11356 KB Output is correct
16 Correct 6 ms 11356 KB Output is correct
17 Correct 6 ms 11356 KB Output is correct
18 Correct 5 ms 11356 KB Output is correct
19 Correct 6 ms 11356 KB Output is correct
20 Correct 395 ms 13708 KB Output is correct
21 Correct 294 ms 13648 KB Output is correct
22 Correct 384 ms 13616 KB Output is correct
23 Correct 494 ms 13652 KB Output is correct
24 Correct 542 ms 403052 KB Output is correct
25 Correct 551 ms 402836 KB Output is correct
26 Correct 573 ms 402900 KB Output is correct
27 Correct 513 ms 403888 KB Output is correct
28 Correct 489 ms 403664 KB Output is correct
29 Correct 486 ms 403660 KB Output is correct
30 Correct 509 ms 403748 KB Output is correct
31 Correct 541 ms 403664 KB Output is correct
32 Correct 496 ms 403568 KB Output is correct
33 Correct 435 ms 402656 KB Output is correct
34 Correct 448 ms 402648 KB Output is correct
35 Correct 425 ms 402696 KB Output is correct
36 Correct 472 ms 402892 KB Output is correct
37 Correct 511 ms 402784 KB Output is correct
38 Correct 477 ms 402896 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 6900 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 6 ms 11220 KB Output is correct
6 Correct 8 ms 11356 KB Output is correct
7 Correct 5 ms 11356 KB Output is correct
8 Correct 6 ms 11228 KB Output is correct
9 Correct 6 ms 11356 KB Output is correct
10 Correct 6 ms 11356 KB Output is correct
11 Correct 7 ms 11224 KB Output is correct
12 Correct 6 ms 11356 KB Output is correct
13 Correct 7 ms 11356 KB Output is correct
14 Correct 6 ms 11356 KB Output is correct
15 Correct 5 ms 11356 KB Output is correct
16 Correct 6 ms 11356 KB Output is correct
17 Correct 6 ms 11356 KB Output is correct
18 Correct 5 ms 11356 KB Output is correct
19 Correct 6 ms 11356 KB Output is correct
20 Correct 395 ms 13708 KB Output is correct
21 Correct 294 ms 13648 KB Output is correct
22 Correct 384 ms 13616 KB Output is correct
23 Correct 494 ms 13652 KB Output is correct
24 Correct 542 ms 403052 KB Output is correct
25 Correct 551 ms 402836 KB Output is correct
26 Correct 573 ms 402900 KB Output is correct
27 Correct 513 ms 403888 KB Output is correct
28 Correct 489 ms 403664 KB Output is correct
29 Correct 486 ms 403660 KB Output is correct
30 Correct 509 ms 403748 KB Output is correct
31 Correct 541 ms 403664 KB Output is correct
32 Correct 496 ms 403568 KB Output is correct
33 Correct 435 ms 402656 KB Output is correct
34 Correct 448 ms 402648 KB Output is correct
35 Correct 425 ms 402696 KB Output is correct
36 Correct 472 ms 402892 KB Output is correct
37 Correct 511 ms 402784 KB Output is correct
38 Correct 477 ms 402896 KB Output is correct
39 Correct 571 ms 402940 KB Output is correct
40 Correct 553 ms 402116 KB Output is correct
41 Correct 561 ms 402052 KB Output is correct
42 Correct 648 ms 402420 KB Output is correct
43 Correct 560 ms 402772 KB Output is correct
44 Correct 403 ms 14280 KB Output is correct
45 Correct 426 ms 13396 KB Output is correct
46 Correct 383 ms 13364 KB Output is correct
47 Correct 407 ms 13560 KB Output is correct
48 Correct 422 ms 13532 KB Output is correct
49 Correct 523 ms 404068 KB Output is correct
50 Correct 513 ms 403024 KB Output is correct
51 Correct 283 ms 14292 KB Output is correct
52 Correct 270 ms 13296 KB Output is correct
53 Correct 521 ms 403148 KB Output is correct
54 Correct 520 ms 403096 KB Output is correct
55 Correct 473 ms 402512 KB Output is correct
56 Correct 489 ms 402020 KB Output is correct
57 Correct 433 ms 14364 KB Output is correct
58 Correct 432 ms 14180 KB Output is correct
59 Correct 372 ms 13396 KB Output is correct
60 Correct 405 ms 13296 KB Output is correct
61 Correct 578 ms 403284 KB Output is correct
62 Correct 549 ms 402492 KB Output is correct
63 Correct 618 ms 402724 KB Output is correct
64 Correct 482 ms 402984 KB Output is correct
65 Correct 502 ms 402320 KB Output is correct
66 Correct 480 ms 402004 KB Output is correct
67 Correct 494 ms 402956 KB Output is correct
68 Correct 490 ms 402256 KB Output is correct
69 Correct 486 ms 402000 KB Output is correct
70 Correct 517 ms 403476 KB Output is correct
71 Correct 498 ms 402988 KB Output is correct
72 Correct 521 ms 402660 KB Output is correct
73 Correct 519 ms 403524 KB Output is correct
74 Correct 521 ms 402476 KB Output is correct
75 Correct 510 ms 402516 KB Output is correct
76 Correct 522 ms 404332 KB Output is correct
77 Correct 495 ms 402964 KB Output is correct
78 Correct 508 ms 403584 KB Output is correct
79 Correct 271 ms 14292 KB Output is correct
80 Correct 262 ms 13420 KB Output is correct
81 Correct 241 ms 13652 KB Output is correct
82 Correct 558 ms 404268 KB Output is correct
83 Correct 569 ms 403912 KB Output is correct
84 Correct 489 ms 403028 KB Output is correct
85 Correct 511 ms 403148 KB Output is correct
86 Correct 510 ms 403836 KB Output is correct
87 Correct 508 ms 403496 KB Output is correct
88 Correct 413 ms 14160 KB Output is correct
89 Correct 406 ms 14256 KB Output is correct
90 Correct 394 ms 13348 KB Output is correct
91 Correct 447 ms 13296 KB Output is correct
92 Correct 396 ms 13648 KB Output is correct
93 Correct 376 ms 13652 KB Output is correct
94 Correct 491 ms 402948 KB Output is correct
95 Correct 442 ms 402768 KB Output is correct
96 Correct 425 ms 402004 KB Output is correct
97 Correct 438 ms 402044 KB Output is correct
98 Correct 438 ms 402612 KB Output is correct
99 Correct 427 ms 402516 KB Output is correct
100 Correct 572 ms 14172 KB Output is correct
101 Correct 486 ms 14036 KB Output is correct
102 Correct 509 ms 13300 KB Output is correct
103 Correct 493 ms 13284 KB Output is correct
104 Correct 558 ms 13536 KB Output is correct
105 Correct 500 ms 13516 KB Output is correct
106 Correct 509 ms 403144 KB Output is correct
107 Correct 517 ms 402888 KB Output is correct
108 Correct 474 ms 402772 KB Output is correct
109 Correct 500 ms 402196 KB Output is correct
110 Correct 488 ms 402752 KB Output is correct
111 Correct 521 ms 402772 KB Output is correct
112 Correct 412 ms 14200 KB Output is correct
113 Correct 436 ms 14288 KB Output is correct
114 Correct 412 ms 13336 KB Output is correct
115 Correct 454 ms 13392 KB Output is correct
116 Correct 375 ms 13652 KB Output is correct
117 Correct 447 ms 13652 KB Output is correct
118 Correct 486 ms 403156 KB Output is correct
119 Correct 481 ms 402260 KB Output is correct
120 Correct 509 ms 402256 KB Output is correct
121 Correct 488 ms 403280 KB Output is correct
122 Correct 488 ms 402224 KB Output is correct
123 Correct 481 ms 402300 KB Output is correct
124 Correct 488 ms 402968 KB Output is correct
125 Correct 480 ms 402124 KB Output is correct
126 Correct 499 ms 402256 KB Output is correct