oj.uz

Submission #117576

# Submission time Handle Problem Language Result Execution time Memory
117576 2019-06-16T15:59:24 Z PeppaPig Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1442 ms 415692 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 1e5+5;
const int B = 320;

int n, m, q;
vector<int> g[N];

int dp[N], chk[N];

void bruteforce(vector<int>& block) {
    fill_n(dp, N, -1e9);
    for(int i : block) chk[i] = 1;
    for(int u = 1; u <= n; u++) {
        if(!chk[u]) dp[u] = max(dp[u], 0);
        if(dp[u] == -1e9) continue;
        for(int v : g[u]) dp[v] = max(dp[v], dp[u] + 1);
    }
    for(int i : block) chk[i] = 0;
}

int mx[N];
pii ret[N];
vector<pii> pre[N];

void pre_process() {
    fill_n(mx, N, -1);
    for(int i = 1; i <= n; i++) pre[i].emplace_back(0, i);

    for(int u = 1; u <= n; u++) for(int v : g[u]) {
        for(pii p : pre[u]) mx[p.y] = max(mx[p.y], p.x + 1);
        for(pii p : pre[v]) mx[p.y] = max(mx[p.y], p.x);

        int l = 0, r = 0, ptr = 0;
        while(l < pre[u].size() && r < pre[v].size()) {
            pii a = pii(pre[u][l].x + 1, pre[u][l].y), b = pre[v][r];
            if(a > b) ret[++ptr] = a, l++;
            else ret[++ptr] = b, r++;
        }
        while(l < pre[u].size()) {
            pii a = pii(pre[u][l].x + 1, pre[u][l].y);
            ret[++ptr] = a, l++;
        }
        while(r < pre[v].size()) {
            pii b = pre[v][r];
            ret[++ptr] = b, r++;
        }
        pre[v].clear();
        for(int i = 1; i <= ptr; i++) if(ret[i].x == mx[ret[i].y]) {
            mx[ret[i].y] = -1;
            pre[v].emplace_back(ret[i]);
        }
        while(pre[v].size() > B) pre[v].pop_back();
    }
}

int main() {
    scanf("%d %d %d", &n, &m, &q);
    for(int i = 1, a, b; i <= m; i++) {
        scanf("%d %d", &a, &b);
        g[a].emplace_back(b);
    }
    pre_process();
    for(int x = 1, t, y; x <= q; x++) {
        vector<int> block;
        scanf("%d %d", &t, &y);
        for(int i = 1, a; i <= y; i++) {
            scanf("%d", &a);
            block.emplace_back(a);
        }
        if(y >= B) {
            bruteforce(block);
            if(dp[t] == -1e9) printf("-1\n");
            else printf("%d\n", dp[t]);
        } else {
            bool valid = false;
            for(int i : block) chk[i] = 1;
            for(pii p : pre[t]) if(!chk[p.y]) {
                printf("%d\n", p.x);
                valid = true;
                break;
            }
            if(!valid) printf("-1\n");
            for(int i : block) chk[i] = 0;
        }
    }    

    return 0;
}

Compilation message

bitaro.cpp: In function 'void pre_process()':
bitaro.cpp:41:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(l < pre[u].size() && r < pre[v].size()) {
               ~~^~~~~~~~~~~~~~~
bitaro.cpp:41:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(l < pre[u].size() && r < pre[v].size()) {
                                    ~~^~~~~~~~~~~~~~~
bitaro.cpp:46:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(l < pre[u].size()) {
               ~~^~~~~~~~~~~~~~~
bitaro.cpp:50:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(r < pre[v].size()) {
               ~~^~~~~~~~~~~~~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:64: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:66:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:72:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &t, &y);
         ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:74:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &a);
             ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5504 KB Output is correct
2 Correct 5 ms 5376 KB Output is correct
3 Correct 6 ms 5376 KB Output is correct
4 Correct 7 ms 5504 KB Output is correct
5 Correct 9 ms 6400 KB Output is correct
6 Correct 9 ms 6400 KB Output is correct
7 Correct 9 ms 6272 KB Output is correct
8 Correct 14 ms 9472 KB Output is correct
9 Correct 13 ms 9472 KB Output is correct
10 Correct 14 ms 9472 KB Output is correct
11 Correct 14 ms 9088 KB Output is correct
12 Correct 10 ms 7296 KB Output is correct
13 Correct 15 ms 8832 KB Output is correct
14 Correct 12 ms 7936 KB Output is correct
15 Correct 10 ms 6780 KB Output is correct
16 Correct 12 ms 7808 KB Output is correct
17 Correct 13 ms 8192 KB Output is correct
18 Correct 10 ms 7032 KB Output is correct
19 Correct 12 ms 8064 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5504 KB Output is correct
2 Correct 5 ms 5376 KB Output is correct
3 Correct 6 ms 5376 KB Output is correct
4 Correct 7 ms 5504 KB Output is correct
5 Correct 9 ms 6400 KB Output is correct
6 Correct 9 ms 6400 KB Output is correct
7 Correct 9 ms 6272 KB Output is correct
8 Correct 14 ms 9472 KB Output is correct
9 Correct 13 ms 9472 KB Output is correct
10 Correct 14 ms 9472 KB Output is correct
11 Correct 14 ms 9088 KB Output is correct
12 Correct 10 ms 7296 KB Output is correct
13 Correct 15 ms 8832 KB Output is correct
14 Correct 12 ms 7936 KB Output is correct
15 Correct 10 ms 6780 KB Output is correct
16 Correct 12 ms 7808 KB Output is correct
17 Correct 13 ms 8192 KB Output is correct
18 Correct 10 ms 7032 KB Output is correct
19 Correct 12 ms 8064 KB Output is correct
20 Correct 491 ms 10772 KB Output is correct
21 Correct 453 ms 10828 KB Output is correct
22 Correct 495 ms 10816 KB Output is correct
23 Correct 622 ms 10872 KB Output is correct
24 Correct 1328 ms 257772 KB Output is correct
25 Correct 1098 ms 269172 KB Output is correct
26 Correct 1123 ms 268888 KB Output is correct
27 Correct 1111 ms 412156 KB Output is correct
28 Correct 1118 ms 412124 KB Output is correct
29 Correct 1125 ms 411980 KB Output is correct
30 Correct 1111 ms 411352 KB Output is correct
31 Correct 1232 ms 400608 KB Output is correct
32 Correct 1098 ms 411136 KB Output is correct
33 Correct 798 ms 256380 KB Output is correct
34 Correct 828 ms 273400 KB Output is correct
35 Correct 797 ms 254348 KB Output is correct
36 Correct 971 ms 335832 KB Output is correct
37 Correct 1117 ms 305908 KB Output is correct
38 Correct 1006 ms 336892 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5504 KB Output is correct
2 Correct 5 ms 5376 KB Output is correct
3 Correct 6 ms 5376 KB Output is correct
4 Correct 7 ms 5504 KB Output is correct
5 Correct 9 ms 6400 KB Output is correct
6 Correct 9 ms 6400 KB Output is correct
7 Correct 9 ms 6272 KB Output is correct
8 Correct 14 ms 9472 KB Output is correct
9 Correct 13 ms 9472 KB Output is correct
10 Correct 14 ms 9472 KB Output is correct
11 Correct 14 ms 9088 KB Output is correct
12 Correct 10 ms 7296 KB Output is correct
13 Correct 15 ms 8832 KB Output is correct
14 Correct 12 ms 7936 KB Output is correct
15 Correct 10 ms 6780 KB Output is correct
16 Correct 12 ms 7808 KB Output is correct
17 Correct 13 ms 8192 KB Output is correct
18 Correct 10 ms 7032 KB Output is correct
19 Correct 12 ms 8064 KB Output is correct
20 Correct 491 ms 10772 KB Output is correct
21 Correct 453 ms 10828 KB Output is correct
22 Correct 495 ms 10816 KB Output is correct
23 Correct 622 ms 10872 KB Output is correct
24 Correct 1328 ms 257772 KB Output is correct
25 Correct 1098 ms 269172 KB Output is correct
26 Correct 1123 ms 268888 KB Output is correct
27 Correct 1111 ms 412156 KB Output is correct
28 Correct 1118 ms 412124 KB Output is correct
29 Correct 1125 ms 411980 KB Output is correct
30 Correct 1111 ms 411352 KB Output is correct
31 Correct 1232 ms 400608 KB Output is correct
32 Correct 1098 ms 411136 KB Output is correct
33 Correct 798 ms 256380 KB Output is correct
34 Correct 828 ms 273400 KB Output is correct
35 Correct 797 ms 254348 KB Output is correct
36 Correct 971 ms 335832 KB Output is correct
37 Correct 1117 ms 305908 KB Output is correct
38 Correct 1006 ms 336892 KB Output is correct
39 Correct 1132 ms 261140 KB Output is correct
40 Correct 1094 ms 262652 KB Output is correct
41 Correct 1227 ms 266132 KB Output is correct
42 Correct 1344 ms 264056 KB Output is correct
43 Correct 1129 ms 263780 KB Output is correct
44 Correct 595 ms 10872 KB Output is correct
45 Correct 509 ms 10616 KB Output is correct
46 Correct 523 ms 10360 KB Output is correct
47 Correct 513 ms 10744 KB Output is correct
48 Correct 485 ms 10744 KB Output is correct
49 Correct 1199 ms 411604 KB Output is correct
50 Correct 1097 ms 411128 KB Output is correct
51 Correct 516 ms 10852 KB Output is correct
52 Correct 474 ms 10576 KB Output is correct
53 Correct 1112 ms 333788 KB Output is correct
54 Correct 1120 ms 305656 KB Output is correct
55 Correct 995 ms 333944 KB Output is correct
56 Correct 1050 ms 306220 KB Output is correct
57 Correct 516 ms 10928 KB Output is correct
58 Correct 516 ms 10744 KB Output is correct
59 Correct 474 ms 10332 KB Output is correct
60 Correct 510 ms 10384 KB Output is correct
61 Correct 1273 ms 411512 KB Output is correct
62 Correct 1119 ms 338260 KB Output is correct
63 Correct 1166 ms 307292 KB Output is correct
64 Correct 1442 ms 414228 KB Output is correct
65 Correct 1321 ms 337004 KB Output is correct
66 Correct 1307 ms 309436 KB Output is correct
67 Correct 1134 ms 413688 KB Output is correct
68 Correct 1031 ms 337972 KB Output is correct
69 Correct 1042 ms 304964 KB Output is correct
70 Correct 1155 ms 414460 KB Output is correct
71 Correct 1162 ms 338396 KB Output is correct
72 Correct 1087 ms 308856 KB Output is correct
73 Correct 1187 ms 414296 KB Output is correct
74 Correct 1087 ms 338260 KB Output is correct
75 Correct 1102 ms 308760 KB Output is correct
76 Correct 1282 ms 415692 KB Output is correct
77 Correct 1102 ms 414328 KB Output is correct
78 Correct 1247 ms 415088 KB Output is correct
79 Correct 486 ms 13304 KB Output is correct
80 Correct 444 ms 12376 KB Output is correct
81 Correct 446 ms 12320 KB Output is correct
82 Correct 1183 ms 414840 KB Output is correct
83 Correct 1321 ms 403936 KB Output is correct
84 Correct 1096 ms 413444 KB Output is correct
85 Correct 1269 ms 402480 KB Output is correct
86 Correct 1177 ms 413988 KB Output is correct
87 Correct 1302 ms 403872 KB Output is correct
88 Correct 527 ms 13304 KB Output is correct
89 Correct 511 ms 13304 KB Output is correct
90 Correct 568 ms 12380 KB Output is correct
91 Correct 488 ms 12408 KB Output is correct
92 Correct 496 ms 12420 KB Output is correct
93 Correct 513 ms 12280 KB Output is correct
94 Correct 1018 ms 259804 KB Output is correct
95 Correct 956 ms 287344 KB Output is correct
96 Correct 823 ms 257244 KB Output is correct
97 Correct 888 ms 288252 KB Output is correct
98 Correct 818 ms 258744 KB Output is correct
99 Correct 910 ms 286192 KB Output is correct
100 Correct 682 ms 13300 KB Output is correct
101 Correct 641 ms 13324 KB Output is correct
102 Correct 638 ms 12424 KB Output is correct
103 Correct 671 ms 12408 KB Output is correct
104 Correct 736 ms 12372 KB Output is correct
105 Correct 648 ms 12356 KB Output is correct
106 Correct 1073 ms 338232 KB Output is correct
107 Correct 1122 ms 309812 KB Output is correct
108 Correct 1002 ms 339272 KB Output is correct
109 Correct 990 ms 308216 KB Output is correct
110 Correct 1071 ms 339912 KB Output is correct
111 Correct 1095 ms 310076 KB Output is correct
112 Correct 571 ms 13432 KB Output is correct
113 Correct 742 ms 13320 KB Output is correct
114 Correct 489 ms 12220 KB Output is correct
115 Correct 500 ms 12332 KB Output is correct
116 Correct 476 ms 12316 KB Output is correct
117 Correct 477 ms 12340 KB Output is correct
118 Correct 1079 ms 413624 KB Output is correct
119 Correct 982 ms 338268 KB Output is correct
120 Correct 1000 ms 307604 KB Output is correct
121 Correct 1111 ms 413708 KB Output is correct
122 Correct 984 ms 337144 KB Output is correct
123 Correct 1098 ms 307676 KB Output is correct
124 Correct 1143 ms 413816 KB Output is correct
125 Correct 1027 ms 338680 KB Output is correct
126 Correct 1065 ms 306644 KB Output is correct