oj.uz

Submission #129173

# Submission time Handle Problem Language Result Execution time Memory
129173 2019-07-11T18:54:09 Z Vardanyan Political Development (BOI17_politicaldevelopment) C++14
77 / 100
 3000 ms 23976 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 50*1000+5;
set<int> g[N];
int dp[(1<<11)];
int hv[11][11];
int main(){
    ios_base::sync_with_stdio(false);
    int n,k;
    cin>>n>>k;
    int x;
    for(int i = 0;i<n;i++){

        int q;
        cin>>q;
        while(q--){
            int x;
            cin>>x;
            g[i].insert(x);
        }
    }
    int anss = 1;
    while(1){
            memset(dp,0,sizeof(dp));
        int id = -1;
        for(int i = 0;i<n;i++){
            if(g[i].size()<k && g[i].size()){
                id = i;
                break;
            }
        }
        if(id == -1) break;
        /*if(sz == 1){
            anss = max(anss,sz+1);
            break;
        }*/
        vector<int> v;
        set<int>::iterator it;
        int ans = 1;
        for(it = g[id].begin();it!=g[id].end();++it){
            int to = *it;
            v.push_back(to);
            dp[(1<<(v.size()-1))] = 1;
            anss = max(anss,2);
        }
        memset(hv,0,sizeof(hv));
        for(int i = 0;i<v.size();i++){
            for(int j = i+1;j<v.size();j++){
                if(g[v[i]].find(v[j])!=g[v[i]].end()){
                    hv[i][j] = hv[j][i] = 1;
                }
            }
        }
        for(int i = 1;i<(1<<v.size());i++){
            if(!dp[i]) continue;
            for(int j = 0;j<v.size();j++){
                if((i>>j)&1 ) continue;
                bool f = true;
                for(int ii = 0;ii<v.size();ii++){
                    if((i>>ii)&1){
                        if(!hv[ii][j]){
                            f = false;
                            break;
                        }
                    }
                }
                if(f){
                    dp[i|(1<<j)] = max(dp[i|(1<<j)],dp[i]+1);
                    ans = max(ans,dp[i]+1);
                }
            }
        }
        anss = max(ans+1,anss);
      //  cout<<ans<<endl;
        for(int i = 0;i<v.size();i++){
            g[v[i]].erase(g[v[i]].find(id));
            g[id].erase(g[id].find(v[i]));
        }
        //if(ans == 1) break;
    }
    cout<<anss<<endl;
    return 0;
}

Compilation message

politicaldevelopment.cpp: In function 'int main()':
politicaldevelopment.cpp:27:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(g[i].size()<k && g[i].size()){
                ~~~~~~~~~~~^~
politicaldevelopment.cpp:47:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0;i<v.size();i++){
                       ~^~~~~~~~~
politicaldevelopment.cpp:48:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = i+1;j<v.size();j++){
                             ~^~~~~~~~~
politicaldevelopment.cpp:56:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0;j<v.size();j++){
                           ~^~~~~~~~~
politicaldevelopment.cpp:59:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int ii = 0;ii<v.size();ii++){
                                ~~^~~~~~~~~
politicaldevelopment.cpp:75:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0;i<v.size();i++){
                       ~^~~~~~~~~
politicaldevelopment.cpp:11:9: warning: unused variable 'x' [-Wunused-variable]
     int x;
         ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 50 ms 3292 KB Output is correct
4 Correct 23 ms 3192 KB Output is correct
5 Correct 23 ms 3192 KB Output is correct
6 Correct 25 ms 3192 KB Output is correct
7 Correct 25 ms 3196 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 50 ms 3292 KB Output is correct
4 Correct 23 ms 3192 KB Output is correct
5 Correct 23 ms 3192 KB Output is correct
6 Correct 25 ms 3192 KB Output is correct
7 Correct 25 ms 3196 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 23 ms 3192 KB Output is correct
12 Correct 23 ms 3112 KB Output is correct
13 Correct 4 ms 2656 KB Output is correct
14 Correct 24 ms 3208 KB Output is correct
15 Correct 4 ms 2652 KB Output is correct
16 Correct 26 ms 3192 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 25 ms 3192 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 10 ms 2936 KB Output is correct
21 Correct 10 ms 2936 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 28 ms 3192 KB Output is correct
24 Correct 4 ms 2680 KB Output is correct
25 Correct 28 ms 3320 KB Output is correct
26 Correct 25 ms 3192 KB Output is correct
27 Correct 15 ms 3192 KB Output is correct
28 Correct 24 ms 3192 KB Output is correct
29 Correct 15 ms 3192 KB Output is correct
30 Correct 27 ms 3324 KB Output is correct
31 Correct 27 ms 3320 KB Output is correct
32 Correct 26 ms 3320 KB Output is correct
33 Correct 26 ms 3320 KB Output is correct
34 Correct 26 ms 3320 KB Output is correct
35 Correct 10 ms 3064 KB Output is correct
36 Correct 11 ms 2936 KB Output is correct
37 Correct 10 ms 2936 KB Output is correct
38 Correct 6 ms 2936 KB Output is correct
39 Correct 7 ms 2936 KB Output is correct
40 Correct 61 ms 3672 KB Output is correct
41 Correct 7 ms 2936 KB Output is correct
42 Correct 61 ms 3576 KB Output is correct
43 Correct 62 ms 3576 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 5 ms 2680 KB Output is correct
3 Correct 5 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 5 ms 2728 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 5 ms 2680 KB Output is correct
11 Correct 2003 ms 23876 KB Output is correct
12 Correct 5 ms 2680 KB Output is correct
13 Correct 1989 ms 23928 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 1969 ms 23928 KB Output is correct
16 Correct 1991 ms 23884 KB Output is correct
17 Correct 1986 ms 23976 KB Output is correct
18 Correct 1982 ms 23800 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 50 ms 3292 KB Output is correct
4 Correct 23 ms 3192 KB Output is correct
5 Correct 23 ms 3192 KB Output is correct
6 Correct 25 ms 3192 KB Output is correct
7 Correct 25 ms 3196 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 23 ms 3192 KB Output is correct
12 Correct 23 ms 3112 KB Output is correct
13 Correct 4 ms 2656 KB Output is correct
14 Correct 24 ms 3208 KB Output is correct
15 Correct 4 ms 2652 KB Output is correct
16 Correct 26 ms 3192 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 25 ms 3192 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 10 ms 2936 KB Output is correct
21 Correct 10 ms 2936 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 28 ms 3192 KB Output is correct
24 Correct 4 ms 2680 KB Output is correct
25 Correct 28 ms 3320 KB Output is correct
26 Correct 25 ms 3192 KB Output is correct
27 Correct 15 ms 3192 KB Output is correct
28 Correct 24 ms 3192 KB Output is correct
29 Correct 15 ms 3192 KB Output is correct
30 Correct 27 ms 3324 KB Output is correct
31 Correct 27 ms 3320 KB Output is correct
32 Correct 26 ms 3320 KB Output is correct
33 Correct 26 ms 3320 KB Output is correct
34 Correct 26 ms 3320 KB Output is correct
35 Correct 10 ms 3064 KB Output is correct
36 Correct 11 ms 2936 KB Output is correct
37 Correct 10 ms 2936 KB Output is correct
38 Correct 6 ms 2936 KB Output is correct
39 Correct 7 ms 2936 KB Output is correct
40 Correct 61 ms 3672 KB Output is correct
41 Correct 7 ms 2936 KB Output is correct
42 Correct 61 ms 3576 KB Output is correct
43 Correct 62 ms 3576 KB Output is correct
44 Correct 67 ms 4652 KB Output is correct
45 Correct 4 ms 2680 KB Output is correct
46 Correct 40 ms 3704 KB Output is correct
47 Correct 62 ms 4728 KB Output is correct
48 Correct 40 ms 3576 KB Output is correct
49 Correct 62 ms 4600 KB Output is correct
50 Correct 46 ms 4600 KB Output is correct
51 Correct 90 ms 6520 KB Output is correct
52 Correct 22 ms 3192 KB Output is correct
53 Correct 68 ms 7032 KB Output is correct
54 Correct 98 ms 6904 KB Output is correct
55 Correct 22 ms 3192 KB Output is correct
56 Correct 25 ms 3192 KB Output is correct
57 Correct 4 ms 2680 KB Output is correct
58 Correct 67 ms 6904 KB Output is correct
59 Correct 21 ms 3704 KB Output is correct
60 Correct 20 ms 3192 KB Output is correct
61 Correct 20 ms 3576 KB Output is correct
62 Correct 20 ms 3704 KB Output is correct
63 Correct 65 ms 4600 KB Output is correct
64 Correct 39 ms 4344 KB Output is correct
65 Correct 32 ms 3576 KB Output is correct
66 Correct 22 ms 3576 KB Output is correct
67 Correct 64 ms 5112 KB Output is correct
68 Correct 41 ms 4344 KB Output is correct
69 Correct 30 ms 3452 KB Output is correct
70 Correct 38 ms 4344 KB Output is correct
71 Correct 62 ms 4856 KB Output is correct
72 Correct 53 ms 4856 KB Output is correct
73 Correct 14 ms 3192 KB Output is correct
74 Correct 39 ms 4472 KB Output is correct
75 Correct 53 ms 4856 KB Output is correct
76 Correct 27 ms 3960 KB Output is correct
77 Correct 56 ms 5368 KB Output is correct
78 Correct 15 ms 3192 KB Output is correct
79 Correct 23 ms 4120 KB Output is correct
80 Correct 28 ms 3960 KB Output is correct
81 Correct 49 ms 5368 KB Output is correct
82 Correct 6 ms 2936 KB Output is correct
83 Correct 22 ms 4088 KB Output is correct
84 Correct 33 ms 4856 KB Output is correct
85 Correct 8 ms 2936 KB Output is correct
86 Correct 33 ms 4728 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 50 ms 3292 KB Output is correct
4 Correct 23 ms 3192 KB Output is correct
5 Correct 23 ms 3192 KB Output is correct
6 Correct 25 ms 3192 KB Output is correct
7 Correct 25 ms 3196 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 23 ms 3192 KB Output is correct
12 Correct 23 ms 3112 KB Output is correct
13 Correct 4 ms 2656 KB Output is correct
14 Correct 24 ms 3208 KB Output is correct
15 Correct 4 ms 2652 KB Output is correct
16 Correct 26 ms 3192 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 25 ms 3192 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 10 ms 2936 KB Output is correct
21 Correct 10 ms 2936 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 28 ms 3192 KB Output is correct
24 Correct 4 ms 2680 KB Output is correct
25 Correct 28 ms 3320 KB Output is correct
26 Correct 25 ms 3192 KB Output is correct
27 Correct 15 ms 3192 KB Output is correct
28 Correct 24 ms 3192 KB Output is correct
29 Correct 15 ms 3192 KB Output is correct
30 Correct 27 ms 3324 KB Output is correct
31 Correct 27 ms 3320 KB Output is correct
32 Correct 26 ms 3320 KB Output is correct
33 Correct 26 ms 3320 KB Output is correct
34 Correct 26 ms 3320 KB Output is correct
35 Correct 10 ms 3064 KB Output is correct
36 Correct 11 ms 2936 KB Output is correct
37 Correct 10 ms 2936 KB Output is correct
38 Correct 6 ms 2936 KB Output is correct
39 Correct 7 ms 2936 KB Output is correct
40 Correct 61 ms 3672 KB Output is correct
41 Correct 7 ms 2936 KB Output is correct
42 Correct 61 ms 3576 KB Output is correct
43 Correct 62 ms 3576 KB Output is correct
44 Correct 4 ms 2680 KB Output is correct
45 Execution timed out 3057 ms 16804 KB Time limit exceeded
46 Halted 0 ms 0 KB -