oj.uz

Submission #414358

# Submission time Handle Problem Language Result Execution time Memory
414358 2021-05-30T11:26:00 Z Runtime_error_ Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1680 ms 427488 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
const int inf = 2e5+9,sqr = 300,MX = 1e9+9;
int n,m,q,ts,vis[inf],dis[inf];
vector<int> out[inf],in[inf],blocked;
vector<pair<int,int> >furthest[inf];

vector<pair<int,int>> merge(vector<pair<int,int>> a,vector<pair<int,int>> b){
    ts++;
    vector<pair<int,int> > ret;
    int sza = a.size(),szb = b.size(),pta = 0,ptb = 0;
    for(auto &o:a)
        o.first--;
    auto add = [&](pair<int,int> x){
        x.first ++;
        ret.pb(x);
        vis[x.second] = ts;
    };
    auto validpta = [&](){
        while(pta < sza && vis[ a[pta].second ] == ts)
            pta++;
        return pta < sza;
    };
    auto validptb = [&](){
        while(ptb < szb && vis[ b[ptb].second ] == ts)
            ptb++;
        return ptb < szb;
    };
    while(validpta() && validptb() && ret.size()<sqr){
        if(a[pta].first >= b[ptb].first)
            add(a[pta]);
        else
            add(b[ptb]);
    }
    while(validpta() && ret.size() < sqr){
        add(a[pta]);
    }
    while(validptb() && ret.size() < sqr){
        add(b[ptb]);
    }
    return ret;
}

int heavy(int goal){
    int ret = -1;

    for(int i=1;i<=n;i++)
        dis[i] = -MX;
    dis[goal] = 0;
    ts++;
    for(auto o:blocked)
        vis[o] = ts;

    for(int u=goal;u>=1;u--){
        for(auto v:out[u])
            dis[u] = max(dis[u],dis[v]+1);
        if(vis[u] != ts)
            ret = max(ret,dis[u]);
    }
    return ret;
}

int light(int goal){
    //return heavy(goal);
    int ret = -1;
    ts++;
    for(auto o:blocked)
        vis[o] = ts;
    for(auto o:furthest[goal])
        if(vis[o.second] != ts)
            ret = max(ret,o.first);
    return ret;
}

int main(){
    scanf("%d%d%d",&n,&m,&q);
    for(int i=1;i<=m;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        out[a].pb(b);
        in[b].pb(a);
    }
    for(int u=1;u<=n;u++){
        furthest[u].pb(mp(0,u));
        for(auto v:in[u])
            furthest[u] = merge(furthest[u],furthest[v]);
    }
    while(q--){
        blocked.clear();
        int u,cnt,tmp;
        scanf("%d%d",&u,&cnt);
        for(int i=0;i<cnt;i++)
            scanf("%d",&tmp),blocked.pb(tmp);
        if(cnt >= sqr)
            printf("%d\n",heavy(u));
        else
            printf("%d\n",light(u));
    }
}
/*
5 6 3
1 2
2 4
3 4
1 3
3 5
4 5
5 2 2 3
*/

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:79:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |     scanf("%d%d%d",&n,&m,&q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
bitaro.cpp:82:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         scanf("%d%d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         scanf("%d%d",&u,&cnt);
      |         ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:96:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |             scanf("%d",&tmp),blocked.pb(tmp);
      |             ~~~~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14284 KB Output is correct
2 Correct 10 ms 14284 KB Output is correct
3 Correct 10 ms 14404 KB Output is correct
4 Correct 10 ms 14392 KB Output is correct
5 Correct 13 ms 14916 KB Output is correct
6 Correct 13 ms 14924 KB Output is correct
7 Correct 13 ms 14908 KB Output is correct
8 Correct 20 ms 17904 KB Output is correct
9 Correct 21 ms 17952 KB Output is correct
10 Correct 21 ms 17916 KB Output is correct
11 Correct 20 ms 17520 KB Output is correct
12 Correct 29 ms 15800 KB Output is correct
13 Correct 20 ms 17304 KB Output is correct
14 Correct 20 ms 16460 KB Output is correct
15 Correct 16 ms 15464 KB Output is correct
16 Correct 19 ms 16332 KB Output is correct
17 Correct 19 ms 16712 KB Output is correct
18 Correct 16 ms 15684 KB Output is correct
19 Correct 19 ms 16636 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14284 KB Output is correct
2 Correct 10 ms 14284 KB Output is correct
3 Correct 10 ms 14404 KB Output is correct
4 Correct 10 ms 14392 KB Output is correct
5 Correct 13 ms 14916 KB Output is correct
6 Correct 13 ms 14924 KB Output is correct
7 Correct 13 ms 14908 KB Output is correct
8 Correct 20 ms 17904 KB Output is correct
9 Correct 21 ms 17952 KB Output is correct
10 Correct 21 ms 17916 KB Output is correct
11 Correct 20 ms 17520 KB Output is correct
12 Correct 29 ms 15800 KB Output is correct
13 Correct 20 ms 17304 KB Output is correct
14 Correct 20 ms 16460 KB Output is correct
15 Correct 16 ms 15464 KB Output is correct
16 Correct 19 ms 16332 KB Output is correct
17 Correct 19 ms 16712 KB Output is correct
18 Correct 16 ms 15684 KB Output is correct
19 Correct 19 ms 16636 KB Output is correct
20 Correct 1025 ms 21700 KB Output is correct
21 Correct 1033 ms 21684 KB Output is correct
22 Correct 1002 ms 21648 KB Output is correct
23 Correct 1077 ms 21752 KB Output is correct
24 Correct 1108 ms 268272 KB Output is correct
25 Correct 1179 ms 279848 KB Output is correct
26 Correct 1132 ms 279184 KB Output is correct
27 Correct 1326 ms 426008 KB Output is correct
28 Correct 1322 ms 426144 KB Output is correct
29 Correct 1312 ms 425968 KB Output is correct
30 Correct 1335 ms 425020 KB Output is correct
31 Correct 1363 ms 410564 KB Output is correct
32 Correct 1326 ms 424688 KB Output is correct
33 Correct 1058 ms 267712 KB Output is correct
34 Correct 974 ms 221376 KB Output is correct
35 Correct 1072 ms 265928 KB Output is correct
36 Correct 1217 ms 346536 KB Output is correct
37 Correct 1181 ms 315320 KB Output is correct
38 Correct 1202 ms 347636 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14284 KB Output is correct
2 Correct 10 ms 14284 KB Output is correct
3 Correct 10 ms 14404 KB Output is correct
4 Correct 10 ms 14392 KB Output is correct
5 Correct 13 ms 14916 KB Output is correct
6 Correct 13 ms 14924 KB Output is correct
7 Correct 13 ms 14908 KB Output is correct
8 Correct 20 ms 17904 KB Output is correct
9 Correct 21 ms 17952 KB Output is correct
10 Correct 21 ms 17916 KB Output is correct
11 Correct 20 ms 17520 KB Output is correct
12 Correct 29 ms 15800 KB Output is correct
13 Correct 20 ms 17304 KB Output is correct
14 Correct 20 ms 16460 KB Output is correct
15 Correct 16 ms 15464 KB Output is correct
16 Correct 19 ms 16332 KB Output is correct
17 Correct 19 ms 16712 KB Output is correct
18 Correct 16 ms 15684 KB Output is correct
19 Correct 19 ms 16636 KB Output is correct
20 Correct 1025 ms 21700 KB Output is correct
21 Correct 1033 ms 21684 KB Output is correct
22 Correct 1002 ms 21648 KB Output is correct
23 Correct 1077 ms 21752 KB Output is correct
24 Correct 1108 ms 268272 KB Output is correct
25 Correct 1179 ms 279848 KB Output is correct
26 Correct 1132 ms 279184 KB Output is correct
27 Correct 1326 ms 426008 KB Output is correct
28 Correct 1322 ms 426144 KB Output is correct
29 Correct 1312 ms 425968 KB Output is correct
30 Correct 1335 ms 425020 KB Output is correct
31 Correct 1363 ms 410564 KB Output is correct
32 Correct 1326 ms 424688 KB Output is correct
33 Correct 1058 ms 267712 KB Output is correct
34 Correct 974 ms 221376 KB Output is correct
35 Correct 1072 ms 265928 KB Output is correct
36 Correct 1217 ms 346536 KB Output is correct
37 Correct 1181 ms 315320 KB Output is correct
38 Correct 1202 ms 347636 KB Output is correct
39 Correct 1208 ms 271020 KB Output is correct
40 Correct 1116 ms 273448 KB Output is correct
41 Correct 1114 ms 276032 KB Output is correct
42 Correct 1262 ms 274468 KB Output is correct
43 Correct 1127 ms 273764 KB Output is correct
44 Correct 1099 ms 22756 KB Output is correct
45 Correct 1029 ms 22180 KB Output is correct
46 Correct 1022 ms 22128 KB Output is correct
47 Correct 1056 ms 21788 KB Output is correct
48 Correct 1008 ms 21736 KB Output is correct
49 Correct 1429 ms 425540 KB Output is correct
50 Correct 1349 ms 424960 KB Output is correct
51 Correct 1075 ms 22544 KB Output is correct
52 Correct 1022 ms 21984 KB Output is correct
53 Correct 1297 ms 345012 KB Output is correct
54 Correct 1276 ms 314964 KB Output is correct
55 Correct 1215 ms 345076 KB Output is correct
56 Correct 1198 ms 315588 KB Output is correct
57 Correct 1088 ms 22780 KB Output is correct
58 Correct 1078 ms 22652 KB Output is correct
59 Correct 1012 ms 21884 KB Output is correct
60 Correct 1016 ms 22088 KB Output is correct
61 Correct 1437 ms 425056 KB Output is correct
62 Correct 1293 ms 345948 KB Output is correct
63 Correct 1317 ms 313400 KB Output is correct
64 Correct 1680 ms 424808 KB Output is correct
65 Correct 1543 ms 345800 KB Output is correct
66 Correct 1537 ms 316616 KB Output is correct
67 Correct 1317 ms 425612 KB Output is correct
68 Correct 1207 ms 346972 KB Output is correct
69 Correct 1177 ms 312156 KB Output is correct
70 Correct 1382 ms 426104 KB Output is correct
71 Correct 1243 ms 347240 KB Output is correct
72 Correct 1320 ms 316120 KB Output is correct
73 Correct 1454 ms 425996 KB Output is correct
74 Correct 1311 ms 347252 KB Output is correct
75 Correct 1284 ms 315988 KB Output is correct
76 Correct 1506 ms 427488 KB Output is correct
77 Correct 1383 ms 426032 KB Output is correct
78 Correct 1393 ms 426648 KB Output is correct
79 Correct 1152 ms 23036 KB Output is correct
80 Correct 1089 ms 22136 KB Output is correct
81 Correct 1040 ms 21676 KB Output is correct
82 Correct 1455 ms 426036 KB Output is correct
83 Correct 1556 ms 411864 KB Output is correct
84 Correct 1442 ms 424696 KB Output is correct
85 Correct 1449 ms 410184 KB Output is correct
86 Correct 1421 ms 425360 KB Output is correct
87 Correct 1473 ms 411540 KB Output is correct
88 Correct 1116 ms 22980 KB Output is correct
89 Correct 1137 ms 23076 KB Output is correct
90 Correct 1058 ms 21992 KB Output is correct
91 Correct 1093 ms 22012 KB Output is correct
92 Correct 1086 ms 21680 KB Output is correct
93 Correct 1030 ms 21708 KB Output is correct
94 Correct 1151 ms 269004 KB Output is correct
95 Correct 1114 ms 221424 KB Output is correct
96 Correct 1081 ms 266528 KB Output is correct
97 Correct 991 ms 224452 KB Output is correct
98 Correct 1084 ms 267976 KB Output is correct
99 Correct 1006 ms 224328 KB Output is correct
100 Correct 1189 ms 23012 KB Output is correct
101 Correct 1148 ms 22980 KB Output is correct
102 Correct 1122 ms 22092 KB Output is correct
103 Correct 1123 ms 22064 KB Output is correct
104 Correct 1089 ms 21772 KB Output is correct
105 Correct 1059 ms 21768 KB Output is correct
106 Correct 1306 ms 346756 KB Output is correct
107 Correct 1279 ms 316812 KB Output is correct
108 Correct 1214 ms 347820 KB Output is correct
109 Correct 1188 ms 315004 KB Output is correct
110 Correct 1222 ms 348608 KB Output is correct
111 Correct 1232 ms 316760 KB Output is correct
112 Correct 1100 ms 23084 KB Output is correct
113 Correct 1080 ms 23172 KB Output is correct
114 Correct 1028 ms 22056 KB Output is correct
115 Correct 1016 ms 21956 KB Output is correct
116 Correct 1022 ms 21728 KB Output is correct
117 Correct 1018 ms 21756 KB Output is correct
118 Correct 1363 ms 425652 KB Output is correct
119 Correct 1216 ms 347500 KB Output is correct
120 Correct 1182 ms 314876 KB Output is correct
121 Correct 1353 ms 425412 KB Output is correct
122 Correct 1209 ms 346052 KB Output is correct
123 Correct 1202 ms 314940 KB Output is correct
124 Correct 1345 ms 425476 KB Output is correct
125 Correct 1223 ms 347872 KB Output is correct
126 Correct 1180 ms 313932 KB Output is correct