oj.uz

Submission #447895

# Submission time Handle Problem Language Result Execution time Memory
447895 2021-07-28T04:18:30 Z SirCovidThe19th Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1494 ms 114708 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 = 100;

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 4 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 6 ms 5500 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 8 ms 6092 KB Output is correct
9 Correct 10 ms 6092 KB Output is correct
10 Correct 10 ms 5964 KB Output is correct
11 Correct 8 ms 5964 KB Output is correct
12 Correct 7 ms 5744 KB Output is correct
13 Correct 8 ms 5952 KB Output is correct
14 Correct 7 ms 5580 KB Output is correct
15 Correct 8 ms 5452 KB Output is correct
16 Correct 7 ms 5604 KB Output is correct
17 Correct 7 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 4 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 6 ms 5500 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 8 ms 6092 KB Output is correct
9 Correct 10 ms 6092 KB Output is correct
10 Correct 10 ms 5964 KB Output is correct
11 Correct 8 ms 5964 KB Output is correct
12 Correct 7 ms 5744 KB Output is correct
13 Correct 8 ms 5952 KB Output is correct
14 Correct 7 ms 5580 KB Output is correct
15 Correct 8 ms 5452 KB Output is correct
16 Correct 7 ms 5604 KB Output is correct
17 Correct 7 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 655 ms 7288 KB Output is correct
21 Correct 662 ms 7424 KB Output is correct
22 Correct 654 ms 7288 KB Output is correct
23 Correct 665 ms 7264 KB Output is correct
24 Correct 665 ms 88892 KB Output is correct
25 Correct 669 ms 90000 KB Output is correct
26 Correct 670 ms 89948 KB Output is correct
27 Correct 618 ms 111116 KB Output is correct
28 Correct 636 ms 111136 KB Output is correct
29 Correct 598 ms 111440 KB Output is correct
30 Correct 607 ms 110324 KB Output is correct
31 Correct 635 ms 109780 KB Output is correct
32 Correct 607 ms 110328 KB Output is correct
33 Correct 499 ms 75080 KB Output is correct
34 Correct 503 ms 68444 KB Output is correct
35 Correct 499 ms 74884 KB Output is correct
36 Correct 607 ms 94564 KB Output is correct
37 Correct 594 ms 90136 KB Output is correct
38 Correct 590 ms 94532 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 4 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 6 ms 5500 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 8 ms 6092 KB Output is correct
9 Correct 10 ms 6092 KB Output is correct
10 Correct 10 ms 5964 KB Output is correct
11 Correct 8 ms 5964 KB Output is correct
12 Correct 7 ms 5744 KB Output is correct
13 Correct 8 ms 5952 KB Output is correct
14 Correct 7 ms 5580 KB Output is correct
15 Correct 8 ms 5452 KB Output is correct
16 Correct 7 ms 5604 KB Output is correct
17 Correct 7 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 655 ms 7288 KB Output is correct
21 Correct 662 ms 7424 KB Output is correct
22 Correct 654 ms 7288 KB Output is correct
23 Correct 665 ms 7264 KB Output is correct
24 Correct 665 ms 88892 KB Output is correct
25 Correct 669 ms 90000 KB Output is correct
26 Correct 670 ms 89948 KB Output is correct
27 Correct 618 ms 111116 KB Output is correct
28 Correct 636 ms 111136 KB Output is correct
29 Correct 598 ms 111440 KB Output is correct
30 Correct 607 ms 110324 KB Output is correct
31 Correct 635 ms 109780 KB Output is correct
32 Correct 607 ms 110328 KB Output is correct
33 Correct 499 ms 75080 KB Output is correct
34 Correct 503 ms 68444 KB Output is correct
35 Correct 499 ms 74884 KB Output is correct
36 Correct 607 ms 94564 KB Output is correct
37 Correct 594 ms 90136 KB Output is correct
38 Correct 590 ms 94532 KB Output is correct
39 Correct 882 ms 88724 KB Output is correct
40 Correct 736 ms 89000 KB Output is correct
41 Correct 1494 ms 89468 KB Output is correct
42 Correct 896 ms 89552 KB Output is correct
43 Correct 711 ms 89196 KB Output is correct
44 Correct 843 ms 7748 KB Output is correct
45 Correct 683 ms 7492 KB Output is correct
46 Correct 993 ms 7424 KB Output is correct
47 Correct 728 ms 7476 KB Output is correct
48 Correct 668 ms 7420 KB Output is correct
49 Correct 827 ms 111076 KB Output is correct
50 Correct 1244 ms 110816 KB Output is correct
51 Correct 831 ms 7564 KB Output is correct
52 Correct 992 ms 7304 KB Output is correct
53 Correct 813 ms 93892 KB Output is correct
54 Correct 818 ms 89796 KB Output is correct
55 Correct 1315 ms 93892 KB Output is correct
56 Correct 1262 ms 90308 KB Output is correct
57 Correct 857 ms 7596 KB Output is correct
58 Correct 842 ms 7668 KB Output is correct
59 Correct 1002 ms 7236 KB Output is correct
60 Correct 986 ms 7308 KB Output is correct
61 Correct 755 ms 110796 KB Output is correct
62 Correct 736 ms 94240 KB Output is correct
63 Correct 740 ms 89664 KB Output is correct
64 Correct 1049 ms 110756 KB Output is correct
65 Correct 1020 ms 96524 KB Output is correct
66 Correct 1008 ms 92868 KB Output is correct
67 Correct 1385 ms 113432 KB Output is correct
68 Correct 1319 ms 96996 KB Output is correct
69 Correct 1237 ms 91788 KB Output is correct
70 Correct 651 ms 113672 KB Output is correct
71 Correct 646 ms 96968 KB Output is correct
72 Correct 641 ms 92708 KB Output is correct
73 Correct 666 ms 113560 KB Output is correct
74 Correct 653 ms 96940 KB Output is correct
75 Correct 671 ms 92472 KB Output is correct
76 Correct 835 ms 114708 KB Output is correct
77 Correct 1319 ms 113732 KB Output is correct
78 Correct 702 ms 113768 KB Output is correct
79 Correct 845 ms 10144 KB Output is correct
80 Correct 996 ms 9084 KB Output is correct
81 Correct 663 ms 8908 KB Output is correct
82 Correct 819 ms 113960 KB Output is correct
83 Correct 827 ms 113124 KB Output is correct
84 Correct 1338 ms 113064 KB Output is correct
85 Correct 1389 ms 112248 KB Output is correct
86 Correct 649 ms 113064 KB Output is correct
87 Correct 663 ms 112564 KB Output is correct
88 Correct 846 ms 10196 KB Output is correct
89 Correct 833 ms 10144 KB Output is correct
90 Correct 1020 ms 9160 KB Output is correct
91 Correct 1012 ms 9212 KB Output is correct
92 Correct 680 ms 8828 KB Output is correct
93 Correct 654 ms 8896 KB Output is correct
94 Correct 698 ms 78624 KB Output is correct
95 Correct 719 ms 71288 KB Output is correct
96 Correct 1236 ms 77564 KB Output is correct
97 Correct 1073 ms 71720 KB Output is correct
98 Correct 529 ms 77952 KB Output is correct
99 Correct 510 ms 71428 KB Output is correct
100 Correct 893 ms 10096 KB Output is correct
101 Correct 864 ms 10052 KB Output is correct
102 Correct 965 ms 9284 KB Output is correct
103 Correct 960 ms 9280 KB Output is correct
104 Correct 693 ms 8808 KB Output is correct
105 Correct 684 ms 8812 KB Output is correct
106 Correct 841 ms 97480 KB Output is correct
107 Correct 807 ms 93600 KB Output is correct
108 Correct 1288 ms 97324 KB Output is correct
109 Correct 1276 ms 92544 KB Output is correct
110 Correct 661 ms 97536 KB Output is correct
111 Correct 616 ms 93280 KB Output is correct
112 Correct 856 ms 10236 KB Output is correct
113 Correct 843 ms 10096 KB Output is correct
114 Correct 979 ms 9284 KB Output is correct
115 Correct 1010 ms 9068 KB Output is correct
116 Correct 671 ms 8904 KB Output is correct
117 Correct 657 ms 8920 KB Output is correct
118 Correct 622 ms 112964 KB Output is correct
119 Correct 623 ms 96592 KB Output is correct
120 Correct 591 ms 91840 KB Output is correct
121 Correct 627 ms 113012 KB Output is correct
122 Correct 648 ms 96276 KB Output is correct
123 Correct 610 ms 91804 KB Output is correct
124 Correct 606 ms 113252 KB Output is correct
125 Correct 606 ms 96708 KB Output is correct
126 Correct 580 ms 92000 KB Output is correct