oj.uz

Submission #394593

# Submission time Handle Problem Language Result Execution time Memory
394593 2021-04-27T02:39:04 Z Osama_Alkhodairy Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1358 ms 414504 KB 
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 100001;
const int K = 300;
const int INF = (int)1e9;

int n, m, q, vis1[N], vis2[N];
vector <int> g[N];
vector <pair <int, int> > f[N];
int curt;

vector <pair <int, int> > merge(vector <pair <int, int> > &l, vector <pair <int, int> > &r){
    curt++;
    vector <pair <int, int> > ret;
    int lpos = 0, rpos = 0;
    int lsz = l.size(), rsz = r.size();
    while(ret.size() < K && (lpos < lsz || rpos < rsz)){
        pair <int, int> winner;
        if(lpos == lsz){
            winner = make_pair(r[rpos].first + 1, r[rpos].second);
            rpos++;
        }
        else if(rpos == rsz){
            winner = l[lpos];
            lpos++;
        }
        else if(l[lpos].first > r[rpos].first + 1){
            winner = l[lpos];
            lpos++;
        }
        else{
            winner = make_pair(r[rpos].first + 1, r[rpos].second);
            rpos++;
        }
        if(vis2[winner.second] == curt) continue;
        vis2[winner.second] = curt;
        ret.push_back(winner);
    }
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> q;
    for(int i = 0 ; i < m ; i++){
        int x, y;
        cin >> x >> y;
        x--; y--;
        g[y].push_back(x);
    }
    for(int i = 0 ; i < n ; i++){
        f[i].push_back(make_pair(0, i));
        for(auto &j : g[i]){
            f[i] = merge(f[i], f[j]);
        }
    }
    for(int i = 1 ; i <= q ; i++){
        int t, sz;
        cin >> t >> sz;
        t--;
        for(int j = 0 ; j < sz ; j++){
            int x;
            cin >> x;
            x--;
            vis1[x] = i;
        }
        if(sz < K){
            int ans = -1;
            for(auto &j : f[t]){
                if(vis1[j.second] == i) continue;
                ans = j.first;
                break;
            }
            cout << ans << "\n";
        }
        else{
            vector <int> dist(t + 1, -INF);
            dist[t] = 0;
            int ans = -1;
            for(int j = t ; j >= 0 ; j--){
                for(auto &k : g[j]){
                    dist[k] = max(dist[k], 1 + dist[j]);
                }
                if(vis1[j] != i) ans = max(ans, dist[j]);
            }
            cout << ans << "\n";
        }
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 6 ms 5452 KB Output is correct
6 Correct 6 ms 5540 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 13 ms 8396 KB Output is correct
9 Correct 13 ms 8356 KB Output is correct
10 Correct 13 ms 8396 KB Output is correct
11 Correct 12 ms 8012 KB Output is correct
12 Correct 8 ms 6348 KB Output is correct
13 Correct 15 ms 7884 KB Output is correct
14 Correct 11 ms 7068 KB Output is correct
15 Correct 8 ms 5964 KB Output is correct
16 Correct 10 ms 6984 KB Output is correct
17 Correct 11 ms 7244 KB Output is correct
18 Correct 8 ms 6224 KB Output is correct
19 Correct 10 ms 7244 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 6 ms 5452 KB Output is correct
6 Correct 6 ms 5540 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 13 ms 8396 KB Output is correct
9 Correct 13 ms 8356 KB Output is correct
10 Correct 13 ms 8396 KB Output is correct
11 Correct 12 ms 8012 KB Output is correct
12 Correct 8 ms 6348 KB Output is correct
13 Correct 15 ms 7884 KB Output is correct
14 Correct 11 ms 7068 KB Output is correct
15 Correct 8 ms 5964 KB Output is correct
16 Correct 10 ms 6984 KB Output is correct
17 Correct 11 ms 7244 KB Output is correct
18 Correct 8 ms 6224 KB Output is correct
19 Correct 10 ms 7244 KB Output is correct
20 Correct 837 ms 10976 KB Output is correct
21 Correct 763 ms 11108 KB Output is correct
22 Correct 818 ms 11088 KB Output is correct
23 Correct 916 ms 11064 KB Output is correct
24 Correct 876 ms 255108 KB Output is correct
25 Correct 905 ms 266604 KB Output is correct
26 Correct 894 ms 265488 KB Output is correct
27 Correct 1080 ms 413192 KB Output is correct
28 Correct 1066 ms 413048 KB Output is correct
29 Correct 1036 ms 412968 KB Output is correct
30 Correct 1135 ms 412312 KB Output is correct
31 Correct 1026 ms 398416 KB Output is correct
32 Correct 1149 ms 412356 KB Output is correct
33 Correct 797 ms 255364 KB Output is correct
34 Correct 721 ms 209228 KB Output is correct
35 Correct 789 ms 253532 KB Output is correct
36 Correct 932 ms 334196 KB Output is correct
37 Correct 883 ms 302340 KB Output is correct
38 Correct 945 ms 335172 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 6 ms 5452 KB Output is correct
6 Correct 6 ms 5540 KB Output is correct
7 Correct 6 ms 5452 KB Output is correct
8 Correct 13 ms 8396 KB Output is correct
9 Correct 13 ms 8356 KB Output is correct
10 Correct 13 ms 8396 KB Output is correct
11 Correct 12 ms 8012 KB Output is correct
12 Correct 8 ms 6348 KB Output is correct
13 Correct 15 ms 7884 KB Output is correct
14 Correct 11 ms 7068 KB Output is correct
15 Correct 8 ms 5964 KB Output is correct
16 Correct 10 ms 6984 KB Output is correct
17 Correct 11 ms 7244 KB Output is correct
18 Correct 8 ms 6224 KB Output is correct
19 Correct 10 ms 7244 KB Output is correct
20 Correct 837 ms 10976 KB Output is correct
21 Correct 763 ms 11108 KB Output is correct
22 Correct 818 ms 11088 KB Output is correct
23 Correct 916 ms 11064 KB Output is correct
24 Correct 876 ms 255108 KB Output is correct
25 Correct 905 ms 266604 KB Output is correct
26 Correct 894 ms 265488 KB Output is correct
27 Correct 1080 ms 413192 KB Output is correct
28 Correct 1066 ms 413048 KB Output is correct
29 Correct 1036 ms 412968 KB Output is correct
30 Correct 1135 ms 412312 KB Output is correct
31 Correct 1026 ms 398416 KB Output is correct
32 Correct 1149 ms 412356 KB Output is correct
33 Correct 797 ms 255364 KB Output is correct
34 Correct 721 ms 209228 KB Output is correct
35 Correct 789 ms 253532 KB Output is correct
36 Correct 932 ms 334196 KB Output is correct
37 Correct 883 ms 302340 KB Output is correct
38 Correct 945 ms 335172 KB Output is correct
39 Correct 923 ms 259540 KB Output is correct
40 Correct 891 ms 261316 KB Output is correct
41 Correct 892 ms 264216 KB Output is correct
42 Correct 1022 ms 262168 KB Output is correct
43 Correct 888 ms 261432 KB Output is correct
44 Correct 836 ms 12356 KB Output is correct
45 Correct 841 ms 11540 KB Output is correct
46 Correct 827 ms 11496 KB Output is correct
47 Correct 834 ms 11204 KB Output is correct
48 Correct 809 ms 11076 KB Output is correct
49 Correct 1214 ms 413748 KB Output is correct
50 Correct 1132 ms 412476 KB Output is correct
51 Correct 768 ms 12100 KB Output is correct
52 Correct 749 ms 11328 KB Output is correct
53 Correct 969 ms 333332 KB Output is correct
54 Correct 932 ms 303300 KB Output is correct
55 Correct 935 ms 332820 KB Output is correct
56 Correct 894 ms 303024 KB Output is correct
57 Correct 854 ms 12228 KB Output is correct
58 Correct 861 ms 12384 KB Output is correct
59 Correct 798 ms 11332 KB Output is correct
60 Correct 824 ms 11396 KB Output is correct
61 Correct 1152 ms 413148 KB Output is correct
62 Correct 1060 ms 334524 KB Output is correct
63 Correct 1004 ms 302252 KB Output is correct
64 Correct 1358 ms 413176 KB Output is correct
65 Correct 1267 ms 333040 KB Output is correct
66 Correct 1263 ms 303824 KB Output is correct
67 Correct 1139 ms 412504 KB Output is correct
68 Correct 928 ms 334184 KB Output is correct
69 Correct 905 ms 299368 KB Output is correct
70 Correct 1047 ms 413120 KB Output is correct
71 Correct 955 ms 334776 KB Output is correct
72 Correct 929 ms 303328 KB Output is correct
73 Correct 1078 ms 413104 KB Output is correct
74 Correct 1002 ms 334568 KB Output is correct
75 Correct 937 ms 303296 KB Output is correct
76 Correct 1195 ms 414504 KB Output is correct
77 Correct 1141 ms 413124 KB Output is correct
78 Correct 1054 ms 413628 KB Output is correct
79 Correct 778 ms 12356 KB Output is correct
80 Correct 766 ms 11384 KB Output is correct
81 Correct 765 ms 10992 KB Output is correct
82 Correct 1191 ms 413820 KB Output is correct
83 Correct 1179 ms 399756 KB Output is correct
84 Correct 1149 ms 412820 KB Output is correct
85 Correct 1124 ms 398016 KB Output is correct
86 Correct 1043 ms 412780 KB Output is correct
87 Correct 1047 ms 399356 KB Output is correct
88 Correct 885 ms 12360 KB Output is correct
89 Correct 868 ms 12372 KB Output is correct
90 Correct 814 ms 11316 KB Output is correct
91 Correct 851 ms 11404 KB Output is correct
92 Correct 841 ms 10944 KB Output is correct
93 Correct 824 ms 11092 KB Output is correct
94 Correct 848 ms 256704 KB Output is correct
95 Correct 778 ms 209268 KB Output is correct
96 Correct 809 ms 254272 KB Output is correct
97 Correct 734 ms 212328 KB Output is correct
98 Correct 813 ms 255648 KB Output is correct
99 Correct 743 ms 211948 KB Output is correct
100 Correct 915 ms 12504 KB Output is correct
101 Correct 891 ms 12396 KB Output is correct
102 Correct 878 ms 11400 KB Output is correct
103 Correct 889 ms 11376 KB Output is correct
104 Correct 875 ms 11056 KB Output is correct
105 Correct 880 ms 11112 KB Output is correct
106 Correct 987 ms 334420 KB Output is correct
107 Correct 958 ms 304264 KB Output is correct
108 Correct 937 ms 335548 KB Output is correct
109 Correct 897 ms 302948 KB Output is correct
110 Correct 947 ms 336340 KB Output is correct
111 Correct 905 ms 303940 KB Output is correct
112 Correct 882 ms 12444 KB Output is correct
113 Correct 849 ms 12356 KB Output is correct
114 Correct 795 ms 11404 KB Output is correct
115 Correct 852 ms 11332 KB Output is correct
116 Correct 802 ms 10972 KB Output is correct
117 Correct 823 ms 11076 KB Output is correct
118 Correct 1172 ms 412520 KB Output is correct
119 Correct 932 ms 334884 KB Output is correct
120 Correct 902 ms 302008 KB Output is correct
121 Correct 1131 ms 412500 KB Output is correct
122 Correct 934 ms 333288 KB Output is correct
123 Correct 899 ms 302084 KB Output is correct
124 Correct 1137 ms 412552 KB Output is correct
125 Correct 934 ms 334904 KB Output is correct
126 Correct 921 ms 301176 KB Output is correct