oj.uz

Submission #476143

# Submission time Handle Problem Language Result Execution time Memory
476143 2021-09-25T01:23:08 Z Blobo2_Blobo2 Political Development (BOI17_politicaldevelopment) C++14
39 / 100
 3000 ms 30480 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")
#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;
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;
        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
    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++)
            dfs(i);
    }
    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:28:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |     if(path.size()+1 == now){
      |        ~~~~~~~~~~~~~~^~~~~~
politicaldevelopment.cpp:35:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for(int i=0;i<path.size();i++)if(path[i] == v)bos_ana_zh2t = 1;
      |                     ~^~~~~~~~~~~~
politicaldevelopment.cpp:38:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for(int i=0;i<path.size();i++){
      |                     ~^~~~~~~~~~~~

Subtask #1
4.0 / 4.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 7 ms 5316 KB Output is correct
4 Correct 7 ms 5264 KB Output is correct
5 Correct 5 ms 5324 KB Output is correct
6 Correct 5 ms 5324 KB Output is correct
7 Correct 6 ms 5388 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 4 ms 4172 KB Output is correct

Subtask #2
12.0 / 12.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 7 ms 5316 KB Output is correct
4 Correct 7 ms 5264 KB Output is correct
5 Correct 5 ms 5324 KB Output is correct
6 Correct 5 ms 5324 KB Output is correct
7 Correct 6 ms 5388 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 4 ms 4172 KB Output is correct
11 Correct 5 ms 5264 KB Output is correct
12 Correct 378 ms 5356 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 383 ms 5348 KB Output is correct
15 Correct 4 ms 4172 KB Output is correct
16 Correct 15 ms 5388 KB Output is correct
17 Correct 3 ms 4116 KB Output is correct
18 Correct 14 ms 5324 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 4 ms 5008 KB Output is correct
21 Correct 5 ms 5068 KB Output is correct
22 Correct 3 ms 4172 KB Output is correct
23 Correct 6 ms 5324 KB Output is correct
24 Correct 3 ms 4172 KB Output is correct
25 Correct 7 ms 5324 KB Output is correct
26 Correct 7 ms 5324 KB Output is correct
27 Correct 6 ms 5196 KB Output is correct
28 Correct 7 ms 5324 KB Output is correct
29 Correct 6 ms 5196 KB Output is correct
30 Correct 125 ms 5572 KB Output is correct
31 Correct 7 ms 5324 KB Output is correct
32 Correct 124 ms 5392 KB Output is correct
33 Correct 8 ms 5324 KB Output is correct
34 Correct 10 ms 5324 KB Output is correct
35 Correct 5 ms 4752 KB Output is correct
36 Correct 5 ms 4812 KB Output is correct
37 Correct 5 ms 4812 KB Output is correct
38 Correct 6 ms 4556 KB Output is correct
39 Correct 6 ms 4556 KB Output is correct
40 Correct 8 ms 5696 KB Output is correct
41 Correct 6 ms 4556 KB Output is correct
42 Correct 8 ms 5704 KB Output is correct
43 Correct 8 ms 5688 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4236 KB Output is correct
2 Correct 3 ms 4224 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 4228 KB Output is correct
6 Correct 3 ms 4224 KB Output is correct
7 Correct 4 ms 4172 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 2033 ms 30336 KB Output is correct
12 Correct 3 ms 4172 KB Output is correct
13 Correct 636 ms 30348 KB Output is correct
14 Correct 3 ms 4172 KB Output is correct
15 Correct 2005 ms 30336 KB Output is correct
16 Correct 749 ms 30404 KB Output is correct
17 Correct 627 ms 30348 KB Output is correct
18 Correct 791 ms 30480 KB Output is correct

Subtask #4
0 / 38.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 7 ms 5316 KB Output is correct
4 Correct 7 ms 5264 KB Output is correct
5 Correct 5 ms 5324 KB Output is correct
6 Correct 5 ms 5324 KB Output is correct
7 Correct 6 ms 5388 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 4 ms 4172 KB Output is correct
11 Correct 5 ms 5264 KB Output is correct
12 Correct 378 ms 5356 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 383 ms 5348 KB Output is correct
15 Correct 4 ms 4172 KB Output is correct
16 Correct 15 ms 5388 KB Output is correct
17 Correct 3 ms 4116 KB Output is correct
18 Correct 14 ms 5324 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 4 ms 5008 KB Output is correct
21 Correct 5 ms 5068 KB Output is correct
22 Correct 3 ms 4172 KB Output is correct
23 Correct 6 ms 5324 KB Output is correct
24 Correct 3 ms 4172 KB Output is correct
25 Correct 7 ms 5324 KB Output is correct
26 Correct 7 ms 5324 KB Output is correct
27 Correct 6 ms 5196 KB Output is correct
28 Correct 7 ms 5324 KB Output is correct
29 Correct 6 ms 5196 KB Output is correct
30 Correct 125 ms 5572 KB Output is correct
31 Correct 7 ms 5324 KB Output is correct
32 Correct 124 ms 5392 KB Output is correct
33 Correct 8 ms 5324 KB Output is correct
34 Correct 10 ms 5324 KB Output is correct
35 Correct 5 ms 4752 KB Output is correct
36 Correct 5 ms 4812 KB Output is correct
37 Correct 5 ms 4812 KB Output is correct
38 Correct 6 ms 4556 KB Output is correct
39 Correct 6 ms 4556 KB Output is correct
40 Correct 8 ms 5696 KB Output is correct
41 Correct 6 ms 4556 KB Output is correct
42 Correct 8 ms 5704 KB Output is correct
43 Correct 8 ms 5688 KB Output is correct
44 Correct 307 ms 6444 KB Output is correct
45 Correct 3 ms 4172 KB Output is correct
46 Correct 9 ms 5580 KB Output is correct
47 Correct 38 ms 6580 KB Output is correct
48 Correct 13 ms 5648 KB Output is correct
49 Correct 39 ms 6548 KB Output is correct
50 Correct 93 ms 6628 KB Output is correct
51 Correct 20 ms 8524 KB Output is correct
52 Correct 5 ms 5324 KB Output is correct
53 Execution timed out 3073 ms 8988 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #5
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 7 ms 5316 KB Output is correct
4 Correct 7 ms 5264 KB Output is correct
5 Correct 5 ms 5324 KB Output is correct
6 Correct 5 ms 5324 KB Output is correct
7 Correct 6 ms 5388 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 4 ms 4172 KB Output is correct
11 Correct 5 ms 5264 KB Output is correct
12 Correct 378 ms 5356 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 383 ms 5348 KB Output is correct
15 Correct 4 ms 4172 KB Output is correct
16 Correct 15 ms 5388 KB Output is correct
17 Correct 3 ms 4116 KB Output is correct
18 Correct 14 ms 5324 KB Output is correct
19 Correct 3 ms 4172 KB Output is correct
20 Correct 4 ms 5008 KB Output is correct
21 Correct 5 ms 5068 KB Output is correct
22 Correct 3 ms 4172 KB Output is correct
23 Correct 6 ms 5324 KB Output is correct
24 Correct 3 ms 4172 KB Output is correct
25 Correct 7 ms 5324 KB Output is correct
26 Correct 7 ms 5324 KB Output is correct
27 Correct 6 ms 5196 KB Output is correct
28 Correct 7 ms 5324 KB Output is correct
29 Correct 6 ms 5196 KB Output is correct
30 Correct 125 ms 5572 KB Output is correct
31 Correct 7 ms 5324 KB Output is correct
32 Correct 124 ms 5392 KB Output is correct
33 Correct 8 ms 5324 KB Output is correct
34 Correct 10 ms 5324 KB Output is correct
35 Correct 5 ms 4752 KB Output is correct
36 Correct 5 ms 4812 KB Output is correct
37 Correct 5 ms 4812 KB Output is correct
38 Correct 6 ms 4556 KB Output is correct
39 Correct 6 ms 4556 KB Output is correct
40 Correct 8 ms 5696 KB Output is correct
41 Correct 6 ms 4556 KB Output is correct
42 Correct 8 ms 5704 KB Output is correct
43 Correct 8 ms 5688 KB Output is correct
44 Correct 3 ms 4228 KB Output is correct
45 Correct 95 ms 23404 KB Output is correct
46 Execution timed out 3064 ms 17308 KB Time limit exceeded
47 Halted 0 ms 0 KB -