oj.uz

Submission #128822

# Submission time Handle Problem Language Result Execution time Memory
128822 2019-07-11T09:54:31 Z BThero Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1303 ms 181472 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
#define pb push_back
#define mp make_pair
 
#define all(x) (x).begin(), (x).end()
 
#define fi first
#define se second
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;   
typedef pair<int, int> pii;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
const int MAXN = (int)1e5 + 5;
const int INF = (int)1e9;
const int K = 200;
 
pair<int, vector<int> > req[MAXN];
 
vector<int> adj[MAXN], par[MAXN];
 
int ban[MAXN], d[MAXN];
 
pii best[MAXN][K + 5];
 
int n, m, q;
 
void solve() {
    scanf("%d %d %d", &n, &m, &q);
 
    for (int i = 1; i <= m; ++i) {
        int u, v;
        scanf("%d %d", &u, &v);
        adj[u].pb(v);
        par[v].pb(u);
    }
 
    for (int i = 1; i <= q; ++i) {
        int v, sz;
        scanf("%d %d", &v, &sz);
        vector<int> tmp(sz);
 
        for (int j = 0; j < sz; ++j) {
            scanf("%d", &tmp[j]);
        }
 
        req[i] = mp(v, tmp);
    }
 
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j <= K; ++j) {
            best[i][j] = mp(-INF, 0);
        }
    }
 
    for (int i = 1; i <= n; ++i) {
        best[i][0] = mp(-1, i);
        vector<pii> V(2 * K + 5);
 
        for (int j : par[i]) {
            int a = 0, b = 0, ptr = 0;
 
            while (a <= K || b <= K) {                 
                if (a > K) {
                    V[ptr++] = best[j][b++];
                }
                else if (b > K) {
                    V[ptr++] = best[i][a++];
                }
                else {
                    if (best[i][a] > best[j][b]) {
                        V[ptr++] = best[i][a++];
                    }
                    else {
                        V[ptr++] = best[j][b++];
                    }
                }
            }

            int ptr2 = 0;

            for (int k = 0; k <= ptr; ++k) {
                if (!ban[V[k].se] && ptr2 <= K) {
                    best[i][ptr2++] = V[k]; 
                    ban[V[k].se] = 1;
                }
            }
 
            for (int k = 0; k <= ptr; ++k) {
                ban[V[k].se] = 0;
            }
        }
 
        for (int j = 0; j <= K; ++j) {
            ++best[i][j].fi;
        }
    }
 
    for (int i = 1; i <= q; ++i) {
        int v = req[i].fi, ans = -1;
        vector<int> V = req[i].se;
 
        for (int x : V) {
            ban[x] = 1;
        }
 
        if (V.size() >= K) {
            fill(d + 1, d + n + 1, -INF);
            d[v] = 0;
 
            for (int j = v - 1; j > 0; --j) {
                for (int p : adj[j]) {
                    d[j] = max(d[j], d[p] + 1);
                }
            }
 
            for (int j = 1; j <= v; ++j) {
                if (!ban[j]) {
                    ans = max(ans, d[j]);
                }
            } 
        }
        else {
            for (int j = 0; j <= K; ++j) {
                if (!ban[best[v][j].se]) {
                    ans = max(ans, best[v][j].fi);
                }
            }
        }
 
        printf("%d\n", ans);
 
        for (int x : V) {
            ban[x] = 0;
        }
    }
}
 
int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
 
    int tt = 1;
 
    while (tt--) {
        solve();
    }
 
    return 0;
}

Compilation message

bitaro.cpp: In function 'void solve()':
bitaro.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &v, &sz);
         ~~~~~^~~~~~~~~~~~~~~~~~
bitaro.cpp:56:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &tmp[j]);
             ~~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 8 ms 8184 KB Output is correct
3 Correct 8 ms 8184 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 17 ms 9848 KB Output is correct
6 Correct 18 ms 9848 KB Output is correct
7 Correct 17 ms 9848 KB Output is correct
8 Correct 18 ms 9848 KB Output is correct
9 Correct 17 ms 9848 KB Output is correct
10 Correct 18 ms 9848 KB Output is correct
11 Correct 19 ms 9976 KB Output is correct
12 Correct 18 ms 9848 KB Output is correct
13 Correct 18 ms 9880 KB Output is correct
14 Correct 18 ms 9848 KB Output is correct
15 Correct 18 ms 9868 KB Output is correct
16 Correct 18 ms 9824 KB Output is correct
17 Correct 18 ms 9848 KB Output is correct
18 Correct 18 ms 9804 KB Output is correct
19 Correct 18 ms 9852 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 8 ms 8184 KB Output is correct
3 Correct 8 ms 8184 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 17 ms 9848 KB Output is correct
6 Correct 18 ms 9848 KB Output is correct
7 Correct 17 ms 9848 KB Output is correct
8 Correct 18 ms 9848 KB Output is correct
9 Correct 17 ms 9848 KB Output is correct
10 Correct 18 ms 9848 KB Output is correct
11 Correct 19 ms 9976 KB Output is correct
12 Correct 18 ms 9848 KB Output is correct
13 Correct 18 ms 9880 KB Output is correct
14 Correct 18 ms 9848 KB Output is correct
15 Correct 18 ms 9868 KB Output is correct
16 Correct 18 ms 9824 KB Output is correct
17 Correct 18 ms 9848 KB Output is correct
18 Correct 18 ms 9804 KB Output is correct
19 Correct 18 ms 9852 KB Output is correct
20 Correct 690 ms 12200 KB Output is correct
21 Correct 653 ms 12240 KB Output is correct
22 Correct 692 ms 12220 KB Output is correct
23 Correct 720 ms 12280 KB Output is correct
24 Correct 1153 ms 175028 KB Output is correct
25 Correct 1170 ms 175156 KB Output is correct
26 Correct 1184 ms 175056 KB Output is correct
27 Correct 923 ms 176432 KB Output is correct
28 Correct 933 ms 176520 KB Output is correct
29 Correct 936 ms 176576 KB Output is correct
30 Correct 945 ms 175876 KB Output is correct
31 Correct 1024 ms 175724 KB Output is correct
32 Correct 933 ms 175924 KB Output is correct
33 Correct 946 ms 175820 KB Output is correct
34 Correct 983 ms 175784 KB Output is correct
35 Correct 953 ms 175744 KB Output is correct
36 Correct 960 ms 175840 KB Output is correct
37 Correct 1039 ms 175828 KB Output is correct
38 Correct 968 ms 175892 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 8 ms 8184 KB Output is correct
3 Correct 8 ms 8184 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 17 ms 9848 KB Output is correct
6 Correct 18 ms 9848 KB Output is correct
7 Correct 17 ms 9848 KB Output is correct
8 Correct 18 ms 9848 KB Output is correct
9 Correct 17 ms 9848 KB Output is correct
10 Correct 18 ms 9848 KB Output is correct
11 Correct 19 ms 9976 KB Output is correct
12 Correct 18 ms 9848 KB Output is correct
13 Correct 18 ms 9880 KB Output is correct
14 Correct 18 ms 9848 KB Output is correct
15 Correct 18 ms 9868 KB Output is correct
16 Correct 18 ms 9824 KB Output is correct
17 Correct 18 ms 9848 KB Output is correct
18 Correct 18 ms 9804 KB Output is correct
19 Correct 18 ms 9852 KB Output is correct
20 Correct 690 ms 12200 KB Output is correct
21 Correct 653 ms 12240 KB Output is correct
22 Correct 692 ms 12220 KB Output is correct
23 Correct 720 ms 12280 KB Output is correct
24 Correct 1153 ms 175028 KB Output is correct
25 Correct 1170 ms 175156 KB Output is correct
26 Correct 1184 ms 175056 KB Output is correct
27 Correct 923 ms 176432 KB Output is correct
28 Correct 933 ms 176520 KB Output is correct
29 Correct 936 ms 176576 KB Output is correct
30 Correct 945 ms 175876 KB Output is correct
31 Correct 1024 ms 175724 KB Output is correct
32 Correct 933 ms 175924 KB Output is correct
33 Correct 946 ms 175820 KB Output is correct
34 Correct 983 ms 175784 KB Output is correct
35 Correct 953 ms 175744 KB Output is correct
36 Correct 960 ms 175840 KB Output is correct
37 Correct 1039 ms 175828 KB Output is correct
38 Correct 968 ms 175892 KB Output is correct
39 Correct 1303 ms 176504 KB Output is correct
40 Correct 1225 ms 174788 KB Output is correct
41 Correct 1193 ms 174688 KB Output is correct
42 Correct 1295 ms 175116 KB Output is correct
43 Correct 1199 ms 175148 KB Output is correct
44 Correct 766 ms 14384 KB Output is correct
45 Correct 706 ms 12536 KB Output is correct
46 Correct 714 ms 12508 KB Output is correct
47 Correct 709 ms 12536 KB Output is correct
48 Correct 685 ms 12152 KB Output is correct
49 Correct 1080 ms 177984 KB Output is correct
50 Correct 939 ms 176176 KB Output is correct
51 Correct 726 ms 16520 KB Output is correct
52 Correct 666 ms 14328 KB Output is correct
53 Correct 1077 ms 180772 KB Output is correct
54 Correct 1156 ms 180760 KB Output is correct
55 Correct 1002 ms 178376 KB Output is correct
56 Correct 1071 ms 178272 KB Output is correct
57 Correct 768 ms 16532 KB Output is correct
58 Correct 777 ms 16712 KB Output is correct
59 Correct 689 ms 14328 KB Output is correct
60 Correct 734 ms 14348 KB Output is correct
61 Correct 1026 ms 179300 KB Output is correct
62 Correct 1044 ms 178684 KB Output is correct
63 Correct 1107 ms 178664 KB Output is correct
64 Correct 1184 ms 179320 KB Output is correct
65 Correct 1219 ms 178604 KB Output is correct
66 Correct 1279 ms 178592 KB Output is correct
67 Correct 1152 ms 179100 KB Output is correct
68 Correct 1180 ms 178700 KB Output is correct
69 Correct 1230 ms 178612 KB Output is correct
70 Correct 953 ms 179448 KB Output is correct
71 Correct 985 ms 178848 KB Output is correct
72 Correct 1056 ms 178844 KB Output is correct
73 Correct 982 ms 179208 KB Output is correct
74 Correct 1002 ms 178700 KB Output is correct
75 Correct 1063 ms 178784 KB Output is correct
76 Correct 1057 ms 181472 KB Output is correct
77 Correct 958 ms 179388 KB Output is correct
78 Correct 983 ms 179576 KB Output is correct
79 Correct 728 ms 16588 KB Output is correct
80 Correct 667 ms 14408 KB Output is correct
81 Correct 661 ms 13920 KB Output is correct
82 Correct 1056 ms 180832 KB Output is correct
83 Correct 1162 ms 180676 KB Output is correct
84 Correct 967 ms 178628 KB Output is correct
85 Correct 1075 ms 178584 KB Output is correct
86 Correct 974 ms 178896 KB Output is correct
87 Correct 1073 ms 178852 KB Output is correct
88 Correct 798 ms 16572 KB Output is correct
89 Correct 770 ms 16608 KB Output is correct
90 Correct 699 ms 14280 KB Output is correct
91 Correct 712 ms 14280 KB Output is correct
92 Correct 686 ms 13764 KB Output is correct
93 Correct 691 ms 13768 KB Output is correct
94 Correct 1071 ms 180744 KB Output is correct
95 Correct 1126 ms 180712 KB Output is correct
96 Correct 982 ms 178844 KB Output is correct
97 Correct 1004 ms 178752 KB Output is correct
98 Correct 976 ms 178884 KB Output is correct
99 Correct 1012 ms 178812 KB Output is correct
100 Correct 823 ms 16608 KB Output is correct
101 Correct 792 ms 16540 KB Output is correct
102 Correct 754 ms 14368 KB Output is correct
103 Correct 767 ms 14436 KB Output is correct
104 Correct 746 ms 13912 KB Output is correct
105 Correct 742 ms 13916 KB Output is correct
106 Correct 1082 ms 181036 KB Output is correct
107 Correct 1200 ms 180948 KB Output is correct
108 Correct 993 ms 178884 KB Output is correct
109 Correct 1062 ms 178992 KB Output is correct
110 Correct 1014 ms 178948 KB Output is correct
111 Correct 1058 ms 179072 KB Output is correct
112 Correct 778 ms 16768 KB Output is correct
113 Correct 778 ms 16600 KB Output is correct
114 Correct 715 ms 14432 KB Output is correct
115 Correct 720 ms 14328 KB Output is correct
116 Correct 693 ms 13816 KB Output is correct
117 Correct 699 ms 13944 KB Output is correct
118 Correct 941 ms 178792 KB Output is correct
119 Correct 966 ms 178152 KB Output is correct
120 Correct 1040 ms 178228 KB Output is correct
121 Correct 947 ms 179052 KB Output is correct
122 Correct 966 ms 178172 KB Output is correct
123 Correct 1057 ms 178256 KB Output is correct
124 Correct 938 ms 178772 KB Output is correct
125 Correct 969 ms 178228 KB Output is correct
126 Correct 1046 ms 178200 KB Output is correct