oj.uz

Submission #966263

# Submission time Handle Problem Language Result Execution time Memory
966263 2024-04-19T15:40:20 Z A7med_Mousa Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1417 ms 415300 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <cassert>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
vector<int>val;
bool comp(int &a, int &b){
    return val[a] > val[b];
}


void solve(){
    int n, m, q; cin >> n >> m >> q;
    vector<int>adj[n];
    for (int i = 0 ; i < m; ++i){
        int u, v; cin >> u >> v;
        --u, --v;
        adj[v].emplace_back(u);
    }
    vector<int>vis(n);
    val.resize(n);

    int sq = sqrt(n);
    vector<vector<pair<int ,int>>>dp(n);
    for (int node = 0; node < n; ++node){
        vector<int>cur;
        cur.emplace_back(node);
        val[node] = 0;
        vis[node] = node;
        for (int &child : adj[node]){
            for (auto &[value , cur_node] : dp[child]){
                if (vis[cur_node] != node){
                    vis[cur_node] = node;
                    val[cur_node] = value + 1;
                    cur.emplace_back(cur_node);
                }
                else
                    val[cur_node] = max(val[cur_node], value + 1);
            }
        }
        sort(cur.begin(), cur.end(),comp);
        int sz = (int) cur.size();
        for (int i = 0; i < min(sz, sq); ++i)
            dp[node].emplace_back(make_pair(val[cur[i]], cur[i]));
    }
    vector<int>take(n);
    for (int i = 1; i <= q; ++i){
        int node; cin >> node;
        --node;
        int total; cin >> total;
        int y = total;
        while(total--){
            int x; cin >> x;
            --x;
            take[x] = i;
        }
        total = y;
        if (total >= sq){
            vector<int>dp1(n, -1);
            dp1[node] = 0;
            int ans = (take[node] == i ? -1 : 0);
            for (int j = node; j >= 0; --j){
                if (take[j] != i)
                    ans = max(ans, dp1[j]);
                for (int &child : adj[j])
                    dp1[child] = max(dp1[child], dp1[j] + (dp1[j] != -1));
            }
            cout << ans << '\n';
        }
        else {
            bool x = 1;
            for (auto &[val, cur_node] : dp[node])
                if (take[cur_node] != i){
                    cout << val << '\n';
                    x = 0;
                    break;
                }
                if (x)
                    cout << -1 << '\n';
        }
    }
}

int main()
{
    fast;
    int t = 1; //cin >> t;
    for (int i = 1 ; i <= t; ++i){
        solve();
        if (i != t)
            cout << '\n';
    }
    return 0;
}

Compilation message

bitaro.cpp: In function 'void solve()':
bitaro.cpp:34:24: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |             for (auto &[value , cur_node] : dp[child]){
      |                        ^
bitaro.cpp:75:24: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   75 |             for (auto &[val, cur_node] : dp[node])
      |                        ^
bitaro.cpp:75:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   75 |             for (auto &[val, cur_node] : dp[node])
      |             ^~~
bitaro.cpp:81:17: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   81 |                 if (x)
      |                 ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 728 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 772 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 728 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 772 KB Output is correct
20 Correct 31 ms 3348 KB Output is correct
21 Correct 31 ms 3136 KB Output is correct
22 Correct 31 ms 3164 KB Output is correct
23 Correct 39 ms 3408 KB Output is correct
24 Correct 1129 ms 255880 KB Output is correct
25 Correct 1134 ms 267236 KB Output is correct
26 Correct 1119 ms 266316 KB Output is correct
27 Correct 1179 ms 414408 KB Output is correct
28 Correct 1193 ms 414008 KB Output is correct
29 Correct 1156 ms 414148 KB Output is correct
30 Correct 1260 ms 413612 KB Output is correct
31 Correct 1267 ms 399180 KB Output is correct
32 Correct 1244 ms 413492 KB Output is correct
33 Correct 987 ms 256176 KB Output is correct
34 Correct 981 ms 209924 KB Output is correct
35 Correct 951 ms 254288 KB Output is correct
36 Correct 1191 ms 334952 KB Output is correct
37 Correct 1183 ms 303444 KB Output is correct
38 Correct 1137 ms 335920 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 728 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 772 KB Output is correct
20 Correct 31 ms 3348 KB Output is correct
21 Correct 31 ms 3136 KB Output is correct
22 Correct 31 ms 3164 KB Output is correct
23 Correct 39 ms 3408 KB Output is correct
24 Correct 1129 ms 255880 KB Output is correct
25 Correct 1134 ms 267236 KB Output is correct
26 Correct 1119 ms 266316 KB Output is correct
27 Correct 1179 ms 414408 KB Output is correct
28 Correct 1193 ms 414008 KB Output is correct
29 Correct 1156 ms 414148 KB Output is correct
30 Correct 1260 ms 413612 KB Output is correct
31 Correct 1267 ms 399180 KB Output is correct
32 Correct 1244 ms 413492 KB Output is correct
33 Correct 987 ms 256176 KB Output is correct
34 Correct 981 ms 209924 KB Output is correct
35 Correct 951 ms 254288 KB Output is correct
36 Correct 1191 ms 334952 KB Output is correct
37 Correct 1183 ms 303444 KB Output is correct
38 Correct 1137 ms 335920 KB Output is correct
39 Correct 1162 ms 259908 KB Output is correct
40 Correct 1131 ms 261916 KB Output is correct
41 Correct 1110 ms 264532 KB Output is correct
42 Correct 1181 ms 262784 KB Output is correct
43 Correct 1129 ms 261908 KB Output is correct
44 Correct 51 ms 4688 KB Output is correct
45 Correct 39 ms 3648 KB Output is correct
46 Correct 145 ms 3668 KB Output is correct
47 Correct 44 ms 3416 KB Output is correct
48 Correct 39 ms 3412 KB Output is correct
49 Correct 1186 ms 414960 KB Output is correct
50 Correct 1129 ms 413664 KB Output is correct
51 Correct 50 ms 4432 KB Output is correct
52 Correct 147 ms 3668 KB Output is correct
53 Correct 1209 ms 334224 KB Output is correct
54 Correct 1216 ms 304452 KB Output is correct
55 Correct 1152 ms 333784 KB Output is correct
56 Correct 1202 ms 304276 KB Output is correct
57 Correct 50 ms 4432 KB Output is correct
58 Correct 50 ms 4312 KB Output is correct
59 Correct 165 ms 3668 KB Output is correct
60 Correct 149 ms 3668 KB Output is correct
61 Correct 1184 ms 414152 KB Output is correct
62 Correct 1290 ms 335252 KB Output is correct
63 Correct 1204 ms 302940 KB Output is correct
64 Correct 1306 ms 414312 KB Output is correct
65 Correct 1224 ms 333944 KB Output is correct
66 Correct 1417 ms 304588 KB Output is correct
67 Correct 1109 ms 413880 KB Output is correct
68 Correct 1145 ms 334808 KB Output is correct
69 Correct 1139 ms 300224 KB Output is correct
70 Correct 1138 ms 414608 KB Output is correct
71 Correct 1155 ms 335456 KB Output is correct
72 Correct 1228 ms 304072 KB Output is correct
73 Correct 1154 ms 414128 KB Output is correct
74 Correct 1150 ms 335308 KB Output is correct
75 Correct 1162 ms 303992 KB Output is correct
76 Correct 1172 ms 415300 KB Output is correct
77 Correct 1112 ms 414220 KB Output is correct
78 Correct 1116 ms 414344 KB Output is correct
79 Correct 51 ms 4692 KB Output is correct
80 Correct 123 ms 3776 KB Output is correct
81 Correct 32 ms 3312 KB Output is correct
82 Correct 1224 ms 414648 KB Output is correct
83 Correct 1301 ms 400360 KB Output is correct
84 Correct 1204 ms 413280 KB Output is correct
85 Correct 1289 ms 398864 KB Output is correct
86 Correct 1219 ms 413924 KB Output is correct
87 Correct 1286 ms 400044 KB Output is correct
88 Correct 55 ms 4688 KB Output is correct
89 Correct 51 ms 4580 KB Output is correct
90 Correct 137 ms 3676 KB Output is correct
91 Correct 136 ms 3700 KB Output is correct
92 Correct 33 ms 3276 KB Output is correct
93 Correct 33 ms 3324 KB Output is correct
94 Correct 942 ms 257104 KB Output is correct
95 Correct 1010 ms 209748 KB Output is correct
96 Correct 917 ms 254800 KB Output is correct
97 Correct 1010 ms 213080 KB Output is correct
98 Correct 930 ms 256128 KB Output is correct
99 Correct 975 ms 212476 KB Output is correct
100 Correct 52 ms 4688 KB Output is correct
101 Correct 53 ms 4648 KB Output is correct
102 Correct 101 ms 3840 KB Output is correct
103 Correct 101 ms 3664 KB Output is correct
104 Correct 32 ms 3404 KB Output is correct
105 Correct 32 ms 3440 KB Output is correct
106 Correct 1161 ms 334856 KB Output is correct
107 Correct 1209 ms 304804 KB Output is correct
108 Correct 1127 ms 336076 KB Output is correct
109 Correct 1166 ms 303080 KB Output is correct
110 Correct 1133 ms 336620 KB Output is correct
111 Correct 1194 ms 304528 KB Output is correct
112 Correct 56 ms 4688 KB Output is correct
113 Correct 52 ms 4692 KB Output is correct
114 Correct 124 ms 3700 KB Output is correct
115 Correct 127 ms 3756 KB Output is correct
116 Correct 36 ms 3340 KB Output is correct
117 Correct 36 ms 3368 KB Output is correct
118 Correct 1114 ms 413856 KB Output is correct
119 Correct 1117 ms 335720 KB Output is correct
120 Correct 1162 ms 302912 KB Output is correct
121 Correct 1108 ms 413840 KB Output is correct
122 Correct 1140 ms 334076 KB Output is correct
123 Correct 1158 ms 302956 KB Output is correct
124 Correct 1108 ms 413608 KB Output is correct
125 Correct 1134 ms 335920 KB Output is correct
126 Correct 1147 ms 301892 KB Output is correct