oj.uz

Submission #160444

# Submission time Handle Problem Language Result Execution time Memory
160444 2019-10-27T14:00:10 Z combi1k1 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1901 ms 416936 KB 
#include<bits/stdc++.h>

using namespace std;

#define X   first
#define Y   second
#define pb  push_back
#define ii  pair<int,int>

#define FOR(i,a,b)  for(int i = a ; i < b ; ++i)

const int   N   = 1e5 + 1;
const int   B   = 317;

vector<int> g[N];
vector<ii>  opt[N];

int vis[N];
int ban[N];
int len[N];
int tot = 1;

void pus(int u,int v)  {
    int a = 0;
    int b = 0;

    for(ii &e : opt[v]) e.X++;

    vector<ii>  clone;

    auto add = [&](ii  e)   {
        if (vis[e.Y] != tot)
            vis[e.Y]  = tot,
            clone.pb(e);
    };

    while (a < opt[u].size() && b < opt[v].size())  {
        if (opt[u][a] < opt[v][b])  {   add(opt[v][b++]);   continue;   }
        if (opt[u][a] > opt[v][b])  {   add(opt[u][a++]);   continue;   }

        clone.pb(opt[u][a]);
        a++;
        b++;
    }
    while (a < opt[u].size())   add(opt[u][a++]);
    while (b < opt[v].size())   add(opt[v][b++]);

    while (clone.size() > B)    clone.pop_back();

    for(ii &e : opt[v]) e.X--;

    opt[u].swap(clone);
}

int dfs(int u)  {
    if (vis[u]) return  0;

    vis[u] = 1;
    opt[u].pb(ii(0,u));

    for(int v : g[u])  {
        dfs(v); tot++;
        pus(u,v);
    }
}
int cal(int u)  {
    if (vis[u]) return  len[u];

    len[u] = (ban[u] ? -N : 0);
    vis[u] = 1;

    for(int v : g[u])
        len[u] = max(len[u],cal(v) + 1);

    return  len[u];
}

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;  cin >> n;
    int m;  cin >> m;
    int q;  cin >> q;

    FOR(i,0,m)  {
        int x;  cin >> x;
        int y;  cin >> y;
        g[y].pb(x);
    }
    FOR(i,1,n + 1)  if(!vis[i]) dfs(i);
    FOR(i,1,q + 1)  {
        int u;  cin >> u;
        int k;  cin >> k;

        vector<int> vv;

        FOR(i,0,k)  {
            int x;  cin >> x;
            ban[x] = 1;
            vv.pb(x);
        }

        int ans = -1;

        if (k < B)  {
            for(ii  e : opt[u])
            if(!ban[e.Y])
                ans = max(ans,e.X);
        }
        else    {
            fill(vis + 1,vis + 1 + n,0);
            ans = max(ans,cal(u));
        }
        for(int x : vv)
            ban[x] = 0;

        cout << ans << "\n";
    }
}
/*
5 6 3
1 2
2 4
3 4
1 3
3 5
4 5
4 1 1
5 2 2 3
2 3 1 4 5
*/

Compilation message

bitaro.cpp: In function 'void pus(int, int)':
bitaro.cpp:37:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (a < opt[u].size() && b < opt[v].size())  {
            ~~^~~~~~~~~~~~~~~
bitaro.cpp:37:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (a < opt[u].size() && b < opt[v].size())  {
                                 ~~^~~~~~~~~~~~~~~
bitaro.cpp:45:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (a < opt[u].size())   add(opt[u][a++]);
            ~~^~~~~~~~~~~~~~~
bitaro.cpp:46:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (b < opt[v].size())   add(opt[v][b++]);
            ~~^~~~~~~~~~~~~~~
bitaro.cpp: In function 'int dfs(int)':
bitaro.cpp:65:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 5624 KB Output is correct
6 Correct 10 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 17 ms 8444 KB Output is correct
9 Correct 17 ms 8444 KB Output is correct
10 Correct 18 ms 8440 KB Output is correct
11 Correct 17 ms 8056 KB Output is correct
12 Correct 13 ms 6392 KB Output is correct
13 Correct 28 ms 7928 KB Output is correct
14 Correct 16 ms 7168 KB Output is correct
15 Correct 13 ms 6008 KB Output is correct
16 Correct 16 ms 7032 KB Output is correct
17 Correct 15 ms 7268 KB Output is correct
18 Correct 29 ms 6264 KB Output is correct
19 Correct 15 ms 7288 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 5624 KB Output is correct
6 Correct 10 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 17 ms 8444 KB Output is correct
9 Correct 17 ms 8444 KB Output is correct
10 Correct 18 ms 8440 KB Output is correct
11 Correct 17 ms 8056 KB Output is correct
12 Correct 13 ms 6392 KB Output is correct
13 Correct 28 ms 7928 KB Output is correct
14 Correct 16 ms 7168 KB Output is correct
15 Correct 13 ms 6008 KB Output is correct
16 Correct 16 ms 7032 KB Output is correct
17 Correct 15 ms 7268 KB Output is correct
18 Correct 29 ms 6264 KB Output is correct
19 Correct 15 ms 7288 KB Output is correct
20 Correct 848 ms 10316 KB Output is correct
21 Correct 845 ms 10276 KB Output is correct
22 Correct 928 ms 10200 KB Output is correct
23 Correct 947 ms 10396 KB Output is correct
24 Correct 1189 ms 253684 KB Output is correct
25 Correct 1261 ms 265716 KB Output is correct
26 Correct 1223 ms 264700 KB Output is correct
27 Correct 1261 ms 414336 KB Output is correct
28 Correct 1252 ms 413972 KB Output is correct
29 Correct 1236 ms 414544 KB Output is correct
30 Correct 1246 ms 411376 KB Output is correct
31 Correct 1382 ms 396596 KB Output is correct
32 Correct 1242 ms 410980 KB Output is correct
33 Correct 976 ms 253092 KB Output is correct
34 Correct 988 ms 240112 KB Output is correct
35 Correct 960 ms 251172 KB Output is correct
36 Correct 1125 ms 331916 KB Output is correct
37 Correct 1147 ms 300720 KB Output is correct
38 Correct 1106 ms 333496 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 5624 KB Output is correct
6 Correct 10 ms 5496 KB Output is correct
7 Correct 10 ms 5496 KB Output is correct
8 Correct 17 ms 8444 KB Output is correct
9 Correct 17 ms 8444 KB Output is correct
10 Correct 18 ms 8440 KB Output is correct
11 Correct 17 ms 8056 KB Output is correct
12 Correct 13 ms 6392 KB Output is correct
13 Correct 28 ms 7928 KB Output is correct
14 Correct 16 ms 7168 KB Output is correct
15 Correct 13 ms 6008 KB Output is correct
16 Correct 16 ms 7032 KB Output is correct
17 Correct 15 ms 7268 KB Output is correct
18 Correct 29 ms 6264 KB Output is correct
19 Correct 15 ms 7288 KB Output is correct
20 Correct 848 ms 10316 KB Output is correct
21 Correct 845 ms 10276 KB Output is correct
22 Correct 928 ms 10200 KB Output is correct
23 Correct 947 ms 10396 KB Output is correct
24 Correct 1189 ms 253684 KB Output is correct
25 Correct 1261 ms 265716 KB Output is correct
26 Correct 1223 ms 264700 KB Output is correct
27 Correct 1261 ms 414336 KB Output is correct
28 Correct 1252 ms 413972 KB Output is correct
29 Correct 1236 ms 414544 KB Output is correct
30 Correct 1246 ms 411376 KB Output is correct
31 Correct 1382 ms 396596 KB Output is correct
32 Correct 1242 ms 410980 KB Output is correct
33 Correct 976 ms 253092 KB Output is correct
34 Correct 988 ms 240112 KB Output is correct
35 Correct 960 ms 251172 KB Output is correct
36 Correct 1125 ms 331916 KB Output is correct
37 Correct 1147 ms 300720 KB Output is correct
38 Correct 1106 ms 333496 KB Output is correct
39 Correct 1401 ms 256208 KB Output is correct
40 Correct 1329 ms 258588 KB Output is correct
41 Correct 1331 ms 261384 KB Output is correct
42 Correct 1324 ms 259612 KB Output is correct
43 Correct 1295 ms 258740 KB Output is correct
44 Correct 931 ms 10748 KB Output is correct
45 Correct 883 ms 10076 KB Output is correct
46 Correct 871 ms 9936 KB Output is correct
47 Correct 874 ms 9976 KB Output is correct
48 Correct 855 ms 9940 KB Output is correct
49 Correct 1546 ms 411236 KB Output is correct
50 Correct 1417 ms 410748 KB Output is correct
51 Correct 882 ms 10360 KB Output is correct
52 Correct 832 ms 9880 KB Output is correct
53 Correct 1403 ms 330504 KB Output is correct
54 Correct 1390 ms 300568 KB Output is correct
55 Correct 1256 ms 330672 KB Output is correct
56 Correct 1318 ms 300920 KB Output is correct
57 Correct 954 ms 10260 KB Output is correct
58 Correct 938 ms 10184 KB Output is correct
59 Correct 843 ms 9848 KB Output is correct
60 Correct 859 ms 10104 KB Output is correct
61 Correct 1777 ms 414320 KB Output is correct
62 Correct 1423 ms 332408 KB Output is correct
63 Correct 1418 ms 299640 KB Output is correct
64 Correct 1901 ms 414176 KB Output is correct
65 Correct 1637 ms 333304 KB Output is correct
66 Correct 1489 ms 303864 KB Output is correct
67 Correct 1407 ms 412956 KB Output is correct
68 Correct 1267 ms 334220 KB Output is correct
69 Correct 1262 ms 299640 KB Output is correct
70 Correct 1424 ms 416376 KB Output is correct
71 Correct 1282 ms 334884 KB Output is correct
72 Correct 1285 ms 303480 KB Output is correct
73 Correct 1479 ms 416632 KB Output is correct
74 Correct 1335 ms 334736 KB Output is correct
75 Correct 1319 ms 303468 KB Output is correct
76 Correct 1545 ms 415084 KB Output is correct
77 Correct 1425 ms 413944 KB Output is correct
78 Correct 1275 ms 416936 KB Output is correct
79 Correct 872 ms 12576 KB Output is correct
80 Correct 826 ms 11620 KB Output is correct
81 Correct 825 ms 11188 KB Output is correct
82 Correct 1595 ms 414400 KB Output is correct
83 Correct 1704 ms 400284 KB Output is correct
84 Correct 1430 ms 413172 KB Output is correct
85 Correct 1549 ms 398712 KB Output is correct
86 Correct 1291 ms 414112 KB Output is correct
87 Correct 1415 ms 400016 KB Output is correct
88 Correct 935 ms 12536 KB Output is correct
89 Correct 926 ms 12496 KB Output is correct
90 Correct 844 ms 11668 KB Output is correct
91 Correct 874 ms 11616 KB Output is correct
92 Correct 845 ms 11284 KB Output is correct
93 Correct 854 ms 11100 KB Output is correct
94 Correct 1188 ms 257016 KB Output is correct
95 Correct 1215 ms 249892 KB Output is correct
96 Correct 1060 ms 254556 KB Output is correct
97 Correct 1116 ms 252412 KB Output is correct
98 Correct 1000 ms 255892 KB Output is correct
99 Correct 1034 ms 250528 KB Output is correct
100 Correct 1040 ms 12604 KB Output is correct
101 Correct 1010 ms 12408 KB Output is correct
102 Correct 964 ms 11640 KB Output is correct
103 Correct 1018 ms 11512 KB Output is correct
104 Correct 969 ms 11228 KB Output is correct
105 Correct 971 ms 11128 KB Output is correct
106 Correct 1400 ms 334756 KB Output is correct
107 Correct 1426 ms 304472 KB Output is correct
108 Correct 1252 ms 335636 KB Output is correct
109 Correct 1283 ms 303028 KB Output is correct
110 Correct 1164 ms 336392 KB Output is correct
111 Correct 1212 ms 304332 KB Output is correct
112 Correct 942 ms 12664 KB Output is correct
113 Correct 930 ms 12600 KB Output is correct
114 Correct 855 ms 11588 KB Output is correct
115 Correct 875 ms 11548 KB Output is correct
116 Correct 859 ms 11256 KB Output is correct
117 Correct 870 ms 11064 KB Output is correct
118 Correct 1407 ms 412988 KB Output is correct
119 Correct 1268 ms 334904 KB Output is correct
120 Correct 1291 ms 302268 KB Output is correct
121 Correct 1488 ms 413084 KB Output is correct
122 Correct 1270 ms 333476 KB Output is correct
123 Correct 1295 ms 302408 KB Output is correct
124 Correct 1442 ms 413184 KB Output is correct
125 Correct 1264 ms 335160 KB Output is correct
126 Correct 1294 ms 301428 KB Output is correct