oj.uz

Submission #414972

# Submission time Handle Problem Language Result Execution time Memory
414972 2021-05-31T11:25:19 Z nvmdava Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1626 ms 420208 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 100005;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int SQ = 300;
vector<int> to[N], fr[N];
vector<pair<int, int> > ans[N];
int vis[N];
int tag = 0;
int d[N];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

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

    while(m--){
        int s, e;
        cin>>s>>e;
        fr[s].push_back(e);
        to[e].push_back(s);
    }

    for(int i = 1; i <= n; ++i){
        ans[i].push_back({i, 0});
        for(auto& j : to[i]){
            ++tag;
            vector<pair<int, int> > tmp, &v1 = ans[i], &v2 = ans[j];
            int i1 = 0, i2 = 0, s1 = v1.size(), s2 = v2.size();

            while(tmp.size() < SQ && (i1 < s1 || i2 < s2) ){
                if(i1 != s1 && vis[v1[i1].ff] == tag){
                    ++i1;
                    continue;
                }
                if(i2 != s2 && vis[v2[i2].ff] == tag){
                    ++i2;
                    continue;
                }
                if(i2 == s2 || v1[i1].ss > v2[i2].ss + 1){
                    vis[v1[i1].ff] = tag;
                    tmp.push_back({v1[i1].ff, v1[i1].ss});
                    ++i1;
                    continue;
                }
                vis[v2[i2].ff] = tag;
                tmp.push_back({v2[i2].ff, v2[i2].ss + 1});
                ++i2;
            }
            swap(v1, tmp);
        }
    }

    while(q--){
        ++tag;
        int res = -1;
        int t, y;
        cin>>t>>y;
        while(y--){
            int w;
            cin>>w;
            vis[w] = tag;
        }
        for(auto& [v, d] : ans[t]){
            if(vis[v] != tag){
                res = d;
                break;
            }
        }
        if(res != -1){
            cout<<res<<'\n';
            continue;
        }
        for(int i = t + 1; i <= n; ++i)
            d[i] = -MOD;
        d[t] = 0;
        if(vis[t] != tag)
            res = 0;
        for(int i = t - 1; i > 0; --i){
            d[i] = -MOD;
            for(auto& x : fr[i])
                d[i] = max(d[i], d[x] + 1);
            if(vis[i] != tag)
                res = max(res, d[i]);
        }
        cout<<res<<'\n';
    }

}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 6 ms 7292 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 8 ms 7884 KB Output is correct
6 Correct 8 ms 7904 KB Output is correct
7 Correct 9 ms 7756 KB Output is correct
8 Correct 16 ms 10700 KB Output is correct
9 Correct 16 ms 10700 KB Output is correct
10 Correct 16 ms 10700 KB Output is correct
11 Correct 15 ms 10392 KB Output is correct
12 Correct 11 ms 8780 KB Output is correct
13 Correct 14 ms 10136 KB Output is correct
14 Correct 13 ms 9420 KB Output is correct
15 Correct 10 ms 8396 KB Output is correct
16 Correct 13 ms 9348 KB Output is correct
17 Correct 13 ms 9560 KB Output is correct
18 Correct 10 ms 8664 KB Output is correct
19 Correct 13 ms 9560 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 6 ms 7292 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 8 ms 7884 KB Output is correct
6 Correct 8 ms 7904 KB Output is correct
7 Correct 9 ms 7756 KB Output is correct
8 Correct 16 ms 10700 KB Output is correct
9 Correct 16 ms 10700 KB Output is correct
10 Correct 16 ms 10700 KB Output is correct
11 Correct 15 ms 10392 KB Output is correct
12 Correct 11 ms 8780 KB Output is correct
13 Correct 14 ms 10136 KB Output is correct
14 Correct 13 ms 9420 KB Output is correct
15 Correct 10 ms 8396 KB Output is correct
16 Correct 13 ms 9348 KB Output is correct
17 Correct 13 ms 9560 KB Output is correct
18 Correct 10 ms 8664 KB Output is correct
19 Correct 13 ms 9560 KB Output is correct
20 Correct 857 ms 14544 KB Output is correct
21 Correct 909 ms 14692 KB Output is correct
22 Correct 863 ms 14648 KB Output is correct
23 Correct 910 ms 14804 KB Output is correct
24 Correct 945 ms 259364 KB Output is correct
25 Correct 1020 ms 270908 KB Output is correct
26 Correct 960 ms 270352 KB Output is correct
27 Correct 1371 ms 418748 KB Output is correct
28 Correct 1335 ms 418532 KB Output is correct
29 Correct 1335 ms 418760 KB Output is correct
30 Correct 1287 ms 417544 KB Output is correct
31 Correct 1306 ms 402964 KB Output is correct
32 Correct 1296 ms 417612 KB Output is correct
33 Correct 972 ms 260424 KB Output is correct
34 Correct 856 ms 214008 KB Output is correct
35 Correct 947 ms 258468 KB Output is correct
36 Correct 1091 ms 339144 KB Output is correct
37 Correct 1147 ms 307412 KB Output is correct
38 Correct 1124 ms 340680 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 6 ms 7292 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 8 ms 7884 KB Output is correct
6 Correct 8 ms 7904 KB Output is correct
7 Correct 9 ms 7756 KB Output is correct
8 Correct 16 ms 10700 KB Output is correct
9 Correct 16 ms 10700 KB Output is correct
10 Correct 16 ms 10700 KB Output is correct
11 Correct 15 ms 10392 KB Output is correct
12 Correct 11 ms 8780 KB Output is correct
13 Correct 14 ms 10136 KB Output is correct
14 Correct 13 ms 9420 KB Output is correct
15 Correct 10 ms 8396 KB Output is correct
16 Correct 13 ms 9348 KB Output is correct
17 Correct 13 ms 9560 KB Output is correct
18 Correct 10 ms 8664 KB Output is correct
19 Correct 13 ms 9560 KB Output is correct
20 Correct 857 ms 14544 KB Output is correct
21 Correct 909 ms 14692 KB Output is correct
22 Correct 863 ms 14648 KB Output is correct
23 Correct 910 ms 14804 KB Output is correct
24 Correct 945 ms 259364 KB Output is correct
25 Correct 1020 ms 270908 KB Output is correct
26 Correct 960 ms 270352 KB Output is correct
27 Correct 1371 ms 418748 KB Output is correct
28 Correct 1335 ms 418532 KB Output is correct
29 Correct 1335 ms 418760 KB Output is correct
30 Correct 1287 ms 417544 KB Output is correct
31 Correct 1306 ms 402964 KB Output is correct
32 Correct 1296 ms 417612 KB Output is correct
33 Correct 972 ms 260424 KB Output is correct
34 Correct 856 ms 214008 KB Output is correct
35 Correct 947 ms 258468 KB Output is correct
36 Correct 1091 ms 339144 KB Output is correct
37 Correct 1147 ms 307412 KB Output is correct
38 Correct 1124 ms 340680 KB Output is correct
39 Correct 1057 ms 263764 KB Output is correct
40 Correct 1016 ms 265644 KB Output is correct
41 Correct 974 ms 268328 KB Output is correct
42 Correct 969 ms 265916 KB Output is correct
43 Correct 997 ms 265412 KB Output is correct
44 Correct 871 ms 15984 KB Output is correct
45 Correct 879 ms 15084 KB Output is correct
46 Correct 874 ms 14980 KB Output is correct
47 Correct 930 ms 14792 KB Output is correct
48 Correct 858 ms 14640 KB Output is correct
49 Correct 1384 ms 420024 KB Output is correct
50 Correct 1296 ms 418600 KB Output is correct
51 Correct 918 ms 15812 KB Output is correct
52 Correct 854 ms 14860 KB Output is correct
53 Correct 1145 ms 339328 KB Output is correct
54 Correct 1105 ms 308896 KB Output is correct
55 Correct 1078 ms 338300 KB Output is correct
56 Correct 1094 ms 309160 KB Output is correct
57 Correct 892 ms 15844 KB Output is correct
58 Correct 878 ms 15804 KB Output is correct
59 Correct 947 ms 14836 KB Output is correct
60 Correct 900 ms 14888 KB Output is correct
61 Correct 1476 ms 418728 KB Output is correct
62 Correct 1215 ms 340076 KB Output is correct
63 Correct 1056 ms 307480 KB Output is correct
64 Correct 1626 ms 418688 KB Output is correct
65 Correct 1347 ms 338712 KB Output is correct
66 Correct 1049 ms 309256 KB Output is correct
67 Correct 1329 ms 418680 KB Output is correct
68 Correct 1073 ms 340092 KB Output is correct
69 Correct 1012 ms 304972 KB Output is correct
70 Correct 1373 ms 418848 KB Output is correct
71 Correct 1099 ms 340108 KB Output is correct
72 Correct 1050 ms 308868 KB Output is correct
73 Correct 1337 ms 418756 KB Output is correct
74 Correct 1112 ms 340144 KB Output is correct
75 Correct 1113 ms 308848 KB Output is correct
76 Correct 1403 ms 420208 KB Output is correct
77 Correct 1400 ms 419012 KB Output is correct
78 Correct 1300 ms 418872 KB Output is correct
79 Correct 885 ms 16072 KB Output is correct
80 Correct 856 ms 15088 KB Output is correct
81 Correct 846 ms 14604 KB Output is correct
82 Correct 1423 ms 418972 KB Output is correct
83 Correct 1376 ms 404596 KB Output is correct
84 Correct 1317 ms 417616 KB Output is correct
85 Correct 1313 ms 403044 KB Output is correct
86 Correct 1318 ms 417784 KB Output is correct
87 Correct 1334 ms 403952 KB Output is correct
88 Correct 933 ms 15864 KB Output is correct
89 Correct 954 ms 16040 KB Output is correct
90 Correct 922 ms 14972 KB Output is correct
91 Correct 848 ms 15032 KB Output is correct
92 Correct 882 ms 14600 KB Output is correct
93 Correct 867 ms 14600 KB Output is correct
94 Correct 976 ms 261924 KB Output is correct
95 Correct 922 ms 214332 KB Output is correct
96 Correct 952 ms 259524 KB Output is correct
97 Correct 879 ms 217412 KB Output is correct
98 Correct 947 ms 260468 KB Output is correct
99 Correct 936 ms 216616 KB Output is correct
100 Correct 948 ms 16132 KB Output is correct
101 Correct 996 ms 16028 KB Output is correct
102 Correct 926 ms 15072 KB Output is correct
103 Correct 910 ms 15048 KB Output is correct
104 Correct 944 ms 14620 KB Output is correct
105 Correct 904 ms 14652 KB Output is correct
106 Correct 1285 ms 339604 KB Output is correct
107 Correct 1092 ms 309392 KB Output is correct
108 Correct 1077 ms 340708 KB Output is correct
109 Correct 1080 ms 307920 KB Output is correct
110 Correct 1159 ms 340656 KB Output is correct
111 Correct 1054 ms 308964 KB Output is correct
112 Correct 890 ms 16080 KB Output is correct
113 Correct 959 ms 15928 KB Output is correct
114 Correct 876 ms 15080 KB Output is correct
115 Correct 915 ms 14996 KB Output is correct
116 Correct 861 ms 14616 KB Output is correct
117 Correct 838 ms 14564 KB Output is correct
118 Correct 1381 ms 418648 KB Output is correct
119 Correct 1075 ms 340660 KB Output is correct
120 Correct 1062 ms 307960 KB Output is correct
121 Correct 1346 ms 418408 KB Output is correct
122 Correct 1104 ms 339264 KB Output is correct
123 Correct 1054 ms 307776 KB Output is correct
124 Correct 1302 ms 418584 KB Output is correct
125 Correct 1070 ms 340420 KB Output is correct
126 Correct 1028 ms 306608 KB Output is correct