oj.uz

Submission #447898

# Submission time Handle Problem Language Result Execution time Memory
447898 2021-07-28T04:29:33 Z SirCovidThe19th Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1409 ms 111280 KB 
#include <bits/stdc++.h>
using namespace std; 
 
#define v vector
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
 
const int mx = 1e5+5, sq = 110;
 
int n, m, q; vector<int> adj[mx]; v<pii> far[mx]; bool use[mx];
 
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> m >> q;
    for (int i = 0; i < m; i++){ int a, b; cin >> a >> b; adj[a-1].pb(b-1); }
    auto merge = [&](v<pii> a, v<pii> b){ 
        v<pii> ret; v<int> vis; int x = 0, y = 0, szA = a.size(), szB = b.size();
        auto ins = [&](v<pii> &cur, int &i){ 
            if (!use[cur[i].f]) ret.pb(cur[i]);
            use[cur[i].f] = 1; vis.pb(cur[i].f); i++;
        };while (ret.size() < sq and (x < szA or y < szB)){ 
            if (x < szA and (y >= szB or a[x].s+1 > b[y].s)) a[x].s++, ins(a, x);
            else ins(b, y);
        }for (auto i : vis){ use[i] = 0; } return ret;
    };for (int i = 0; i < n; i++) far[i].pb({i, 0});
    for (int i = 0; i < n; i++) for (int j : adj[i]) far[j] = merge(far[i], far[j]);
    while (q--){
        int t, y; cin >> t >> y; t--; int C[y], ans = -1; v<int> vis; 
        for (int &i : C) cin >> i, i--, use[i] = 1, vis.pb(i);
        if (y < sq){ for (auto i : far[t]) if (!use[i.f]){ ans = i.s; break; } }
        else{
            int dp[t+1]; memset(dp, -1, sizeof(dp));
            for (int i = 0; i <= t; i++){
                if (!use[i]) dp[i] = max(dp[i], 0);
                for (int j : adj[i]) if (j <= t) dp[j] = max(dp[j], (dp[i] == -1) ? dp[i] : dp[i]+1);
            }ans = dp[t];
        }for (auto i : vis){ use[i] = 0; } cout<<ans<<endl;
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 6 ms 5452 KB Output is correct
6 Correct 7 ms 5452 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 8 ms 6044 KB Output is correct
9 Correct 8 ms 6096 KB Output is correct
10 Correct 9 ms 5988 KB Output is correct
11 Correct 9 ms 6056 KB Output is correct
12 Correct 7 ms 5836 KB Output is correct
13 Correct 9 ms 6040 KB Output is correct
14 Correct 8 ms 5580 KB Output is correct
15 Correct 6 ms 5472 KB Output is correct
16 Correct 7 ms 5632 KB Output is correct
17 Correct 8 ms 5836 KB Output is correct
18 Correct 7 ms 5580 KB Output is correct
19 Correct 8 ms 5836 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 6 ms 5452 KB Output is correct
6 Correct 7 ms 5452 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 8 ms 6044 KB Output is correct
9 Correct 8 ms 6096 KB Output is correct
10 Correct 9 ms 5988 KB Output is correct
11 Correct 9 ms 6056 KB Output is correct
12 Correct 7 ms 5836 KB Output is correct
13 Correct 9 ms 6040 KB Output is correct
14 Correct 8 ms 5580 KB Output is correct
15 Correct 6 ms 5472 KB Output is correct
16 Correct 7 ms 5632 KB Output is correct
17 Correct 8 ms 5836 KB Output is correct
18 Correct 7 ms 5580 KB Output is correct
19 Correct 8 ms 5836 KB Output is correct
20 Correct 677 ms 7288 KB Output is correct
21 Correct 685 ms 7308 KB Output is correct
22 Correct 672 ms 7364 KB Output is correct
23 Correct 711 ms 7260 KB Output is correct
24 Correct 724 ms 88912 KB Output is correct
25 Correct 702 ms 89920 KB Output is correct
26 Correct 683 ms 89880 KB Output is correct
27 Correct 623 ms 111256 KB Output is correct
28 Correct 633 ms 111192 KB Output is correct
29 Correct 624 ms 111280 KB Output is correct
30 Correct 620 ms 110336 KB Output is correct
31 Correct 629 ms 109784 KB Output is correct
32 Correct 634 ms 110392 KB Output is correct
33 Correct 511 ms 75232 KB Output is correct
34 Correct 491 ms 68524 KB Output is correct
35 Correct 511 ms 74816 KB Output is correct
36 Correct 614 ms 94660 KB Output is correct
37 Correct 593 ms 90152 KB Output is correct
38 Correct 613 ms 94528 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 6 ms 5452 KB Output is correct
6 Correct 7 ms 5452 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 8 ms 6044 KB Output is correct
9 Correct 8 ms 6096 KB Output is correct
10 Correct 9 ms 5988 KB Output is correct
11 Correct 9 ms 6056 KB Output is correct
12 Correct 7 ms 5836 KB Output is correct
13 Correct 9 ms 6040 KB Output is correct
14 Correct 8 ms 5580 KB Output is correct
15 Correct 6 ms 5472 KB Output is correct
16 Correct 7 ms 5632 KB Output is correct
17 Correct 8 ms 5836 KB Output is correct
18 Correct 7 ms 5580 KB Output is correct
19 Correct 8 ms 5836 KB Output is correct
20 Correct 677 ms 7288 KB Output is correct
21 Correct 685 ms 7308 KB Output is correct
22 Correct 672 ms 7364 KB Output is correct
23 Correct 711 ms 7260 KB Output is correct
24 Correct 724 ms 88912 KB Output is correct
25 Correct 702 ms 89920 KB Output is correct
26 Correct 683 ms 89880 KB Output is correct
27 Correct 623 ms 111256 KB Output is correct
28 Correct 633 ms 111192 KB Output is correct
29 Correct 624 ms 111280 KB Output is correct
30 Correct 620 ms 110336 KB Output is correct
31 Correct 629 ms 109784 KB Output is correct
32 Correct 634 ms 110392 KB Output is correct
33 Correct 511 ms 75232 KB Output is correct
34 Correct 491 ms 68524 KB Output is correct
35 Correct 511 ms 74816 KB Output is correct
36 Correct 614 ms 94660 KB Output is correct
37 Correct 593 ms 90152 KB Output is correct
38 Correct 613 ms 94528 KB Output is correct
39 Correct 870 ms 88788 KB Output is correct
40 Correct 701 ms 89044 KB Output is correct
41 Correct 964 ms 89656 KB Output is correct
42 Correct 888 ms 89376 KB Output is correct
43 Correct 707 ms 89204 KB Output is correct
44 Correct 873 ms 7792 KB Output is correct
45 Correct 714 ms 7376 KB Output is correct
46 Correct 805 ms 7364 KB Output is correct
47 Correct 749 ms 7236 KB Output is correct
48 Correct 682 ms 7364 KB Output is correct
49 Correct 830 ms 110900 KB Output is correct
50 Correct 869 ms 110788 KB Output is correct
51 Correct 887 ms 7620 KB Output is correct
52 Correct 788 ms 7424 KB Output is correct
53 Correct 829 ms 93896 KB Output is correct
54 Correct 805 ms 89936 KB Output is correct
55 Correct 904 ms 93904 KB Output is correct
56 Correct 841 ms 90260 KB Output is correct
57 Correct 875 ms 7748 KB Output is correct
58 Correct 870 ms 7672 KB Output is correct
59 Correct 802 ms 7300 KB Output is correct
60 Correct 809 ms 7364 KB Output is correct
61 Correct 757 ms 110772 KB Output is correct
62 Correct 758 ms 94208 KB Output is correct
63 Correct 732 ms 89672 KB Output is correct
64 Correct 1070 ms 110788 KB Output is correct
65 Correct 1066 ms 93936 KB Output is correct
66 Correct 1012 ms 90240 KB Output is correct
67 Correct 1328 ms 110692 KB Output is correct
68 Correct 1409 ms 94332 KB Output is correct
69 Correct 1303 ms 89240 KB Output is correct
70 Correct 648 ms 110912 KB Output is correct
71 Correct 644 ms 94240 KB Output is correct
72 Correct 618 ms 90136 KB Output is correct
73 Correct 677 ms 110940 KB Output is correct
74 Correct 667 ms 94116 KB Output is correct
75 Correct 638 ms 89916 KB Output is correct
76 Correct 835 ms 111060 KB Output is correct
77 Correct 1294 ms 110904 KB Output is correct
78 Correct 644 ms 110932 KB Output is correct
79 Correct 883 ms 7612 KB Output is correct
80 Correct 994 ms 7432 KB Output is correct
81 Correct 700 ms 7400 KB Output is correct
82 Correct 828 ms 110368 KB Output is correct
83 Correct 837 ms 109452 KB Output is correct
84 Correct 1320 ms 110168 KB Output is correct
85 Correct 1311 ms 109496 KB Output is correct
86 Correct 645 ms 110328 KB Output is correct
87 Correct 646 ms 109692 KB Output is correct
88 Correct 873 ms 7860 KB Output is correct
89 Correct 855 ms 7676 KB Output is correct
90 Correct 1020 ms 7288 KB Output is correct
91 Correct 1053 ms 7364 KB Output is correct
92 Correct 686 ms 7308 KB Output is correct
93 Correct 684 ms 7364 KB Output is correct
94 Correct 710 ms 74936 KB Output is correct
95 Correct 687 ms 67648 KB Output is correct
96 Correct 1068 ms 74540 KB Output is correct
97 Correct 1053 ms 68848 KB Output is correct
98 Correct 520 ms 75132 KB Output is correct
99 Correct 502 ms 68600 KB Output is correct
100 Correct 901 ms 7712 KB Output is correct
101 Correct 905 ms 7496 KB Output is correct
102 Correct 967 ms 7252 KB Output is correct
103 Correct 974 ms 7240 KB Output is correct
104 Correct 731 ms 7336 KB Output is correct
105 Correct 721 ms 7236 KB Output is correct
106 Correct 833 ms 93964 KB Output is correct
107 Correct 803 ms 89992 KB Output is correct
108 Correct 1244 ms 94440 KB Output is correct
109 Correct 1318 ms 89516 KB Output is correct
110 Correct 655 ms 94716 KB Output is correct
111 Correct 617 ms 90308 KB Output is correct
112 Correct 871 ms 7812 KB Output is correct
113 Correct 877 ms 7668 KB Output is correct
114 Correct 980 ms 7492 KB Output is correct
115 Correct 1006 ms 7288 KB Output is correct
116 Correct 682 ms 7312 KB Output is correct
117 Correct 727 ms 7288 KB Output is correct
118 Correct 674 ms 110364 KB Output is correct
119 Correct 631 ms 93844 KB Output is correct
120 Correct 606 ms 89412 KB Output is correct
121 Correct 654 ms 110488 KB Output is correct
122 Correct 644 ms 93580 KB Output is correct
123 Correct 629 ms 89204 KB Output is correct
124 Correct 643 ms 110404 KB Output is correct
125 Correct 633 ms 94148 KB Output is correct
126 Correct 617 ms 89540 KB Output is correct