oj.uz

Submission #233441

# Submission time Handle Problem Language Result Execution time Memory
233441 2020-05-20T14:23:59 Z DS007 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1924 ms 414328 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5;
int n, m, q;
vector<int> adj[N];
vector<pair<int, int>> far[N];

void pre() {
    bool allowed[n];
    fill(allowed, allowed + n, true);

    for (int i = 0; i < n; i++) {
        int p[adj[i].size()] = {};
        int count = 0;
        vector<int> used;

        while (count <= ceil(sqrt(n)) + 1) {
            pair<pair<int, int>, int> ans = {{-1, -1}, - 1};
            for (int j = 0; j < adj[i].size(); j++) {
                while (p[j] < far[adj[i][j]].size() && !allowed[far[adj[i][j]][p[j]].second])
                    p[j]++;
                if (p[j] < far[adj[i][j]].size() && ans.first < far[adj[i][j]][p[j]] && allowed[far[adj[i][j]][p[j]].second])
                    ans = {far[adj[i][j]][p[j]], j};
            }

            if (ans.first.first != -1) {
                far[i].emplace_back(ans.first.first + 1, ans.first.second);
                p[ans.second]++;
                allowed[ans.first.second] = false;
                used.push_back(ans.first.second);
                count++;
            } else break;
        }

        for (int j : used)
            allowed[j] = true;

        if (far[i].size() <= ceil(sqrt(n)))
            far[i].emplace_back(0, i);
    }
}

int calc(int t, const set<int>& c) {
    int dp[n] = {};
    fill(dp, dp + n, -1e9);
    dp[t] = 0;

    for (int i = t; i >= 0; i--) {
        for (int j : adj[i])
            dp[j] = max(dp[j], dp[i] + 1);
    }

    int ans = -1;
    for (int i = t; i >= 0; i--) {
        if (!c.count(i))
            ans = max(ans, dp[i]);
    }

    return ans;
}

int find(int t, const set<int>& c) {
    for (auto i : far[t]) {
        if (!c.count(i.second))
            return i.first;
    }
    return -1;
}

int solveTestCase(int test) {
    cin >> n >> m >> q;
    for (int i = 0; i < m; i++) {
        int s = 0, e = 0;
        cin >> s >> e;
        s--, e--;
        adj[e].push_back(s);
    }

    pre();

    for (int i = 0; i < q; i++) {
        int t = 0, y = 0;
        cin >> t >> y;

        set<int> c;
        for (int j = 0; j < y; j++) {
            int temp = 0;
            cin >> temp;
            c.insert(temp - 1);
        }

        if (y >= floor(sqrt(n)) - 1)
            cout << calc(t - 1, c) << "\n";
        else
            cout << find(t - 1, c) << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int test = 1;
    //cin >> test;
    for (int i = 1; i <= test; i++)
        solveTestCase(i);
}

Compilation message

bitaro.cpp: In function 'void pre()':
bitaro.cpp:20:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int j = 0; j < adj[i].size(); j++) {
                             ~~^~~~~~~~~~~~~~~
bitaro.cpp:21:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while (p[j] < far[adj[i][j]].size() && !allowed[far[adj[i][j]][p[j]].second])
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:23:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (p[j] < far[adj[i][j]].size() && ans.first < far[adj[i][j]][p[j]] && allowed[far[adj[i][j]][p[j]].second])
                     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp: In function 'int solveTestCase(int)':
bitaro.cpp:98:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 9 ms 5376 KB Output is correct
6 Correct 9 ms 5376 KB Output is correct
7 Correct 10 ms 5376 KB Output is correct
8 Correct 10 ms 5632 KB Output is correct
9 Correct 10 ms 5680 KB Output is correct
10 Correct 10 ms 5632 KB Output is correct
11 Correct 10 ms 5632 KB Output is correct
12 Correct 10 ms 5504 KB Output is correct
13 Correct 10 ms 5760 KB Output is correct
14 Correct 9 ms 5248 KB Output is correct
15 Correct 9 ms 5376 KB Output is correct
16 Correct 9 ms 5376 KB Output is correct
17 Correct 10 ms 5504 KB Output is correct
18 Correct 10 ms 5376 KB Output is correct
19 Correct 10 ms 5504 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 9 ms 5376 KB Output is correct
6 Correct 9 ms 5376 KB Output is correct
7 Correct 10 ms 5376 KB Output is correct
8 Correct 10 ms 5632 KB Output is correct
9 Correct 10 ms 5680 KB Output is correct
10 Correct 10 ms 5632 KB Output is correct
11 Correct 10 ms 5632 KB Output is correct
12 Correct 10 ms 5504 KB Output is correct
13 Correct 10 ms 5760 KB Output is correct
14 Correct 9 ms 5248 KB Output is correct
15 Correct 9 ms 5376 KB Output is correct
16 Correct 9 ms 5376 KB Output is correct
17 Correct 10 ms 5504 KB Output is correct
18 Correct 10 ms 5376 KB Output is correct
19 Correct 10 ms 5504 KB Output is correct
20 Correct 76 ms 6648 KB Output is correct
21 Correct 90 ms 6648 KB Output is correct
22 Correct 80 ms 6648 KB Output is correct
23 Correct 78 ms 6648 KB Output is correct
24 Correct 1152 ms 251896 KB Output is correct
25 Correct 1187 ms 263032 KB Output is correct
26 Correct 1159 ms 262652 KB Output is correct
27 Correct 1395 ms 412868 KB Output is correct
28 Correct 1405 ms 412684 KB Output is correct
29 Correct 1408 ms 412848 KB Output is correct
30 Correct 1389 ms 412408 KB Output is correct
31 Correct 1461 ms 397616 KB Output is correct
32 Correct 1432 ms 412280 KB Output is correct
33 Correct 977 ms 254712 KB Output is correct
34 Correct 846 ms 208504 KB Output is correct
35 Correct 958 ms 252920 KB Output is correct
36 Correct 1237 ms 333560 KB Output is correct
37 Correct 1206 ms 301952 KB Output is correct
38 Correct 1203 ms 334576 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 7 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 9 ms 5376 KB Output is correct
6 Correct 9 ms 5376 KB Output is correct
7 Correct 10 ms 5376 KB Output is correct
8 Correct 10 ms 5632 KB Output is correct
9 Correct 10 ms 5680 KB Output is correct
10 Correct 10 ms 5632 KB Output is correct
11 Correct 10 ms 5632 KB Output is correct
12 Correct 10 ms 5504 KB Output is correct
13 Correct 10 ms 5760 KB Output is correct
14 Correct 9 ms 5248 KB Output is correct
15 Correct 9 ms 5376 KB Output is correct
16 Correct 9 ms 5376 KB Output is correct
17 Correct 10 ms 5504 KB Output is correct
18 Correct 10 ms 5376 KB Output is correct
19 Correct 10 ms 5504 KB Output is correct
20 Correct 76 ms 6648 KB Output is correct
21 Correct 90 ms 6648 KB Output is correct
22 Correct 80 ms 6648 KB Output is correct
23 Correct 78 ms 6648 KB Output is correct
24 Correct 1152 ms 251896 KB Output is correct
25 Correct 1187 ms 263032 KB Output is correct
26 Correct 1159 ms 262652 KB Output is correct
27 Correct 1395 ms 412868 KB Output is correct
28 Correct 1405 ms 412684 KB Output is correct
29 Correct 1408 ms 412848 KB Output is correct
30 Correct 1389 ms 412408 KB Output is correct
31 Correct 1461 ms 397616 KB Output is correct
32 Correct 1432 ms 412280 KB Output is correct
33 Correct 977 ms 254712 KB Output is correct
34 Correct 846 ms 208504 KB Output is correct
35 Correct 958 ms 252920 KB Output is correct
36 Correct 1237 ms 333560 KB Output is correct
37 Correct 1206 ms 301952 KB Output is correct
38 Correct 1203 ms 334576 KB Output is correct
39 Correct 1206 ms 254456 KB Output is correct
40 Correct 1161 ms 256760 KB Output is correct
41 Correct 1154 ms 259580 KB Output is correct
42 Correct 1353 ms 257508 KB Output is correct
43 Correct 1214 ms 257104 KB Output is correct
44 Correct 119 ms 7032 KB Output is correct
45 Correct 98 ms 6648 KB Output is correct
46 Correct 428 ms 6648 KB Output is correct
47 Correct 123 ms 6648 KB Output is correct
48 Correct 86 ms 6648 KB Output is correct
49 Correct 1492 ms 410744 KB Output is correct
50 Correct 1404 ms 410232 KB Output is correct
51 Correct 119 ms 6904 KB Output is correct
52 Correct 412 ms 6624 KB Output is correct
53 Correct 1277 ms 329852 KB Output is correct
54 Correct 1257 ms 303352 KB Output is correct
55 Correct 1217 ms 332664 KB Output is correct
56 Correct 1224 ms 302968 KB Output is correct
57 Correct 119 ms 9336 KB Output is correct
58 Correct 122 ms 9336 KB Output is correct
59 Correct 434 ms 8568 KB Output is correct
60 Correct 416 ms 8440 KB Output is correct
61 Correct 1611 ms 413304 KB Output is correct
62 Correct 1446 ms 334328 KB Output is correct
63 Correct 1434 ms 301688 KB Output is correct
64 Correct 1924 ms 413176 KB Output is correct
65 Correct 1709 ms 332744 KB Output is correct
66 Correct 1744 ms 303608 KB Output is correct
67 Correct 1442 ms 412808 KB Output is correct
68 Correct 1269 ms 333944 KB Output is correct
69 Correct 1196 ms 299256 KB Output is correct
70 Correct 1498 ms 413768 KB Output is correct
71 Correct 1312 ms 334844 KB Output is correct
72 Correct 1335 ms 303340 KB Output is correct
73 Correct 1501 ms 413304 KB Output is correct
74 Correct 1309 ms 334428 KB Output is correct
75 Correct 1274 ms 303080 KB Output is correct
76 Correct 1508 ms 414328 KB Output is correct
77 Correct 1465 ms 413048 KB Output is correct
78 Correct 1496 ms 413944 KB Output is correct
79 Correct 118 ms 9464 KB Output is correct
80 Correct 373 ms 8696 KB Output is correct
81 Correct 86 ms 8188 KB Output is correct
82 Correct 1533 ms 413688 KB Output is correct
83 Correct 1535 ms 399352 KB Output is correct
84 Correct 1383 ms 412280 KB Output is correct
85 Correct 1471 ms 397944 KB Output is correct
86 Correct 1449 ms 413548 KB Output is correct
87 Correct 1515 ms 399608 KB Output is correct
88 Correct 117 ms 9464 KB Output is correct
89 Correct 123 ms 9548 KB Output is correct
90 Correct 379 ms 8568 KB Output is correct
91 Correct 380 ms 8696 KB Output is correct
92 Correct 85 ms 8184 KB Output is correct
93 Correct 85 ms 8108 KB Output is correct
94 Correct 1054 ms 256248 KB Output is correct
95 Correct 952 ms 208888 KB Output is correct
96 Correct 984 ms 253776 KB Output is correct
97 Correct 876 ms 211832 KB Output is correct
98 Correct 1048 ms 255992 KB Output is correct
99 Correct 885 ms 212260 KB Output is correct
100 Correct 116 ms 9592 KB Output is correct
101 Correct 126 ms 9524 KB Output is correct
102 Correct 286 ms 8696 KB Output is correct
103 Correct 294 ms 8568 KB Output is correct
104 Correct 84 ms 8312 KB Output is correct
105 Correct 94 ms 8184 KB Output is correct
106 Correct 1293 ms 333944 KB Output is correct
107 Correct 1271 ms 303820 KB Output is correct
108 Correct 1201 ms 334968 KB Output is correct
109 Correct 1188 ms 302328 KB Output is correct
110 Correct 1280 ms 336196 KB Output is correct
111 Correct 1228 ms 304504 KB Output is correct
112 Correct 118 ms 9468 KB Output is correct
113 Correct 116 ms 9548 KB Output is correct
114 Correct 364 ms 8568 KB Output is correct
115 Correct 382 ms 8568 KB Output is correct
116 Correct 79 ms 8184 KB Output is correct
117 Correct 83 ms 8184 KB Output is correct
118 Correct 1397 ms 412664 KB Output is correct
119 Correct 1248 ms 334608 KB Output is correct
120 Correct 1232 ms 301952 KB Output is correct
121 Correct 1461 ms 412732 KB Output is correct
122 Correct 1267 ms 333040 KB Output is correct
123 Correct 1236 ms 302200 KB Output is correct
124 Correct 1411 ms 412664 KB Output is correct
125 Correct 1250 ms 334840 KB Output is correct
126 Correct 1237 ms 301048 KB Output is correct