oj.uz

Submission #472532

# Submission time Handle Problem Language Result Execution time Memory
472532 2021-09-13T17:07:20 Z Blobo2_Blobo2 Political Development (BOI17_politicaldevelopment) C++14
39 / 100
 3000 ms 27904 KB 
/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")
 
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0);
#define EPS 0.00000001
 
const int mo=1e9+7,INF=1e18;
int nxt(){int x;cin>>x;return x;}
int now=-1;
vector<int>adj[50001];
unordered_set<int>st[50001];
vector<int>path;
bool vis2[50001];
inline void dfs(int u){
    if(path.size()+1 == now){
        cout<<now<<endl;
        exit(0);
    }
    path.push_back(u);
    for(auto v:adj[u]){
        bool bos_ana_zh2t=0;
        for(int i=0;i<path.size();i++)if(path[i] == v)bos_ana_zh2t = 1;
        if(bos_ana_zh2t)continue;
        if(!vis2[v]){
            bool iwillgothere = 1;
            for(int i=0;i<path.size();i++){
                if(st[path[i]].find(v) != st[path[i]].end());
                else iwillgothere&=0;
            }
            if(iwillgothere)
                dfs(v);
        }
    }
    path.pop_back();
}
signed main(){
    Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty
    //freopen("in.txt","r",stdin);
    int n=nxt(),k=nxt();
    for(int i=0;i<n;i++){
        int sz = nxt();
        for(int j=0;j<sz;j++){
            int x=nxt();
            adj[i].push_back(x);
            st[i].insert(x);
        }
    }
    int ans = -1;
    for(ans = k;ans>=1;ans--){
        now = ans;
        for(int i =0;i<n;i++){
            vis2[i]=1;
            dfs(i);
        }
        for(int i=0;i<n;i++)vis2[i]=0;
    }
    return 0;
}

Compilation message

politicaldevelopment.cpp:21:24: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   21 | const int mo=1e9+7,INF=1e18;
      |                        ^~~~
politicaldevelopment.cpp: In function 'void dfs(int)':
politicaldevelopment.cpp:29:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |     if(path.size()+1 == now){
      |        ~~~~~~~~~~~~~~^~~~~~
politicaldevelopment.cpp:36:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for(int i=0;i<path.size();i++)if(path[i] == v)bos_ana_zh2t = 1;
      |                     ~^~~~~~~~~~~~
politicaldevelopment.cpp:40:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             for(int i=0;i<path.size();i++){
      |                         ~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 6 ms 5196 KB Output is correct
4 Correct 6 ms 5268 KB Output is correct
5 Correct 6 ms 5316 KB Output is correct
6 Correct 7 ms 5352 KB Output is correct
7 Correct 7 ms 5324 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 6 ms 5196 KB Output is correct
4 Correct 6 ms 5268 KB Output is correct
5 Correct 6 ms 5316 KB Output is correct
6 Correct 7 ms 5352 KB Output is correct
7 Correct 7 ms 5324 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 6 ms 5196 KB Output is correct
12 Correct 121 ms 5296 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 231 ms 5200 KB Output is correct
15 Correct 3 ms 4172 KB Output is correct
16 Correct 10 ms 5348 KB Output is correct
17 Correct 3 ms 4172 KB Output is correct
18 Correct 10 ms 5324 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 6 ms 5068 KB Output is correct
21 Correct 6 ms 5068 KB Output is correct
22 Correct 4 ms 4172 KB Output is correct
23 Correct 8 ms 5324 KB Output is correct
24 Correct 4 ms 4172 KB Output is correct
25 Correct 10 ms 5340 KB Output is correct
26 Correct 10 ms 5260 KB Output is correct
27 Correct 7 ms 5196 KB Output is correct
28 Correct 10 ms 5196 KB Output is correct
29 Correct 7 ms 5208 KB Output is correct
30 Correct 52 ms 5324 KB Output is correct
31 Correct 8 ms 5324 KB Output is correct
32 Correct 36 ms 5324 KB Output is correct
33 Correct 8 ms 5324 KB Output is correct
34 Correct 8 ms 5260 KB Output is correct
35 Correct 5 ms 4684 KB Output is correct
36 Correct 5 ms 4688 KB Output is correct
37 Correct 6 ms 4684 KB Output is correct
38 Correct 6 ms 4556 KB Output is correct
39 Correct 5 ms 4556 KB Output is correct
40 Correct 9 ms 5580 KB Output is correct
41 Correct 6 ms 4556 KB Output is correct
42 Correct 9 ms 5600 KB Output is correct
43 Correct 12 ms 5580 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4172 KB Output is correct
4 Correct 3 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 3 ms 4172 KB Output is correct
7 Correct 3 ms 4172 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 913 ms 27904 KB Output is correct
12 Correct 3 ms 4172 KB Output is correct
13 Correct 282 ms 27720 KB Output is correct
14 Correct 3 ms 4172 KB Output is correct
15 Correct 995 ms 27740 KB Output is correct
16 Correct 400 ms 27716 KB Output is correct
17 Correct 293 ms 27616 KB Output is correct
18 Correct 453 ms 27672 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 6 ms 5196 KB Output is correct
4 Correct 6 ms 5268 KB Output is correct
5 Correct 6 ms 5316 KB Output is correct
6 Correct 7 ms 5352 KB Output is correct
7 Correct 7 ms 5324 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 6 ms 5196 KB Output is correct
12 Correct 121 ms 5296 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 231 ms 5200 KB Output is correct
15 Correct 3 ms 4172 KB Output is correct
16 Correct 10 ms 5348 KB Output is correct
17 Correct 3 ms 4172 KB Output is correct
18 Correct 10 ms 5324 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 6 ms 5068 KB Output is correct
21 Correct 6 ms 5068 KB Output is correct
22 Correct 4 ms 4172 KB Output is correct
23 Correct 8 ms 5324 KB Output is correct
24 Correct 4 ms 4172 KB Output is correct
25 Correct 10 ms 5340 KB Output is correct
26 Correct 10 ms 5260 KB Output is correct
27 Correct 7 ms 5196 KB Output is correct
28 Correct 10 ms 5196 KB Output is correct
29 Correct 7 ms 5208 KB Output is correct
30 Correct 52 ms 5324 KB Output is correct
31 Correct 8 ms 5324 KB Output is correct
32 Correct 36 ms 5324 KB Output is correct
33 Correct 8 ms 5324 KB Output is correct
34 Correct 8 ms 5260 KB Output is correct
35 Correct 5 ms 4684 KB Output is correct
36 Correct 5 ms 4688 KB Output is correct
37 Correct 6 ms 4684 KB Output is correct
38 Correct 6 ms 4556 KB Output is correct
39 Correct 5 ms 4556 KB Output is correct
40 Correct 9 ms 5580 KB Output is correct
41 Correct 6 ms 4556 KB Output is correct
42 Correct 9 ms 5600 KB Output is correct
43 Correct 12 ms 5580 KB Output is correct
44 Correct 329 ms 6232 KB Output is correct
45 Correct 3 ms 4172 KB Output is correct
46 Correct 11 ms 5580 KB Output is correct
47 Correct 22 ms 6348 KB Output is correct
48 Correct 11 ms 5580 KB Output is correct
49 Correct 22 ms 6396 KB Output is correct
50 Correct 43 ms 6348 KB Output is correct
51 Correct 30 ms 8120 KB Output is correct
52 Correct 8 ms 5340 KB Output is correct
53 Execution timed out 3074 ms 8560 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 6 ms 5196 KB Output is correct
4 Correct 6 ms 5268 KB Output is correct
5 Correct 6 ms 5316 KB Output is correct
6 Correct 7 ms 5352 KB Output is correct
7 Correct 7 ms 5324 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4172 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 6 ms 5196 KB Output is correct
12 Correct 121 ms 5296 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 231 ms 5200 KB Output is correct
15 Correct 3 ms 4172 KB Output is correct
16 Correct 10 ms 5348 KB Output is correct
17 Correct 3 ms 4172 KB Output is correct
18 Correct 10 ms 5324 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 6 ms 5068 KB Output is correct
21 Correct 6 ms 5068 KB Output is correct
22 Correct 4 ms 4172 KB Output is correct
23 Correct 8 ms 5324 KB Output is correct
24 Correct 4 ms 4172 KB Output is correct
25 Correct 10 ms 5340 KB Output is correct
26 Correct 10 ms 5260 KB Output is correct
27 Correct 7 ms 5196 KB Output is correct
28 Correct 10 ms 5196 KB Output is correct
29 Correct 7 ms 5208 KB Output is correct
30 Correct 52 ms 5324 KB Output is correct
31 Correct 8 ms 5324 KB Output is correct
32 Correct 36 ms 5324 KB Output is correct
33 Correct 8 ms 5324 KB Output is correct
34 Correct 8 ms 5260 KB Output is correct
35 Correct 5 ms 4684 KB Output is correct
36 Correct 5 ms 4688 KB Output is correct
37 Correct 6 ms 4684 KB Output is correct
38 Correct 6 ms 4556 KB Output is correct
39 Correct 5 ms 4556 KB Output is correct
40 Correct 9 ms 5580 KB Output is correct
41 Correct 6 ms 4556 KB Output is correct
42 Correct 9 ms 5600 KB Output is correct
43 Correct 12 ms 5580 KB Output is correct
44 Correct 4 ms 4172 KB Output is correct
45 Correct 109 ms 21696 KB Output is correct
46 Correct 2457 ms 16332 KB Output is correct
47 Correct 122 ms 21684 KB Output is correct
48 Correct 95 ms 21680 KB Output is correct
49 Correct 37 ms 15148 KB Output is correct
50 Execution timed out 3067 ms 27224 KB Time limit exceeded
51 Halted 0 ms 0 KB -