oj.uz

Submission #241589

# Submission time Handle Problem Language Result Execution time Memory
241589 2020-06-24T15:27:41 Z Mercenary Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1453 ms 248692 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() == 300 || 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 > 280){
            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 7 ms 4992 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 11 ms 5376 KB Output is correct
6 Correct 11 ms 5376 KB Output is correct
7 Correct 12 ms 5376 KB Output is correct
8 Correct 17 ms 7168 KB Output is correct
9 Correct 17 ms 7168 KB Output is correct
10 Correct 17 ms 7168 KB Output is correct
11 Correct 17 ms 6912 KB Output is correct
12 Correct 15 ms 6016 KB Output is correct
13 Correct 17 ms 6912 KB Output is correct
14 Correct 16 ms 6272 KB Output is correct
15 Correct 13 ms 5632 KB Output is correct
16 Correct 16 ms 6272 KB Output is correct
17 Correct 15 ms 6400 KB Output is correct
18 Correct 14 ms 5888 KB Output is correct
19 Correct 16 ms 6400 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 11 ms 5376 KB Output is correct
6 Correct 11 ms 5376 KB Output is correct
7 Correct 12 ms 5376 KB Output is correct
8 Correct 17 ms 7168 KB Output is correct
9 Correct 17 ms 7168 KB Output is correct
10 Correct 17 ms 7168 KB Output is correct
11 Correct 17 ms 6912 KB Output is correct
12 Correct 15 ms 6016 KB Output is correct
13 Correct 17 ms 6912 KB Output is correct
14 Correct 16 ms 6272 KB Output is correct
15 Correct 13 ms 5632 KB Output is correct
16 Correct 16 ms 6272 KB Output is correct
17 Correct 15 ms 6400 KB Output is correct
18 Correct 14 ms 5888 KB Output is correct
19 Correct 16 ms 6400 KB Output is correct
20 Correct 959 ms 9900 KB Output is correct
21 Correct 876 ms 9764 KB Output is correct
22 Correct 933 ms 9804 KB Output is correct
23 Correct 1004 ms 10132 KB Output is correct
24 Correct 1039 ms 159140 KB Output is correct
25 Correct 1063 ms 165752 KB Output is correct
26 Correct 1099 ms 165624 KB Output is correct
27 Correct 1133 ms 247544 KB Output is correct
28 Correct 1175 ms 247596 KB Output is correct
29 Correct 1144 ms 247620 KB Output is correct
30 Correct 1154 ms 247104 KB Output is correct
31 Correct 1152 ms 239352 KB Output is correct
32 Correct 1158 ms 247160 KB Output is correct
33 Correct 946 ms 155012 KB Output is correct
34 Correct 888 ms 129456 KB Output is correct
35 Correct 947 ms 153976 KB Output is correct
36 Correct 1103 ms 201344 KB Output is correct
37 Correct 1041 ms 183544 KB Output is correct
38 Correct 1096 ms 201792 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 11 ms 5376 KB Output is correct
6 Correct 11 ms 5376 KB Output is correct
7 Correct 12 ms 5376 KB Output is correct
8 Correct 17 ms 7168 KB Output is correct
9 Correct 17 ms 7168 KB Output is correct
10 Correct 17 ms 7168 KB Output is correct
11 Correct 17 ms 6912 KB Output is correct
12 Correct 15 ms 6016 KB Output is correct
13 Correct 17 ms 6912 KB Output is correct
14 Correct 16 ms 6272 KB Output is correct
15 Correct 13 ms 5632 KB Output is correct
16 Correct 16 ms 6272 KB Output is correct
17 Correct 15 ms 6400 KB Output is correct
18 Correct 14 ms 5888 KB Output is correct
19 Correct 16 ms 6400 KB Output is correct
20 Correct 959 ms 9900 KB Output is correct
21 Correct 876 ms 9764 KB Output is correct
22 Correct 933 ms 9804 KB Output is correct
23 Correct 1004 ms 10132 KB Output is correct
24 Correct 1039 ms 159140 KB Output is correct
25 Correct 1063 ms 165752 KB Output is correct
26 Correct 1099 ms 165624 KB Output is correct
27 Correct 1133 ms 247544 KB Output is correct
28 Correct 1175 ms 247596 KB Output is correct
29 Correct 1144 ms 247620 KB Output is correct
30 Correct 1154 ms 247104 KB Output is correct
31 Correct 1152 ms 239352 KB Output is correct
32 Correct 1158 ms 247160 KB Output is correct
33 Correct 946 ms 155012 KB Output is correct
34 Correct 888 ms 129456 KB Output is correct
35 Correct 947 ms 153976 KB Output is correct
36 Correct 1103 ms 201344 KB Output is correct
37 Correct 1041 ms 183544 KB Output is correct
38 Correct 1096 ms 201792 KB Output is correct
39 Correct 1160 ms 162016 KB Output is correct
40 Correct 1111 ms 162680 KB Output is correct
41 Correct 1126 ms 163848 KB Output is correct
42 Correct 1197 ms 163548 KB Output is correct
43 Correct 1124 ms 162996 KB Output is correct
44 Correct 993 ms 11384 KB Output is correct
45 Correct 953 ms 10332 KB Output is correct
46 Correct 929 ms 10360 KB Output is correct
47 Correct 935 ms 10068 KB Output is correct
48 Correct 929 ms 9976 KB Output is correct
49 Correct 1267 ms 248184 KB Output is correct
50 Correct 1233 ms 247008 KB Output is correct
51 Correct 923 ms 10796 KB Output is correct
52 Correct 888 ms 9988 KB Output is correct
53 Correct 1226 ms 201208 KB Output is correct
54 Correct 1187 ms 184692 KB Output is correct
55 Correct 1150 ms 200280 KB Output is correct
56 Correct 1126 ms 183916 KB Output is correct
57 Correct 981 ms 11076 KB Output is correct
58 Correct 1002 ms 11180 KB Output is correct
59 Correct 958 ms 10232 KB Output is correct
60 Correct 964 ms 10152 KB Output is correct
61 Correct 1286 ms 247416 KB Output is correct
62 Correct 1252 ms 201592 KB Output is correct
63 Correct 1182 ms 183288 KB Output is correct
64 Correct 1453 ms 247368 KB Output is correct
65 Correct 1327 ms 200696 KB Output is correct
66 Correct 1295 ms 184440 KB Output is correct
67 Correct 1251 ms 247172 KB Output is correct
68 Correct 1210 ms 201056 KB Output is correct
69 Correct 1149 ms 181496 KB Output is correct
70 Correct 1238 ms 247612 KB Output is correct
71 Correct 1143 ms 201592 KB Output is correct
72 Correct 1179 ms 184004 KB Output is correct
73 Correct 1258 ms 247600 KB Output is correct
74 Correct 1195 ms 201600 KB Output is correct
75 Correct 1120 ms 184056 KB Output is correct
76 Correct 1306 ms 248692 KB Output is correct
77 Correct 1278 ms 247216 KB Output is correct
78 Correct 1258 ms 247808 KB Output is correct
79 Correct 917 ms 11100 KB Output is correct
80 Correct 906 ms 10232 KB Output is correct
81 Correct 873 ms 9792 KB Output is correct
82 Correct 1289 ms 248384 KB Output is correct
83 Correct 1377 ms 240580 KB Output is correct
84 Correct 1290 ms 247224 KB Output is correct
85 Correct 1334 ms 239224 KB Output is correct
86 Correct 1264 ms 247544 KB Output is correct
87 Correct 1274 ms 239988 KB Output is correct
88 Correct 997 ms 11128 KB Output is correct
89 Correct 1016 ms 11128 KB Output is correct
90 Correct 982 ms 10360 KB Output is correct
91 Correct 985 ms 10360 KB Output is correct
92 Correct 964 ms 9976 KB Output is correct
93 Correct 957 ms 9848 KB Output is correct
94 Correct 1113 ms 156280 KB Output is correct
95 Correct 992 ms 129784 KB Output is correct
96 Correct 1018 ms 154380 KB Output is correct
97 Correct 969 ms 130928 KB Output is correct
98 Correct 1010 ms 155388 KB Output is correct
99 Correct 956 ms 130808 KB Output is correct
100 Correct 1048 ms 11256 KB Output is correct
101 Correct 1062 ms 11172 KB Output is correct
102 Correct 1050 ms 10224 KB Output is correct
103 Correct 1062 ms 10232 KB Output is correct
104 Correct 1020 ms 9900 KB Output is correct
105 Correct 1014 ms 10008 KB Output is correct
106 Correct 1241 ms 201848 KB Output is correct
107 Correct 1161 ms 184824 KB Output is correct
108 Correct 1207 ms 201976 KB Output is correct
109 Correct 1157 ms 183416 KB Output is correct
110 Correct 1194 ms 202360 KB Output is correct
111 Correct 1119 ms 184544 KB Output is correct
112 Correct 1008 ms 11212 KB Output is correct
113 Correct 993 ms 11224 KB Output is correct
114 Correct 947 ms 10360 KB Output is correct
115 Correct 978 ms 10360 KB Output is correct
116 Correct 956 ms 9848 KB Output is correct
117 Correct 963 ms 9848 KB Output is correct
118 Correct 1308 ms 246872 KB Output is correct
119 Correct 1154 ms 201464 KB Output is correct
120 Correct 1121 ms 183268 KB Output is correct
121 Correct 1247 ms 247064 KB Output is correct
122 Correct 1173 ms 200568 KB Output is correct
123 Correct 1121 ms 183288 KB Output is correct
124 Correct 1260 ms 247148 KB Output is correct
125 Correct 1159 ms 201712 KB Output is correct
126 Correct 1130 ms 182832 KB Output is correct