oj.uz

Submission #241591

# Submission time Handle Problem Language Result Execution time Memory
241591 2020-06-24T15:33:41 Z Mercenary Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1119 ms 168552 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 1e5 + 5;
int n , m , q;
vector<int> adj[maxn];
int f[maxn];
bool used[maxn];
bool tmp[maxn];

vector<ii> can[maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> n >> m >> q;
    while(m--){
        int u , v;cin >> u >> v;adj[v].pb(u);
    }
    for(int i = 1 ; i <= n ; ++i){
        can[i].pb(mp(-1 , i));
        for(auto v : adj[i]){
            vector<ii> val;
            auto add = [&](vector<ii> & val , ii c){
                if(val.size() == 200 || tmp[c.second] == 1)return;
                val.pb(c);
                tmp[c.second] = 1;
            };
            int j = 0;
            for(auto & c : can[i]){
                while(j < can[v].size() && can[v][j] >= c)add(val , can[v][j++]);
                add(val , c);
            }
            while(j < can[v].size())add(val , can[v][j++]);
            can[i] = val;
            for(auto & c : val)tmp[c.second] = 0;
        }
        for(auto & c : can[i]){
            c.first++;
        }
    }
    while(q--){
        int u;cin >> u;
        int k;cin >> k;
        vector<int> val(k);
        for(auto & c : val){
            cin >> c;
            tmp[c] = 1;
        }
        if(k > 195){
            for(int i = 1 ; i <= u ; ++i){
                f[i] = (tmp[i] == 0 ? 0 : -1e9);
                for(auto v : adj[i]){
                    f[i] = max(f[i] , f[v] + 1);
                }
            }
            cout << max(f[u] , -1) << '\n';
        }else{
            int res = -1;
            for(auto & c : can[u]){
                if(tmp[c.second] == 0){
                    res = c.first;break;
                }
            }
            cout << res << '\n';
        }
        for(auto & c : val){
            tmp[c] = 0;
        }
    }
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:49:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(j < can[v].size() && can[v][j] >= c)add(val , can[v][j++]);
                       ~~^~~~~~~~~~~~~~~
bitaro.cpp:52:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(j < can[v].size())add(val , can[v][j++]);
                   ~~^~~~~~~~~~~~~~~
bitaro.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 12 ms 5376 KB Output is correct
6 Correct 10 ms 5376 KB Output is correct
7 Correct 11 ms 5376 KB Output is correct
8 Correct 15 ms 6528 KB Output is correct
9 Correct 16 ms 6528 KB Output is correct
10 Correct 16 ms 6528 KB Output is correct
11 Correct 14 ms 6400 KB Output is correct
12 Correct 14 ms 5888 KB Output is correct
13 Correct 17 ms 6400 KB Output is correct
14 Correct 14 ms 5888 KB Output is correct
15 Correct 12 ms 5504 KB Output is correct
16 Correct 14 ms 5888 KB Output is correct
17 Correct 17 ms 6016 KB Output is correct
18 Correct 13 ms 5760 KB Output is correct
19 Correct 14 ms 6144 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 12 ms 5376 KB Output is correct
6 Correct 10 ms 5376 KB Output is correct
7 Correct 11 ms 5376 KB Output is correct
8 Correct 15 ms 6528 KB Output is correct
9 Correct 16 ms 6528 KB Output is correct
10 Correct 16 ms 6528 KB Output is correct
11 Correct 14 ms 6400 KB Output is correct
12 Correct 14 ms 5888 KB Output is correct
13 Correct 17 ms 6400 KB Output is correct
14 Correct 14 ms 5888 KB Output is correct
15 Correct 12 ms 5504 KB Output is correct
16 Correct 14 ms 5888 KB Output is correct
17 Correct 17 ms 6016 KB Output is correct
18 Correct 13 ms 5760 KB Output is correct
19 Correct 14 ms 6144 KB Output is correct
20 Correct 671 ms 9208 KB Output is correct
21 Correct 645 ms 9080 KB Output is correct
22 Correct 661 ms 9080 KB Output is correct
23 Correct 701 ms 9188 KB Output is correct
24 Correct 810 ms 119288 KB Output is correct
25 Correct 856 ms 123104 KB Output is correct
26 Correct 867 ms 123000 KB Output is correct
27 Correct 820 ms 168440 KB Output is correct
28 Correct 836 ms 168440 KB Output is correct
29 Correct 828 ms 168552 KB Output is correct
30 Correct 879 ms 168340 KB Output is correct
31 Correct 875 ms 164240 KB Output is correct
32 Correct 865 ms 168440 KB Output is correct
33 Correct 718 ms 107180 KB Output is correct
34 Correct 670 ms 92292 KB Output is correct
35 Correct 720 ms 106744 KB Output is correct
36 Correct 824 ms 138212 KB Output is correct
37 Correct 787 ms 127992 KB Output is correct
38 Correct 798 ms 138232 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 12 ms 5376 KB Output is correct
6 Correct 10 ms 5376 KB Output is correct
7 Correct 11 ms 5376 KB Output is correct
8 Correct 15 ms 6528 KB Output is correct
9 Correct 16 ms 6528 KB Output is correct
10 Correct 16 ms 6528 KB Output is correct
11 Correct 14 ms 6400 KB Output is correct
12 Correct 14 ms 5888 KB Output is correct
13 Correct 17 ms 6400 KB Output is correct
14 Correct 14 ms 5888 KB Output is correct
15 Correct 12 ms 5504 KB Output is correct
16 Correct 14 ms 5888 KB Output is correct
17 Correct 17 ms 6016 KB Output is correct
18 Correct 13 ms 5760 KB Output is correct
19 Correct 14 ms 6144 KB Output is correct
20 Correct 671 ms 9208 KB Output is correct
21 Correct 645 ms 9080 KB Output is correct
22 Correct 661 ms 9080 KB Output is correct
23 Correct 701 ms 9188 KB Output is correct
24 Correct 810 ms 119288 KB Output is correct
25 Correct 856 ms 123104 KB Output is correct
26 Correct 867 ms 123000 KB Output is correct
27 Correct 820 ms 168440 KB Output is correct
28 Correct 836 ms 168440 KB Output is correct
29 Correct 828 ms 168552 KB Output is correct
30 Correct 879 ms 168340 KB Output is correct
31 Correct 875 ms 164240 KB Output is correct
32 Correct 865 ms 168440 KB Output is correct
33 Correct 718 ms 107180 KB Output is correct
34 Correct 670 ms 92292 KB Output is correct
35 Correct 720 ms 106744 KB Output is correct
36 Correct 824 ms 138212 KB Output is correct
37 Correct 787 ms 127992 KB Output is correct
38 Correct 798 ms 138232 KB Output is correct
39 Correct 967 ms 119616 KB Output is correct
40 Correct 892 ms 120824 KB Output is correct
41 Correct 908 ms 121208 KB Output is correct
42 Correct 950 ms 121464 KB Output is correct
43 Correct 874 ms 120616 KB Output is correct
44 Correct 690 ms 9824 KB Output is correct
45 Correct 676 ms 9464 KB Output is correct
46 Correct 682 ms 9428 KB Output is correct
47 Correct 687 ms 9464 KB Output is correct
48 Correct 663 ms 9208 KB Output is correct
49 Correct 932 ms 168004 KB Output is correct
50 Correct 892 ms 167544 KB Output is correct
51 Correct 694 ms 9256 KB Output is correct
52 Correct 658 ms 8824 KB Output is correct
53 Correct 908 ms 137044 KB Output is correct
54 Correct 918 ms 127224 KB Output is correct
55 Correct 883 ms 136696 KB Output is correct
56 Correct 823 ms 127444 KB Output is correct
57 Correct 731 ms 9292 KB Output is correct
58 Correct 714 ms 9208 KB Output is correct
59 Correct 680 ms 8952 KB Output is correct
60 Correct 664 ms 8800 KB Output is correct
61 Correct 953 ms 167544 KB Output is correct
62 Correct 937 ms 137340 KB Output is correct
63 Correct 908 ms 126840 KB Output is correct
64 Correct 1119 ms 167672 KB Output is correct
65 Correct 1054 ms 136952 KB Output is correct
66 Correct 1106 ms 127588 KB Output is correct
67 Correct 1108 ms 167672 KB Output is correct
68 Correct 1033 ms 137568 KB Output is correct
69 Correct 1045 ms 125944 KB Output is correct
70 Correct 912 ms 167808 KB Output is correct
71 Correct 871 ms 137464 KB Output is correct
72 Correct 840 ms 127480 KB Output is correct
73 Correct 920 ms 167860 KB Output is correct
74 Correct 868 ms 137480 KB Output is correct
75 Correct 865 ms 127224 KB Output is correct
76 Correct 967 ms 167932 KB Output is correct
77 Correct 946 ms 167700 KB Output is correct
78 Correct 899 ms 167672 KB Output is correct
79 Correct 681 ms 8952 KB Output is correct
80 Correct 672 ms 8440 KB Output is correct
81 Correct 660 ms 8440 KB Output is correct
82 Correct 961 ms 167804 KB Output is correct
83 Correct 982 ms 163168 KB Output is correct
84 Correct 957 ms 167672 KB Output is correct
85 Correct 966 ms 162936 KB Output is correct
86 Correct 914 ms 167672 KB Output is correct
87 Correct 935 ms 163448 KB Output is correct
88 Correct 700 ms 8824 KB Output is correct
89 Correct 711 ms 8824 KB Output is correct
90 Correct 715 ms 8568 KB Output is correct
91 Correct 674 ms 8572 KB Output is correct
92 Correct 728 ms 8684 KB Output is correct
93 Correct 688 ms 8568 KB Output is correct
94 Correct 790 ms 106360 KB Output is correct
95 Correct 793 ms 90768 KB Output is correct
96 Correct 841 ms 105876 KB Output is correct
97 Correct 744 ms 92500 KB Output is correct
98 Correct 753 ms 106276 KB Output is correct
99 Correct 716 ms 91896 KB Output is correct
100 Correct 764 ms 8888 KB Output is correct
101 Correct 748 ms 8952 KB Output is correct
102 Correct 724 ms 8440 KB Output is correct
103 Correct 732 ms 8492 KB Output is correct
104 Correct 724 ms 8568 KB Output is correct
105 Correct 701 ms 8568 KB Output is correct
106 Correct 903 ms 136440 KB Output is correct
107 Correct 881 ms 126840 KB Output is correct
108 Correct 895 ms 137208 KB Output is correct
109 Correct 886 ms 126584 KB Output is correct
110 Correct 933 ms 137592 KB Output is correct
111 Correct 853 ms 127224 KB Output is correct
112 Correct 772 ms 8800 KB Output is correct
113 Correct 716 ms 8696 KB Output is correct
114 Correct 696 ms 8340 KB Output is correct
115 Correct 686 ms 8312 KB Output is correct
116 Correct 651 ms 8312 KB Output is correct
117 Correct 684 ms 8348 KB Output is correct
118 Correct 932 ms 166648 KB Output is correct
119 Correct 878 ms 136712 KB Output is correct
120 Correct 854 ms 126328 KB Output is correct
121 Correct 942 ms 166776 KB Output is correct
122 Correct 878 ms 136032 KB Output is correct
123 Correct 899 ms 125888 KB Output is correct
124 Correct 938 ms 166648 KB Output is correct
125 Correct 911 ms 136700 KB Output is correct
126 Correct 851 ms 125600 KB Output is correct