oj.uz

답안 #472465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472465 2021-09-13T15:46:40 Z Blobo2_Blobo2 Political Development (BOI17_politicaldevelopment) C++14
16 / 100
 3000 ms 29764 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];
set<int>st[50001];
bool vis[50001];
vector<int>path;
void dfs(int u){
    if(path.size()+1 == now){
        cout<<now<<endl;
        exit(0);
    }
    vis[u] = 1;
    path.push_back(u);
    for(auto v:adj[u]){
        if(!vis[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++){
            dfs(i);
            memset(vis,0,sizeof vis);
        }
    }
    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:38:26: 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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 5 ms 4428 KB Output is correct
4 Correct 6 ms 4428 KB Output is correct
5 Correct 5 ms 4428 KB Output is correct
6 Correct 6 ms 4428 KB Output is correct
7 Correct 5 ms 4392 KB Output is correct
8 Correct 12 ms 3880 KB Output is correct
9 Correct 3 ms 3788 KB Output is correct
10 Correct 3 ms 3844 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 5 ms 4428 KB Output is correct
4 Correct 6 ms 4428 KB Output is correct
5 Correct 5 ms 4428 KB Output is correct
6 Correct 6 ms 4428 KB Output is correct
7 Correct 5 ms 4392 KB Output is correct
8 Correct 12 ms 3880 KB Output is correct
9 Correct 3 ms 3788 KB Output is correct
10 Correct 3 ms 3844 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 2998 ms 4584 KB Output is correct
13 Correct 3 ms 3788 KB Output is correct
14 Correct 2950 ms 4576 KB Output is correct
15 Correct 3 ms 3788 KB Output is correct
16 Correct 34 ms 4596 KB Output is correct
17 Correct 3 ms 3788 KB Output is correct
18 Correct 35 ms 4556 KB Output is correct
19 Correct 20 ms 3892 KB Output is correct
20 Correct 8 ms 4232 KB Output is correct
21 Correct 5 ms 4240 KB Output is correct
22 Correct 11 ms 3848 KB Output is correct
23 Correct 7 ms 4684 KB Output is correct
24 Correct 13 ms 3788 KB Output is correct
25 Correct 10 ms 4684 KB Output is correct
26 Correct 16 ms 4624 KB Output is correct
27 Correct 14 ms 4556 KB Output is correct
28 Correct 16 ms 4556 KB Output is correct
29 Correct 14 ms 4568 KB Output is correct
30 Correct 567 ms 4740 KB Output is correct
31 Correct 20 ms 4684 KB Output is correct
32 Correct 619 ms 4736 KB Output is correct
33 Correct 17 ms 4684 KB Output is correct
34 Correct 16 ms 4740 KB Output is correct
35 Correct 10 ms 4308 KB Output is correct
36 Correct 10 ms 4236 KB Output is correct
37 Correct 10 ms 4236 KB Output is correct
38 Correct 11 ms 4172 KB Output is correct
39 Correct 14 ms 4180 KB Output is correct
40 Correct 10 ms 5044 KB Output is correct
41 Correct 11 ms 4108 KB Output is correct
42 Correct 10 ms 5068 KB Output is correct
43 Correct 8 ms 5068 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3816 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 3 ms 3788 KB Output is correct
4 Correct 3 ms 3788 KB Output is correct
5 Correct 3 ms 3788 KB Output is correct
6 Correct 3 ms 3788 KB Output is correct
7 Correct 3 ms 3788 KB Output is correct
8 Correct 3 ms 3840 KB Output is correct
9 Correct 3 ms 3840 KB Output is correct
10 Correct 3 ms 3788 KB Output is correct
11 Execution timed out 3088 ms 29764 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 5 ms 4428 KB Output is correct
4 Correct 6 ms 4428 KB Output is correct
5 Correct 5 ms 4428 KB Output is correct
6 Correct 6 ms 4428 KB Output is correct
7 Correct 5 ms 4392 KB Output is correct
8 Correct 12 ms 3880 KB Output is correct
9 Correct 3 ms 3788 KB Output is correct
10 Correct 3 ms 3844 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 2998 ms 4584 KB Output is correct
13 Correct 3 ms 3788 KB Output is correct
14 Correct 2950 ms 4576 KB Output is correct
15 Correct 3 ms 3788 KB Output is correct
16 Correct 34 ms 4596 KB Output is correct
17 Correct 3 ms 3788 KB Output is correct
18 Correct 35 ms 4556 KB Output is correct
19 Correct 20 ms 3892 KB Output is correct
20 Correct 8 ms 4232 KB Output is correct
21 Correct 5 ms 4240 KB Output is correct
22 Correct 11 ms 3848 KB Output is correct
23 Correct 7 ms 4684 KB Output is correct
24 Correct 13 ms 3788 KB Output is correct
25 Correct 10 ms 4684 KB Output is correct
26 Correct 16 ms 4624 KB Output is correct
27 Correct 14 ms 4556 KB Output is correct
28 Correct 16 ms 4556 KB Output is correct
29 Correct 14 ms 4568 KB Output is correct
30 Correct 567 ms 4740 KB Output is correct
31 Correct 20 ms 4684 KB Output is correct
32 Correct 619 ms 4736 KB Output is correct
33 Correct 17 ms 4684 KB Output is correct
34 Correct 16 ms 4740 KB Output is correct
35 Correct 10 ms 4308 KB Output is correct
36 Correct 10 ms 4236 KB Output is correct
37 Correct 10 ms 4236 KB Output is correct
38 Correct 11 ms 4172 KB Output is correct
39 Correct 14 ms 4180 KB Output is correct
40 Correct 10 ms 5044 KB Output is correct
41 Correct 11 ms 4108 KB Output is correct
42 Correct 10 ms 5068 KB Output is correct
43 Correct 8 ms 5068 KB Output is correct
44 Correct 12 ms 6092 KB Output is correct
45 Correct 3 ms 3792 KB Output is correct
46 Correct 8 ms 5068 KB Output is correct
47 Correct 56 ms 6160 KB Output is correct
48 Correct 28 ms 5040 KB Output is correct
49 Correct 56 ms 6220 KB Output is correct
50 Correct 140 ms 6192 KB Output is correct
51 Correct 25 ms 8444 KB Output is correct
52 Correct 7 ms 4428 KB Output is correct
53 Execution timed out 3068 ms 9060 KB Time limit exceeded
54 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 5 ms 4428 KB Output is correct
4 Correct 6 ms 4428 KB Output is correct
5 Correct 5 ms 4428 KB Output is correct
6 Correct 6 ms 4428 KB Output is correct
7 Correct 5 ms 4392 KB Output is correct
8 Correct 12 ms 3880 KB Output is correct
9 Correct 3 ms 3788 KB Output is correct
10 Correct 3 ms 3844 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 2998 ms 4584 KB Output is correct
13 Correct 3 ms 3788 KB Output is correct
14 Correct 2950 ms 4576 KB Output is correct
15 Correct 3 ms 3788 KB Output is correct
16 Correct 34 ms 4596 KB Output is correct
17 Correct 3 ms 3788 KB Output is correct
18 Correct 35 ms 4556 KB Output is correct
19 Correct 20 ms 3892 KB Output is correct
20 Correct 8 ms 4232 KB Output is correct
21 Correct 5 ms 4240 KB Output is correct
22 Correct 11 ms 3848 KB Output is correct
23 Correct 7 ms 4684 KB Output is correct
24 Correct 13 ms 3788 KB Output is correct
25 Correct 10 ms 4684 KB Output is correct
26 Correct 16 ms 4624 KB Output is correct
27 Correct 14 ms 4556 KB Output is correct
28 Correct 16 ms 4556 KB Output is correct
29 Correct 14 ms 4568 KB Output is correct
30 Correct 567 ms 4740 KB Output is correct
31 Correct 20 ms 4684 KB Output is correct
32 Correct 619 ms 4736 KB Output is correct
33 Correct 17 ms 4684 KB Output is correct
34 Correct 16 ms 4740 KB Output is correct
35 Correct 10 ms 4308 KB Output is correct
36 Correct 10 ms 4236 KB Output is correct
37 Correct 10 ms 4236 KB Output is correct
38 Correct 11 ms 4172 KB Output is correct
39 Correct 14 ms 4180 KB Output is correct
40 Correct 10 ms 5044 KB Output is correct
41 Correct 11 ms 4108 KB Output is correct
42 Correct 10 ms 5068 KB Output is correct
43 Correct 8 ms 5068 KB Output is correct
44 Correct 3 ms 3840 KB Output is correct
45 Correct 125 ms 21992 KB Output is correct
46 Execution timed out 3093 ms 13476 KB Time limit exceeded
47 Halted 0 ms 0 KB -